An efficient algorithm for finding a two-pair, and its applications

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

Between O(nm) and O(nα)

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

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)