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

Tradeoffs between knowledge and time of communication in geometric radio networks., and . SPAA, page 59-66. ACM, (2001)Optimal Broadcasting in Almost Trees and Partial k-trees., , , and . STACS, volume 1373 of Lecture Notes in Computer Science, page 432-443. Springer, (1998)Ultrafast Randomized Parallel Construction and Approximation Algorithms for Spanning Forests in Dense Graphs., , , and . IPPS/SPDP Workshops, volume 1388 of Lecture Notes in Computer Science, page 392-399. Springer, (1998)Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices., , and . SWAT, volume 3111 of Lecture Notes in Computer Science, page 248-259. Springer, (2004)Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees., , and . ESA, volume 1136 of Lecture Notes in Computer Science, page 501-513. Springer, (1996)On the Power of Nonconservative PRAM., and . MFCS, volume 1113 of Lecture Notes in Computer Science, page 303-311. Springer, (1996)Deterministic Radio Broadcasting at Low Cost., and . STACS, volume 2010 of Lecture Notes in Computer Science, page 158-169. Springer, (2001)Trade-Offs Between Load and Degree in Virtual Path Layouts., , and . Parallel Process. Lett., 13 (3): 485-496 (2003)A Note on Parallel Complexity of Maximum f-Matching., , and . Inf. Process. Lett., 65 (2): 107-109 (1998)Approximation Algorithms for Maximum Two-Dimensional Pattern Matching., , , and . CPM, volume 1075 of Lecture Notes in Computer Science, page 348-360. Springer, (1996)