No. Title Author Year
1 Chasing Puppies: Mobile Beacon Routing on Closed Curves Abrahamsen, Mikkel et al. 2021
2 Dots & Boxes Is PSPACE-Complete Buchin, Kevin et al. 2021
3 Minimum Scan Cover and Variants - Theory and Experiments Buchin, Kevin et al. 2021
4 Designing Art Galleries (Media Exposition) van Benthem, Toon et al. 2020
5 Dots & Polygons (Media Exposition) Buchin, Kevin et al. 2020
6 Multi-Robot Motion Planning of k-Colored Discs Is PSPACE-Hard Brocken, Thomas et al. 2020
7 Turning Machines Kostitsyna, Irina et al. 2020
8 Fragile Complexity of Comparison-Based Algorithms Afshani, Peyman et al. 2019
9 Global Curve Simplification van de Kerkhof, Mees et al. 2019
10 Preprocessing Ambiguous Imprecise Points van der Hoog, Ivor et al. 2019
11 An Optimal Algorithm to Compute the Inverse Beacon Attraction Region Kostitsyna, Irina et al. 2018
12 Convex Partial Transversals of Planar Regions Keikha, Vahideh et al. 2018
13 Shape Recognition by a Finite Automaton Robot Gmyr, Robert et al. 2018
14 Non-Crossing Geometric Steiner Arborescences Kostitsyna, Irina et al. 2017
15 Self-Approaching Paths in Simple Polygons Bose, Prosenjit et al. 2017
16 Homotopy Measures for Representative Trajectories Chambers, Erin et al. 2016
17 On the Complexity of Minimum-Link Path Problems Kostitsyna, Irina et al. 2016
18 Trajectory Grouping Structure under Geodesic Distance Kostitsyna, Irina et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 18


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI