Weakly chordal graph algorithms via handles
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Recognizing weakly triangulated graphs by edge separability
Nordic Journal of Computing
Recognizing Weakly Triangulated Graphs by Edge Separability
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Improved algorithms for weakly chordal graphs
ACM Transactions on Algorithms (TALG)
Theoretical Computer Science
Exponential time algorithms for the minimum dominating set problem on some graph classes
ACM Transactions on Algorithms (TALG)
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 | 0.05 |