Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
21 Publications
2023 | Journal Article | LibreCat-ID: 33947
J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation,” Theoretical Computer Science, vol. 939, pp. 261–291, 2023, doi: 10.1016/j.tcs.2022.10.031.
LibreCat
| DOI
| arXiv
2023 | Conference Paper | LibreCat-ID: 34008
J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility ,” in Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) , Brussels, 2023, vol. 253, p. 15:1–15:25, doi: 10.4230/LIPIcs.OPODIS.2022.15.
LibreCat
| DOI
| arXiv
2023 | Book Chapter | LibreCat-ID: 45875 | 
T. Götte, T. Knollmann, F. Meyer auf der Heide, C. Scheideler, and J. Werthmann, “Capabilities and Limitations of Local Strategies in Dynamic Networks,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 1--20.
LibreCat
| Files available
| DOI
2022 | Journal Article | LibreCat-ID: 29843
J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Discrete and Continuous Study of the Max-Chain-Formation Problem,” Information and Computation, Art. no. 104877, 2022, doi: 10.1016/j.ic.2022.104877.
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 31847
J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “The k-Server with Preferences Problem,” in Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 2022, pp. 345–356, doi: 10.1145/3490148.3538595.
LibreCat
| DOI
| arXiv
2022 | Journal Article | LibreCat-ID: 31479
S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures for the Insertion of an Edge,” Algorithmica, 2022, doi: 10.1007/s00453-022-00978-0.
LibreCat
| DOI
2022 | Journal Article | LibreCat-ID: 21096
T. Knollmann and C. Scheideler, “A self-stabilizing Hashed Patricia Trie,” Information and Computation, Art. no. 104697, 2022, doi: 10.1016/j.ic.2021.104697.
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 23730
J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Gathering a Euclidean Closed Chain of Robots in Linear Time,” in Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Lissabon, 2021, vol. 12961, pp. 29–44, doi: 10.1007/978-3-030-89240-1_3.
LibreCat
| DOI
| arXiv
2021 | Journal Article | LibreCat-ID: 20683
B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” Theory of Computing Systems, vol. 65, pp. 943–984, 2021, doi: 10.1007/s00224-020-10023-8.
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 26986
J. Castenow, T. Götte, T. Knollmann, and F. Meyer auf der Heide, “The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation,” in Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, Online, 2021, vol. 13046, pp. 289–304, doi: 10.1007/978-3-030-91081-5_19.
LibreCat
| DOI
| arXiv
2020 | Conference Paper | LibreCat-ID: 19899
J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up,” in Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings, 2020, vol. 12514, pp. 65–80.
LibreCat
| DOI
| arXiv
2020 | Conference Paper | LibreCat-ID: 20185
J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility ,” in Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , 2020, vol. 12514, pp. 60–64.
LibreCat
| DOI
| arXiv
2020 | Conference Paper | LibreCat-ID: 17370
J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “The Online Multi-Commodity Facility Location Problem,” in Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.
LibreCat
| Files available
| DOI
| arXiv
2020 | Conference Paper | LibreCat-ID: 17371
J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up,” in Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.
LibreCat
| Files available
| DOI
| arXiv
2018 | Conference Paper | LibreCat-ID: 4411
T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Tokyo, 2018, vol. 11201.
LibreCat
| Files available
| DOI
| arXiv
2018 | Conference Paper | LibreCat-ID: 4375
M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, and J. Sundermeier, “A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension,” in Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), Helsinki, 2018.
LibreCat
| Files available
| DOI