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, 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, 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, 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

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

Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität Paderborn, 2018.https://doi.org/10.17619/UNIPB/1-271 .
LibreCat: /record/1209
DOI: 10.17619/UNIPB/1-271

Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” ArXiv:1702.03400, 2017.
LibreCat: /record/17811

Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.”https://doi.org/10.1007/978-3-319-72751-6_13__In Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS, edited by Antonio Fernández Anta, Tomasz Jurdzinski, Miguel A. Mosteiro, and Yanyong Zhang, 10718:168–81. Lecture Notes in Computer Science. Vienna, Austria: Springer, 2017.https://doi.org/10.1007/978-3-319-72751-6_13 .
LibreCat: /record/16347
DOI: 10.1007/978-3-319-72751-6_13

Cord-Landwehr, Andreas , Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303, 2016.
LibreCat: /record/16450
arXiv: 1602.03303

Cord-Landwehr, Andreas, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.”https://doi.org/10.1145/2935764.2935789__In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 301–12. ACM, 2016.https://doi.org/10.1145/2935764.2935789 .
LibreCat: /record/16359
DOI: 10.1145/2935764.2935789

Abshoff, Sebastian, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.”https://doi.org/10.1109/IPDPS.2016.51__In Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), 689–99. IEEE, 2016.https://doi.org/10.1109/IPDPS.2016.51 .
LibreCat: /record/16360
DOI: 10.1109/IPDPS.2016.51

Abshoff, Sebastian, Andreas  Cord-Landwehr, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.” ArXiv:1510.05454, 2015.
LibreCat: /record/16449
arXiv: 1510.05454

Abshoff, Sebastian, Andreas Andreas Cord-Landwehr, Daniel Jung, and Friedhelm Meyer auf der Heide. “Towards Gathering Robots with Limited View in Linear Time: The Closed  Chain Case.” ArXiv: 1501.04877, 2015.
LibreCat: /record/16397
arXiv: 1501.04877

Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Brief Announcement: A Model for Multilevel Network Games.” In Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 294. LNCS, 2014.
LibreCat: /record/452

Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Multilevel Network Games.”https://doi.org/10.1007/978-3-319-13129-0_36__In Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 435–40. LNCS, 2014.https://doi.org/10.1007/978-3-319-13129-0_36 .
LibreCat: /record/395
DOI: 10.1007/978-3-319-13129-0_36