| No. |
Title |
Author |
Year |
| 1 |
Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs |
Feldmann, Michael et al. |
2021 |
| 2 |
Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 18331) |
Berman, Spring et al. |
2019 |
| 3 |
Fast Distributed Algorithms for LP-Type Problems of Low Dimension |
Hinnenthal, Kristian et al. |
2019 |
| 4 |
On the Complexity of Local Graph Transformations |
Scheideler, Christian et al. |
2019 |
| 5 |
Shape Recognition by a Finite Automaton Robot |
Gmyr, Robert et al. |
2018 |
| 6 |
Distributed Monitoring of Network Properties: The Power of Hybrid Networks |
Gmyr, Robert et al. |
2017 |
| 7 |
Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 16271) |
Fekete, Sándor et al. |
2016 |
| 8 |
Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures |
Scheideler, Christian et al. |
2016 |
| 9 |
Algorithms for Wireless Communication (Dagstuhl Seminar 14051) |
Even, Guy et al. |
2014 |
| 10 |
Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing |
Kolman, Petr et al. |
2011 |
| 11 |
Stabilizing Consensus with the Power of Two Choices |
Doerr, Benjamin et al. |
2010 |
