Castenow, J., Harbig, J., Jung, D., Knollmann, T., &; Meyer auf der Heide, F. (2023). Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. Theoretical Computer Science, 939, 261–291.https://doi.org/10.1016/j.tcs.2022.10.031 

Castenow, J., Harbig, J., Jung, D., Kling, P., Knollmann, T., &; Meyer auf der Heide, F. (2023). A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility . In E. Hillel, R. Palmieri, &; E. Riviére (Eds.), Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS)  (Vol. 253, p. 15:1–15:25). Schloss Dagstuhl – Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.OPODIS.2022.15 

Castenow, J., Harbig, J., &; Meyer auf der Heide, F. (2023). Unifying Gathering Protocols for Swarms of Mobile Robots. In Lecture Notes in Computer Science. Springer International Publishing.https://doi.org/10.1007/978-3-031-30448-4_1 

Castenow, J., Harbig, J., Jung, D., Knollmann, T., &; Meyer auf der Heide, F. (2021). Gathering a Euclidean Closed Chain of Robots in Linear Time. In L. Gasieniec, R. Klasing, &; T. Radzik (Eds.), Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS) (Vol. 12961, pp. 29–44). Springer.https://doi.org/10.1007/978-3-030-89240-1_3 

Castenow, J., Harbig, J., Jung, D., Knollmann, T., &; Meyer auf der Heide, F. (2020). Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &; Luminous Robots with Limited Visibility . In S. Devismes &; N.https://doi.org/10.1007/978-3-030-64348-5_5__Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings  (Vol. 12514, pp. 60–64). Springer.https://doi.org/10.1007/978-3-030-64348-5_5