Multilevel Network Games. - Sebastian Abshoff; Andreas Cord-Landwehr; Daniel Jung 001; Alexander Skopalik (WINE, 2014)

Towards Gathering Robots with Limited View in Linear Time: The Closed Chain Case. - Sebastian Abshoff; Andreas Cord-Landwehr; Daniel Jung 001; Friedhelm Meyer auf der Heide (CoRR, 2015)

Gathering a Closed Chain of Robots on a Grid. - Sebastian Abshoff; Andreas Cord-Landwehr; Matthias Fischer 001; Daniel Jung 001; Friedhelm Meyer auf der Heide (IPDPS, 2016)

Asymptotically Optimal Gathering on a Grid. - Andreas Cord-Landwehr; Matthias Fischer 001; Daniel Jung 001; Friedhelm Meyer auf der Heide (SPAA, 2016)

Gathering Anonymous, Oblivious Robots on a Grid. - Matthias Fischer 001; Daniel Jung 001; Friedhelm Meyer auf der Heide (ALGOSENSORS, 2017)

Competitive Routing in Hybrid Communication Networks. - Daniel Jung 001; Christina Kolb; Christian Scheideler; Jannik Sundermeier (ALGOSENSORS, 2018)

Brief Announcement: Competitive Routing in Hybrid Communication Networks. - Daniel Jung 001; Christina Kolb; Christian Scheideler; Jannik Sundermeier (SPAA, 2018)

Local strategies for swarm formations on a grid. - Daniel Jung 001 (2018)

Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented and Luminous Robots with Limited Visibility. - Jannik Castenow; Jonas Harbig; Daniel Jung 001; Till Knollmann; Friedhelm Meyer auf der Heide (SSS, 2020)

Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility. - Jannik Castenow; Jonas Harbig; Daniel Jung 001; Till Knollmann; Friedhelm Meyer auf der Heide (CoRR, 2020)

Gathering Anonymous, Oblivious Robots on a Grid. - Jannik Castenow; Matthias Fischer 001; Jonas Harbig; Daniel Jung 001; Friedhelm Meyer auf der Heide (Theor. Comput. Sci., 2020)

Gathering a Euclidean Closed Chain of Robots in Linear Time. - Jannik Castenow; Jonas Harbig; Daniel Jung 001; Till Knollmann; Friedhelm Meyer auf der Heide (ALGOSENSORS, 2021)

A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility. - Jannik Castenow; Jonas Harbig; Daniel Jung 001; Peter Kling; Till Knollmann; Friedhelm Meyer auf der Heide (OPODIS, 2022)

Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation. - Jannik Castenow; Jonas Harbig; Daniel Jung 001; Till Knollmann; Friedhelm Meyer auf der Heide (Theor. Comput. Sci., 2023)