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
Hole and antihole detection in graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Note: An improved algorithm for the longest induced path problem on k-chordal graphs
Discrete Applied Mathematics
Maximum Weight Independent Sets in hole- and co-chair-free graphs
Information Processing Letters
Maximum weight independent sets in hole- and dart-free graphs
Discrete Applied Mathematics
Finding and listing induced paths and cycles
Discrete Applied Mathematics
Hi-index | 0.89 |