Efficient and practical modular decomposition
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Weakly chordal graph algorithms via handles
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Recognizing weakly triangulated graphs by edge separability
Nordic Journal of Computing
Critical and Anticritical Edges in Perfect Graphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Minimal Triangulations for Graphs with "Few" Minimal Separators
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Recognizing Weakly Triangulated Graphs by Edge Separability
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Finding a maximum induced matching in weakly chordal graphs
Discrete Mathematics - Special issue: The 18th British combinatorial conference
Discrete Mathematics
Hole and antihole detection in graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
NP-completeness results for edge modification problems
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Improved algorithms for weakly chordal graphs
ACM Transactions on Algorithms (TALG)
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
Theoretical Computer Science
Treewidth and minimum fill-in of weakly triangulated graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
New min-max theorems for weakly chordal and dually hordal graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Maximum Weight Independent Sets in hole- and co-chair-free graphs
Information Processing Letters
Faster dynamic algorithms for chordal graphs, and an application to phylogeny
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
New applications of clique separator decomposition for the maximum weight stable set problem
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Approximation algorithms for B 1-EPG graphs
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Hi-index | 0.05 |