Recognition of some perfectly orderable graph classes
Discrete Applied Mathematics
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
An O(nm)-time certifying algorithm for recognizing HHD-free graphs
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
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 | 5.23 |