Doubly lexical orderings of matrices
SIAM Journal on Computing
Three partition refinement algorithms
SIAM Journal on Computing
Doubly lexical ordering of dense 0–1 matrices
Information Processing Letters
Graph classes: a survey
Algorithms for Maximum Matching and Minimum Fill-in on Chordal Bipartite Graphs
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
Finding a maximum induced matching in weakly chordal graphs
Discrete Mathematics - Special issue: The 18th British combinatorial conference
On easy and hard hereditary classes of graphs with respect to the independent set problem
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
On the structure and stability number of P5- and co-chair-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
On algorithms for (P5,gem)-free graphs
Theoretical Computer Science - Graph colorings
New applications of clique separator decomposition for the Maximum Weight Stable Set problem
Theoretical Computer Science
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
Theoretical Computer Science
Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
Journal of Combinatorial Theory Series B
Theoretical Computer Science
Characterising (k,l)-leaf powers
Discrete Applied Mathematics
On the structure of (P5,gem)-free graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Chordal co-gem-free and (P5,gem)-free graphs have bounded clique-width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics
On distance-3 matchings and induced matchings
Discrete Applied Mathematics
On graphs without a C4 or a diamond
Discrete Applied Mathematics
Maximum weight independent sets in hole- and dart-free graphs
Discrete Applied Mathematics
On atomic structure of P5-free subclasses and Maximum Weight Independent Set problem
Theoretical Computer Science
| Hi-index | 0.05 |
Clique separator decomposition, introduced by Whitesides and Tarjan, is one of the most important graph decompositions. A hole is a chordless cycle with at least five vertices. A paraglider is a graph with five vertices a,b,c,d,e and edges ab,ac,bc,bd,cd,ae,de. We show that every (hole, paraglider)-free graph admits a clique separator decomposition into graphs of three very specific types. This yields efficient algorithms for various optimization problems in this class of graphs.