Author of the publication

Geometric Multicut.

, , , and . ICALP, volume 132 of LIPIcs, page 9:1-9:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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

Framework for ∃R-Completeness of Two-Dimensional Packing Problems., , and . CoRR, (2020)Training Neural Networks is ER-complete., , and . NeurIPS, page 18293-18306. (2021)Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity., , , and . AAMAS, page 932-940. ACM, (2023)Tiling with Squares and Packing Dominos in Polynomial Time., , , and . ACM Trans. Algorithms, 19 (3): 30:1-30:28 (July 2023)Near-Optimal Induced Universal Graphs for Bounded Degree Graphs., , , , and . ICALP, volume 80 of LIPIcs, page 128:1-128:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Minimum Star Partitions of Simple Polygons in Polynomial Time., , , and . CoRR, (2023)Finding the Maximum Subset with Bounded Convex Curvature., and . SoCG, volume 51 of LIPIcs, page 4:1-4:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)The art gallery problem is ∃ ℝ-complete., , and . STOC, page 65-73. ACM, (2018)Constructing Concise Convex Covers via Clique Covers (CG Challenge)., , and . SoCG, volume 258 of LIPIcs, page 66:1-66:9. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Clustering with Few Disks to Minimize the Sum of Radii., , , , and . SoCG, volume 293 of LIPIcs, page 2:1-2:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)