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)

Unifying Gathering Protocols for Swarms of Mobile Robots. - Jannik Castenow; Jonas Harbig; Friedhelm Meyer auf der Heide (CIAC, 2023)

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)

Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility. - Raphael Gerlach; Sören von der Gracht; Christopher Hahn; Jonas Harbig; Peter Kling (OPODIS, 2024)

Forming Large Patterns with Local Robots in the OBLOT Model. - Christopher Hahn; Jonas Harbig; Peter Kling (SAND, 2024)