Author of the publication

New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs.

, , and . WG, volume 2573 of Lecture Notes in Computer Science, page 282-295. Springer, (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A note on probe cographs. CoRR, (2012)Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs., and . J. Algorithms, 21 (2): 358-402 (1996)On efficient absorbant conjecture in generalized De Bruijn digraphs., , and . Int. J. Comput. Math., 94 (5): 922-932 (2017)Maximum Clique Transversals., , and . WG, volume 2204 of Lecture Notes in Computer Science, page 32-43. Springer, (2001)New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs., , and . WG, volume 2573 of Lecture Notes in Computer Science, page 282-295. Springer, (2002)Kruskalian Graphs., and . CATS, volume 109 of CRPIT, page 49-54. Australian Computer Society, (2010)Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs., , and . WG, volume 1335 of Lecture Notes in Computer Science, page 109-117. Springer, (1997)On the Equivalence Covering Number of Splitgraphs., and . Inf. Process. Lett., 54 (5): 301-304 (1995)A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs., and . STACS, volume 577 of Lecture Notes in Computer Science, page 415-423. Springer, (1992)Treewidth of Bipartite Graphs., and . STACS, volume 665 of Lecture Notes in Computer Science, page 80-89. Springer, (1993)