SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Recognizing Graphs without Asteroidal Triples
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Interval degree and bandwidth of a graph
Discrete Applied Mathematics
Representing a concept lattice by a graph
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Tree-decompositions of small pathwidth
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
On the interval completion of chordal graphs
Discrete Applied Mathematics
Discrete Applied Mathematics
Treewidth and logical definability of graph products
Theoretical Computer Science
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Tree-decompositions of small pathwidth
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Discrete Applied Mathematics
Representing a concept lattice by a graph
Discrete Applied Mathematics
On the interval completion of chordal graphs
Discrete Applied Mathematics
A characterisation of the minimal triangulations of permutation graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Treewidth and minimum fill-in on permutation graphs in linear time
Theoretical Computer Science
Separator orders in interval, cocomparability, and AT-free graphs
Discrete Applied Mathematics
Theoretical Computer Science
Computing treewidth and minimum fill-in for permutation graphs in linear time
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Kernel bounds for structural parameterizations of pathwidth
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
On the stable degree of graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Hi-index | 0.05 |