| No. |
Title |
Author |
Year |
| 1 |
Stable Approximation Algorithms for Dominating Set and Independent Set |
de Berg, Mark et al. |
2023 |
| 2 |
Computing Smallest Convex Intersecting Polygons |
Antoniadis, Antonios et al. |
2022 |
| 3 |
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem |
Afshani, Peyman et al. |
2022 |
| 4 |
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem |
de Berg, Mark et al. |
2022 |
| 5 |
TSP in a Simple Polygon |
Alkema, Henk et al. |
2022 |
| 6 |
Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds |
Banyassady, Bahareh et al. |
2022 |
| 7 |
Clique-Based Separators for Geometric Intersection Graphs |
de Berg, Mark et al. |
2021 |
| 8 |
k-Center Clustering with Outliers in the Sliding-Window Model |
de Berg, Mark et al. |
2021 |
| 9 |
Maximum-Weight Matching in Sliding Windows and Beyond |
Biabani, Leyla et al. |
2021 |
| 10 |
Rectilinear Steiner Trees in Narrow Strips |
Alkema, Henk et al. |
2021 |
| 11 |
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model |
Aronov, Boris et al. |
2021 |
| 12 |
Euclidean TSP in Narrow Strips |
Alkema, Henk et al. |
2020 |
| 13 |
On β-Plurality Points in Spatial Voting Games |
Aronov, Boris et al. |
2020 |
| 14 |
Preclustering Algorithms for Imprecise Points |
Abam, Mohammad Ali et al. |
2020 |
| 15 |
The Online Broadcast Range-Assignment Problem |
de Berg, Mark et al. |
2020 |
| 16 |
On One-Round Discrete Voronoi Games |
de Berg, Mark et al. |
2019 |
| 17 |
The Dominating Set Problem in Geometric Intersection Graphs |
de Berg, Mark et al. |
2018 |
| 18 |
Dynamic Conflict-Free Colorings in the Plane |
de Berg, Mark et al. |
2017 |
| 19 |
Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces |
de Berg, Mark et al. |
2017 |
| 20 |
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points |
de Berg, Mark et al. |
2017 |
| 21 |
Minimum Perimeter-Sum Partitions in the Plane |
Abrahamsen, Mikkel et al. |
2017 |
| 22 |
Range-Clustering Queries |
Abrahamsen, Mikkel et al. |
2017 |
| 23 |
Shortcuts for the Circle |
Bae, Sang Won et al. |
2017 |
| 24 |
Faster Algorithms for Computing Plurality Points |
de Berg, Mark et al. |
2016 |
| 25 |
Fine-Grained Complexity Analysis of Two Classic TSP Variants |
de Berg, Mark et al. |
2016 |
| 26 |
Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes |
de Berg, Mark et al. |
2016 |
| 27 |
10491 Results of the break-out group: Aggregation |
de Berg, Mark et al. |
2011 |
| 28 |
10491 Results of the break-out group: Gulls Data |
van Loon, Emiel et al. |
2011 |
| 29 |
The Traveling Salesman Problem under Squared Euclidean Distances |
van Nijnatten, Fred et al. |
2010 |
| 30 |
Kinetic kd-Trees and Longest-Side kd-Trees |
Abam, Mohammad et al. |
2008 |
| 31 |
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree |
Arge, Lars et al. |
2005 |
