Author of the publication

Bicriteria Aggregation of Polygons via Graph Cuts.

, , , , and . GIScience (II), volume 208 of LIPIcs, page 6:1-6:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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

Min-sum Clustering of Protein Sequences with Limited Distance Information., , , , and . SIMBAD, volume 7005 of Lecture Notes in Computer Science, page 192-206. Springer, (2011)Connected k-Center and k-Diameter Clustering., , , , , and . ICALP, volume 261 of LIPIcs, page 50:1-50:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Finding Short Paths on Polytopes by the Shadow Vertex Algorithm., and . ICALP (1), volume 7965 of Lecture Notes in Computer Science, page 279-290. Springer, (2013)Agnostic Clustering., , and . ALT, volume 5809 of Lecture Notes in Computer Science, page 384-398. Springer, (2009)Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem., and . ESA, volume 9294 of Lecture Notes in Computer Science, page 509-520. Springer, (2015)New Deterministic Algorithms for Solving Parity Games., , and . LATIN, volume 9644 of Lecture Notes in Computer Science, page 634-645. Springer, (2016)Smoothed Performance Guarantees for Local Search., , , and . ESA, volume 6942 of Lecture Notes in Computer Science, page 772-783. Springer, (2011)The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers., and . WAOA, volume 6534 of Lecture Notes in Computer Science, page 47-58. Springer, (2010)Lower Bounds for the Average and Smoothed Number of Pareto-Optima., , , and . Theory Comput., (2014)Pearls of Algorithms Part 3: Probabilistic Analysis and Randomized Algorithms. (2010)