( en | de | ru )

 

Disambiguation of "Kloks, Ton"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs.

, and . J. Algorithms, 21 (2): 358-402 (1996)

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.

Ton Vullinghs

Ton Heukels

Ton Vullinghs

Ton Quoc Cuong

Kristallstruktur-Design und konzeptionelle Entwicklung zur frühzeitigen Erkennung von supramolekularen Komplexen. Uni Frankfurt Main, (2009)

Ton-Ku Kang

 

Other publications of authors with the same name

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)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)Treewidth of Bipartite Graphs., and . STACS, volume 665 of Lecture Notes in Computer Science, page 80-89. Springer, (1993)lambda-Coloring of Graphs., , , and . STACS, volume 1770 of Lecture Notes in Computer Science, page 395-406. Springer, (2000)On efficient absorbant conjecture in generalized De Bruijn digraphs., , and . Int. J. Comput. Math., 94 (5): 922-932 (2017)On the Equivalence Covering Number of Splitgraphs., and . Inf. Process. Lett., 54 (5): 301-304 (1995)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)Kruskalian Graphs., and . CATS, volume 109 of CRPIT, page 49-54. Australian Computer Society, (2010)