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

The VC Dimension of Metric Balls under Fréchet and Hausdorff Distances, , and . (2019)cite arxiv:1903.03211Comment: 23 pages, 5 figures.A faster algorithm for the Fr%eacute;chet distance in 1D for the imbalanced case., and . CoRR, (2024)On the Discrete Fréchet Distance in a Graph., , and . SoCG, volume 224 of LIPIcs, page 36:1-36:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Approximating Length-Restricted Means Under Dynamic Time Warping., , , , and . WAOA, volume 13538 of Lecture Notes in Computer Science, page 225-253. Springer, (2022)Range Reporting for Time Series via Rectangle Stabbing., and . SWAT, volume 294 of LIPIcs, page 15:1-15:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On Computing the k-Shortcut Fréchet Distance., and . ICALP, volume 229 of LIPIcs, page 46:1-46:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Analysis of a Greedy Heuristic for the Labeling of a Map with a Time-Window Interface., , , , , and . CoRR, (2022)Approximating (k, ℓ-Median Clustering for Polygonal Curves., , and . SODA, page 2697-2717. SIAM, (2021)Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance., , , and . SODA, page 517-550. SIAM, (2022)Approximating (k, ℓ)-center clustering for curves., , , , , , and . SODA, page 2922-2938. SIAM, (2019)