Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
9 Publications
2025 | Conference Paper | LibreCat-ID: 56298 | 
Gerlach, Raphael, Sören von der Gracht, Christopher Hahn, Jonas Harbig, and Peter Kling. “Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility.” In 28th International Conference on Principles of Distributed Systems (OPODIS 2024), edited by Silvia Bonomi, Letterio Galletta, Etienne Rivière, and Valerio Schiavoni, Vol. 324. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.OPODIS.2024.13.
LibreCat
| DOI
| Download (ext.)
| arXiv
2025 | Preprint | LibreCat-ID: 58953 |
Gerlach, Raphael, and Sören von der Gracht. “Analyzing Symmetries of Swarms of Mobile Robots Using Equivariant Dynamical Systems.” ArXiv:2503.07576, 2025.
LibreCat
| Files available
| arXiv
2024 | Preprint | LibreCat-ID: 44840 |
Gerlach, Raphael, Sören von der Gracht, and Michael Dellnitz. “On the Dynamical Hierarchy in Gathering Protocols with Circulant Topologies.” ArXiv:2305.06632, n.d.
LibreCat
| Files available
| Download (ext.)
| arXiv
2023 | Journal Article | LibreCat-ID: 33947
Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation.” Theoretical Computer Science 939 (2023): 261–91. https://doi.org/10.1016/j.tcs.2022.10.031.
LibreCat
| DOI
| arXiv
2023 | Conference Paper | LibreCat-ID: 34008
Castenow, Jannik, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility .” In Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) , edited by Eshcar Hillel, Roberto Palmieri, and Etienne Riviére, 253:15:1–15:25. Leibniz International Proceedings in Informatics (LIPIcs). Brussels: Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.OPODIS.2022.15.
LibreCat
| DOI
| arXiv
2023 | Book Chapter | LibreCat-ID: 44769
Castenow, Jannik, Jonas Harbig, and Friedhelm Meyer auf der Heide. “Unifying Gathering Protocols for Swarms of Mobile Robots.” In Lecture Notes in Computer Science. Cham: Springer International Publishing, 2023. https://doi.org/10.1007/978-3-031-30448-4_1.
LibreCat
| DOI
2022 | Journal Article | LibreCat-ID: 29843
Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Discrete and Continuous Study of the Max-Chain-Formation Problem.” Information and Computation, 2022. https://doi.org/10.1016/j.ic.2022.104877.
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 23730
Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time.” In Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), edited by Leszek Gasieniec, Ralf Klasing, and Tomasz Radzik, 12961:29–44. LNCS. Springer, 2021. https://doi.org/10.1007/978-3-030-89240-1_3.
LibreCat
| DOI
| arXiv
2021 | Conference Paper | LibreCat-ID: 26986
Castenow, Jannik, Thorsten Götte, Till Knollmann, and Friedhelm Meyer auf der Heide. “The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation.” In Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, edited by C. Johnen, E.M. Schiller, and S. Schmid, 13046:289–304. LNCS. Springer, 2021. https://doi.org/10.1007/978-3-030-91081-5_19.
LibreCat
| DOI
| arXiv