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.”https://doi.org/10.1016/j.tcs.2022.10.031__Theoretical Computer Science 939 (2023): 261–91.https://doi.org/10.1016/j.tcs.2022.10.031 .
LibreCat: /record/33947
DOI: 10.1016/j.tcs.2022.10.031
arXiv: 2010.04424 

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 .”https://doi.org/10.4230/LIPIcs.OPODIS.2022.15__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: /record/34008
DOI: 10.4230/LIPIcs.OPODIS.2022.15
arXiv: 2206.07567 

Castenow, Jannik, Jonas Harbig, and Friedhelm Meyer auf der Heide. “Unifying Gathering Protocols for Swarms of Mobile Robots.”https://doi.org/10.1007/978-3-031-30448-4_1__In Lecture Notes in Computer Science. Cham: Springer International Publishing, 2023.https://doi.org/10.1007/978-3-031-30448-4_1 .
LibreCat: /record/44769
DOI: 10.1007/978-3-031-30448-4_1

Castenow, Jannik. Local Protocols for Contracting and Expanding Robot Formation Problems, 2023.https://doi.org/10.17619/UNIPB/1-1750 .
LibreCat: /record/45580
DOI: 10.17619/UNIPB/1-1750

Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Discrete and Continuous Study of the Max-Chain-Formation Problem.”https://doi.org/10.1016/j.ic.2022.104877__Information and Computation, 2022.https://doi.org/10.1016/j.ic.2022.104877 .
LibreCat: /record/29843
DOI: 10.1016/j.ic.2022.104877

Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “The K-Server with Preferences Problem.”https://doi.org/10.1145/3490148.3538595__In Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 345–56. Association for Computing Machinery, 2022.https://doi.org/10.1145/3490148.3538595 .
LibreCat: /record/31847
DOI: 10.1145/3490148.3538595
arXiv: 2205.11102

Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time.”https://doi.org/10.1007/978-3-030-89240-1_3__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: /record/23730
DOI: 10.1007/978-3-030-89240-1_3
arXiv: 2010.04424

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.”https://doi.org/10.1007/978-3-030-91081-5_19__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: /record/26986
DOI: 10.1007/978-3-030-91081-5_19
arXiv: 2109.11856

Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up.”https://doi.org/10.1007/978-3-030-64348-5_6__In Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings, edited by Stéphanehttps://doi.org/10.1007/978-3-030-64348-5_6__Devismeshttps://doi.org/10.1007/978-3-030-64348-5_6__and Neerajhttps://doi.org/10.1007/978-3-030-64348-5_6__Mittal, 12514:65–80. Lecture Notes in Computer Science (LNCS). Springer, 2020.https://doi.org/10.1007/978-3-030-64348-5_6 .
LibreCat: /record/19899
DOI: 10.1007/978-3-030-64348-5_6
arXiv: 2010.02043 

Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &; Luminous Robots with Limited Visibility .”https://doi.org/10.1007/978-3-030-64348-5_5__In Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , edited by Stéphanehttps://doi.org/10.1007/978-3-030-64348-5_5__Devismes and Neerajhttps://doi.org/10.1007/978-3-030-64348-5_5__Mittal, 12514:60–64. Lecture Notes in Computer Science (LNCS). Springer, 2020.https://doi.org/10.1007/978-3-030-64348-5_5 .
LibreCat: /record/20185
DOI: 10.1007/978-3-030-64348-5_5
arXiv: 2010.04424 

Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “The Online Multi-Commodity Facility Location Problem.”https://doi.org/10.1145/3350755.3400281__In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.https://doi.org/10.1145/3350755.3400281 .
LibreCat: /record/17370
DOI: 10.1145/3350755.3400281
arXiv: 2005.08391

Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed Up.”https://doi.org/10.1145/3350755.3400263__In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.https://doi.org/10.1145/3350755.3400263 .
LibreCat: /record/17371
DOI: 10.1145/3350755.3400263
arXiv: 2010.02043 

Braun, Michael, Jannik Castenow, and Friedhelm Meyer auf der Heide. “Local Gathering of Mobile Robots in Three Dimensions.”https://doi.org/10.1007/978-3-030-54921-3_4__In Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO). Springer, 2020.https://doi.org/10.1007/978-3-030-54921-3_4 .
LibreCat: /record/16968
DOI: 10.1007/978-3-030-54921-3_4
arXiv: arXiv:2005.07495

Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). ACM, n.d.
LibreCat: /record/15169

Castenow, Jannik, Matthias Fischer, Jonas Harbig, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.”https://doi.org/10.1016/j.tcs.2020.02.018__Theoretical Computer Science 815 (2020): 289–309.https://doi.org/10.1016/j.tcs.2020.02.018 .
LibreCat: /record/16299
DOI: 10.1016/j.tcs.2020.02.018

Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.”https://doi.org/10.1007/978-3-030-24922-9‑26__In Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 345–48, 2019.https://doi.org/10.1007/978-3-030-24922-9‑26 .
LibreCat: /record/14539
DOI: 10.1007/978-3-030-24922-9‑26

Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer, 2018.
LibreCat: /record/4563

Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.”https://doi.org/10.1145/3210377.3210663__In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press, 2018.https://doi.org/10.1145/3210377.3210663 .
LibreCat: /record/4565
DOI: 10.1145/3210377.3210663

Benter, Markus, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander Setzer, and Jannik Sundermeier. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.”https://doi.org/10.1007/978-3-030-19759-9_4__In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018.https://doi.org/10.1007/978-3-030-19759-9_4 .
LibreCat: /record/4375
DOI: 10.1007/978-3-030-19759-9_4

Sundermeier, Jannik. Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions. Universität Paderborn, 2017.
LibreCat: /record/699