An efficient algorithm for finding a two-pair, and its applications
Discrete Applied Mathematics
Information Processing Letters
Algorithms for weakly triangulated graphs
Discrete Applied Mathematics
Meyniel weakly triangulated graphs—I: co-perfect orderability
Discrete Applied Mathematics
Meyniel weakly triangulated graphs II: a theorem of Dirac
Discrete Applied Mathematics
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
Finding a maximum induced matching in weakly chordal graphs
Discrete Mathematics - Special issue: The 18th British combinatorial conference
Discrete Mathematics
Hole and antihole detection in graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics
Improved algorithms for weakly chordal graphs
ACM Transactions on Algorithms (TALG)
Note: The induced matching and chain subgraph cover problems for convex bipartite graphs
Theoretical Computer Science
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
Theoretical Computer Science
Theoretical Computer Science
New min-max theorems for weakly chordal and dually hordal graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Generalized powers of graphs and their algorithmic use
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Maximum Weight Independent Sets in hole- and co-chair-free graphs
Information Processing Letters
New applications of clique separator decomposition for the maximum weight stable set problem
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |