Publications

Latest Publications

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.


Online Algorithms for Allocating Heterogeneous Resources

T. Knollmann, Online Algorithms for Allocating Heterogeneous Resources, 2023.


Capabilities and Limitations of Local Strategies in Dynamic Networks

T. Götte, T. Knollmann, F. Meyer auf der Heide, C. Scheideler, J. Werthmann, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 1--20.


A Discrete and Continuous Study of the Max-Chain-Formation Problem

J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, Information and Computation (2022).


Show all publications