| No. |
Title |
Author |
Year |
| 1 |
Fragile Complexity of Comparison-Based Algorithms |
Afshani, Peyman et al. |
2019 |
| 2 |
Global Curve Simplification |
van de Kerkhof, Mees et al. |
2019 |
| 3 |
Preprocessing Ambiguous Imprecise Points |
van der Hoog, Ivor et al. |
2019 |
| 4 |
An Optimal Algorithm to Compute the Inverse Beacon Attraction Region |
Kostitsyna, Irina et al. |
2018 |
| 5 |
Convex Partial Transversals of Planar Regions |
Keikha, Vahideh et al. |
2018 |
| 6 |
Shape Recognition by a Finite Automaton Robot |
Gmyr, Robert et al. |
2018 |
| 7 |
Non-Crossing Geometric Steiner Arborescences |
Kostitsyna, Irina et al. |
2017 |
| 8 |
Self-Approaching Paths in Simple Polygons |
Bose, Prosenjit et al. |
2017 |
| 9 |
Homotopy Measures for Representative Trajectories |
Chambers, Erin et al. |
2016 |
| 10 |
On the Complexity of Minimum-Link Path Problems |
Kostitsyna, Irina et al. |
2016 |
| 11 |
Trajectory Grouping Structure under Geodesic Distance |
Kostitsyna, Irina et al. |
2015 |
