Author of the publication

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

A Planar Linear Arboricity Conjecture., , and . CIAC, volume 6078 of Lecture Notes in Computer Science, page 204-216. Springer, (2010)Short Cycles in Planar Graphs.. WG, volume 2880 of Lecture Notes in Computer Science, page 284-296. Springer, (2003)35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality., and . WADS, volume 4619 of Lecture Notes in Computer Science, page 589-600. Springer, (2007)Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality., and . WADS, volume 5664 of Lecture Notes in Computer Science, page 471-482. Springer, (2009)On the Fine-Grained Complexity of Rainbow Coloring., , and . SIAM J. Discret. Math., 32 (3): 1672-1705 (2018)Tight Lower Bounds for the Complexity of Multicoloring., , , , and . ACM Trans. Comput. Theory, 11 (3): 13:1-13:19 (2019)Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard., , , , and . CoRR, (2023)Tight Lower Bounds for the Complexity of Multicoloring., , , , and . ESA, volume 87 of LIPIcs, page 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard., , , , and . SOSA, page 279-285. SIAM, (2024)Improving TSP Tours Using Dynamic Programming over Tree Decompositions., , and . ESA, volume 87 of LIPIcs, page 30:1-30:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)