| No. |
Title |
Author |
Year |
| 1 |
Computational Geometry (Dagstuhl Seminar 01121) |
Klein, Rolf et al. |
2021 |
| 2 |
Computational Geometry (Dagstuhl Seminar 03121) |
Halperin, Dan et al. |
2021 |
| 3 |
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons |
Ackerman, Eyal et al. |
2020 |
| 4 |
Geometric Multicut |
Abrahamsen, Mikkel et al. |
2019 |
| 5 |
Approximate Minimum-Weight Matching with Outliers Under Translation |
Agarwal, Pankaj K. et al. |
2018 |
| 6 |
Isotonic Regression by Dynamic Programming |
Rote, Günter |
2018 |
| 7 |
On Primal-Dual Circle Representations |
Felsner, Stefan et al. |
2018 |
| 8 |
Approximation and Hardness of Token Swapping |
Miltzow, Tillmann et al. |
2016 |
| 9 |
Congruence Testing of Point Sets in 4-Space |
Kim, Heuna et al. |
2016 |
| 10 |
Loopless Gray Code Enumeration and the Tower of Bucharest |
Herter, Felix et al. |
2016 |
| 11 |
Packing Short Plane Spanning Trees in Complete Geometric Graphs |
Aichholzer, Oswin et al. |
2016 |
| 12 |
Shortest Path to a Segment and Quickest Visibility Queries |
Arkin, Esther M. et al. |
2015 |
| 13 |
Two Applications of Point Matching |
Rote, Günter |
2009 |
