Listing all potential maximal cliques of a graph
Theoretical Computer Science
On claw-free asteroidal triple-free graphs
Discrete Applied Mathematics
Listing All Potential Maximal Cliques of a Graph
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On Claw-Free Asteroidal Triple-Free Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
On the Domination Search Number
WG '00 Proceedings of the 26th 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
On the domination search number
Discrete Applied Mathematics
Approximating the treewidth of AT-free graphs
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Induced matchings in asteroidal triple-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
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
Discrete Applied Mathematics
Mixed Search Number of Permutation Graphs
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Theoretical Computer Science
Theoretical Computer Science
Connected graph searching in chordal graphs
Discrete Applied Mathematics
Discrete Applied Mathematics
Computing branchwidth via efficient triangulations and blocks
Discrete Applied Mathematics
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
Discrete Applied Mathematics
Approximating the treewidth of AT-free graphs
Discrete Applied Mathematics
Dynamic programming and planarity: Improved tree-decomposition based algorithms
Discrete Applied Mathematics
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
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
How to use planarity efficiently: new tree-decomposition based algorithms
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
Fast minimal triangulation algorithm using minimum degree criterion
Theoretical Computer Science
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Constructing perfect phylogenies and proper triangulations for three-state characters
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
ESA'05 Proceedings of the 13th annual European conference on Algorithms
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
Computing branchwidth via efficient triangulations and blocks
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
ISBRA'10 Proceedings of the 6th international conference on Bioinformatics Research and Applications
A parameterized algorithm for chordal sandwich
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Connected treewidth and connected graph searching
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
The branch-width of circular-arc graphs
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Approximability of the path-distance-width for AT-free graphs
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Triangulation and clique separator decomposition of claw-free graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Approximating the path-distance-width for AT-free graphs and graphs in related classes
Discrete Applied Mathematics
| Hi-index | 0.00 |