Recognition of some perfectly orderable graph classes
Discrete Applied Mathematics
Extension of hereditary classes with substitutions
Discrete Applied Mathematics
Finding a central vertex in an HHD-free graph
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Oracles for vertex elimination orderings
Theoretical Computer Science
Finding a central vertex in an HHD-free graph
Discrete Applied Mathematics
An O(nm)-time certifying algorithm for recognizing HHD-free graphs
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Recognizing HHD-free and welsh-powell opposition graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
An O(nm)-time certifying algorithm for recognizing HHD-free graphs
Theoretical Computer Science
| Hi-index | 0.00 |