Author of the publication

Maximum packing for k-connected partial k-trees in polynomial time.

, , and . Theor. Comput. Sci., 236 (1-2): 179-191 (2000)

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

An Algebraic Theory of Graph Reduction., , , and . Graph-Grammars and Their Application to Computer Science, volume 532 of Lecture Notes in Computer Science, page 70-83. Springer, (1990)Maximum packing for k-connected partial k-trees in polynomial time., , and . Theor. Comput. Sci., 236 (1-2): 179-191 (2000)Multi-coloring Trees., , , , , and . COCOON, volume 1627 of Lecture Notes in Computer Science, page 271-280. Springer, (1999)Obstructions for linear rankwidth at most 1, , and . CoRR, (2011)Generation of Graphs with Bounded Branchwidth., , and . WG, volume 4271 of Lecture Notes in Computer Science, page 205-216. Springer, (2006)Complexity of Colored Graph Covers I. Colored Directed Multigraphs., , and . WG, volume 1335 of Lecture Notes in Computer Science, page 242-257. Springer, (1997)Qualitative Reasoning and Bifurcations in Dynamic Systems., and . MICAI, volume 4293 of Lecture Notes in Computer Science, page 259-271. Springer, (2006)Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs., , , , , and . WG, volume 8165 of Lecture Notes in Computer Science, page 127-138. Springer, (2013)Efficient Sets in Partial k-Trees., and . Discret. Appl. Math., 44 (1-3): 109-117 (1993)Complexity of Graph Covering Problems., , and . WG, volume 903 of Lecture Notes in Computer Science, page 93-105. Springer, (1994)