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