Author of the publication

Hardness and Approximation of Traffic Grooming.

, , and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 561-573. Springer, (2007)

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

Maximum Cuts in Edge-colored Graphs., , , , and . Electron. Notes Discret. Math., (2017)Designing Hypergraph Layouts to GMPLS Routing Strategies., , , , , and . SIROCCO, volume 5869 of Lecture Notes in Computer Science, page 57-71. Springer, (2009)Complexity Dichotomies for the Minimum ℱ -Overlay Problem., , , , and . IWOCA, volume 10765 of Lecture Notes in Computer Science, page 116-127. Springer, (2017)Dynamic programming for graphs on surfaces., , and . ACM Trans. Algorithms, 10 (2): 8:1-8:26 (2014)An FPT 2-Approximation for Tree-cut Decomposition., , , , and . WAOA, volume 9499 of Lecture Notes in Computer Science, page 35-46. Springer, (2015)Target set selection with maximum activation time., , , , and . Discret. Appl. Math., (October 2023)Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm., , and . SIAM J. Comput., 52 (4): 865-912 (August 2023)Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism., , , and . IPEC, volume 43 of LIPIcs, page 78-89. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)On Self-Duality of Branchwidth in Graphs of Bounded Genus., and . CTW, page 19-22. (2009)Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth., , and . IPEC, volume 89 of LIPIcs, page 4:1-4:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)