( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs.

, , и . WG, том 1335 из Lecture Notes in Computer Science, стр. 109-117. Springer, (1997)

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.

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

 

Другие публикации лиц с тем же именем

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