Listing all potential maximal cliques of a graph
Theoretical Computer Science
LexBFS-Ordering in Asteroidal Triple-Free Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Listing All Potential Maximal Cliques of a Graph
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Generating All the Minimal Separators of a Graph
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Approximating the Treewidth of AT-Free Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Efficient Implementation of a Minimal Triangulation Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Approximating the treewidth of AT-free graphs
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Computing minimal triangulations in time O(nα log n) = o(n2.376)
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A wide-range algorithm for minimal triangulation from an arbitrary ordering
Journal of Algorithms
Characterizing and Computing Minimal Cograph Completions
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Mixed Search Number of Permutation Graphs
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Theoretical Computer Science
Discrete Applied Mathematics
Edge Search Number of Cographs in Linear Time
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Approximating the treewidth of AT-free graphs
Discrete Applied Mathematics
A wide-range algorithm for minimal triangulation from an arbitrary ordering
Journal of Algorithms
Characterizing and computing minimal cograph completions
Discrete Applied Mathematics
Treewidth and minimum fill-in of weakly triangulated graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
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
Subexponential parameterized algorithm for minimum fill-in
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Computing hypergraph width measures exactly
Information Processing Letters
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of 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
On the stable degree of graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |