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


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