| No. |
Title |
Author |
Year |
| 1 |
Shortest Paths in Portalgons |
Löffler, Maarten et al. |
2023 |
| 2 |
Chromatic k-Nearest Neighbor Queries |
van der Horst, Thijs et al. |
2022 |
| 3 |
Minimum Link Fencing |
Bhore, Sujoy et al. |
2022 |
| 4 |
Nearest-Neighbor Decompositions of Drawings |
Cleve, Jonas et al. |
2022 |
| 5 |
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem |
Afshani, Peyman et al. |
2022 |
| 6 |
Pushing Blocks by Sweeping Lines |
A. Akitaya, Hugo et al. |
2022 |
| 7 |
Segment Visibility Counting Queries in Polygons |
Buchin, Kevin et al. |
2022 |
| 8 |
Adjacency Graphs of Polyhedral Surfaces |
Arseneva, Elena et al. |
2021 |
| 9 |
Chasing Puppies: Mobile Beacon Routing on Closed Curves |
Abrahamsen, Mikkel et al. |
2021 |
| 10 |
Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds |
Acharyya, Ankush et al. |
2021 |
| 11 |
Uncertain Curve Simplification |
Buchin, Kevin et al. |
2021 |
| 12 |
Fréchet Distance for Uncertain Curves |
Buchin, Kevin et al. |
2020 |
| 13 |
Trajectory Visibility |
Eades, Patrick et al. |
2020 |
| 14 |
A Manual Comparison of Convex Hull Algorithms (Multimedia Exposition) |
Löffler, Maarten |
2019 |
| 15 |
Computation in Low-Dimensional Geometry and Topology (Dagstuhl Seminar 19352) |
Löffler, Maarten et al. |
2019 |
| 16 |
Geometric Multicut |
Abrahamsen, Mikkel et al. |
2019 |
| 17 |
Global Curve Simplification |
van de Kerkhof, Mees et al. |
2019 |
| 18 |
Preprocessing Ambiguous Imprecise Points |
van der Hoog, Ivor et al. |
2019 |
| 19 |
An Experimental Comparison of Two Definitions for Groups of Moving Entities (Short Paper) |
Wiratma, Lionov et al. |
2018 |
| 20 |
Convex Partial Transversals of Planar Regions |
Keikha, Vahideh et al. |
2018 |
| 21 |
Dynamic Smooth Compressed Quadtrees |
van der Hoog, Ivor et al. |
2018 |
| 22 |
On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance |
van Kreveld, Marc et al. |
2018 |
| 23 |
Applications of Topology to the Analysis of 1-Dimensional Objects (Dagstuhl Seminar 17072) |
Burton, Benjamin et al. |
2017 |
| 24 |
Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution) |
Buchin, Kevin et al. |
2017 |
| 25 |
A Refined Definition for Groups of Moving Entities and its Computation |
van Kreveld, Marc et al. |
2016 |
| 26 |
Grouping Time-Varying Data for Interactive Exploration |
van Goethem, Arthur et al. |
2016 |
| 27 |
Homotopy Measures for Representative Trajectories |
Chambers, Erin et al. |
2016 |
| 28 |
On the Complexity of Minimum-Link Path Problems |
Kostitsyna, Irina et al. |
2016 |
| 29 |
Recognizing a DOG is Hard, But Not When It is Thin and Unit |
Evans, William et al. |
2016 |
| 30 |
Trajectory Grouping Structure under Geodesic Distance |
Kostitsyna, Irina et al. |
2015 |
| 31 |
Listing all maximal cliques in sparse graphs in near-optimal time |
Eppstein, David et al. |
2011 |
