Jonas Harbig

Research Associate

Member - Research Associate
Research on swarm algorithm
Research Associate
Office Address:
Fürstenallee 11
33102 Paderborn
Room:
F2.413
Office hours:

If I am not reachable by phone, please write a mail instead.

Publications

Latest Publications

Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility

R. Gerlach, S. von der Gracht, C. Hahn, J. Harbig, P. Kling, ArXiv:2409.19277 (n.d.).


Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation

J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical Computer Science 939 (2023) 261–291.


A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility

J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: E. Hillel, R. Palmieri, E. Riviére (Eds.), Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) , Schloss Dagstuhl – Leibniz Zentrum für Informatik, Brussels, 2023, p. 15:1–15:25.


Unifying Gathering Protocols for Swarms of Mobile Robots

J. Castenow, J. Harbig, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2023.


Gathering a Euclidean Closed Chain of Robots in Linear Time

J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in: L. Gasieniec, R. Klasing, T. Radzik (Eds.), Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Springer, 2021, pp. 29–44.


Show all publications