On treewidth approximations | 19 | 0.99 | 2004 |
Chordal embeddings of planar graphs | 16 | 1.02 | 2003 |
Approximating the treewidth of AT-free graphs | 3 | 0.46 | 2003 |
Listing all potential maximal cliques of a graph | 35 | 1.43 | 2002 |
Treewidth of planar graphs: connections with duality | 5 | 0.45 | 2001 |
On treewidth approximations | 3 | 0.48 | 2001 |
Treewidth and Minimum Fill-in: Grouping the Minimal Separators | 54 | 2.23 | 2001 |
Minimal Triangulations for Graphs with "Few" Minimal Separators | 5 | 0.63 | 1998 |
Preface: Orders, Algorithms and Applications | 0 | 0.34 | 1997 |
On-line algorithms for orders | 3 | 0.50 | 1997 |
Contiguity Orders | 0 | 0.34 | 1995 |
On the directionality of interval orders | 0 | 0.34 | 1994 |
Orders, Algorithms, and Applications, International Workshop ORDAL '94, Lyon, France, July 4-8, 1994, Proceedings | 13 | 1.71 | 1994 |
Finite labelling problem in event structures | 9 | 0.57 | 1994 |
Evaluating Array Expressions On Massively Parallel Machines With Communication/ Computation Overlap. | 7 | 0.60 | 1994 |