| Gathering anonymous, oblivious robots on a grid J Castenow, M Fischer, J Harbig, D Jung, FM auf der Heide Theoretical Computer Science 815, 289-309, 2020 | 20 | 2020 |
| Competitive routing in hybrid communication networks D Jung, C Kolb, C Scheideler, J Sundermeier Algorithms for Sensor Systems: 14th International Symposium on Algorithms …, 2019 | 12 | 2019 |
| Local gathering of mobile robots in three dimensions M Braun, J Castenow, F Meyer auf der Heide International Colloquium on Structural Information and Communication …, 2020 | 8 | 2020 |
| A bounding box overlay for competitive routing in hybrid communication networks J Castenow, C Kolb, C Scheideler Proceedings of the 21st International Conference on Distributed Computing …, 2020 | 8 | 2020 |
| A discrete and continuous study of the max-chain-formation problem: slow down to speed up J Castenow, P Kling, T Knollmann, F Meyer Auf der Heide Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020 | 7 | 2020 |
| Gathering a euclidean closed chain of robots in linear time J Castenow, J Harbig, D Jung, T Knollmann, F Meyer auf der Heide International Symposium on Algorithms and Experiments for Sensor Systems …, 2021 | 6 | 2021 |
| The k-server with preferences problem J Castenow, B Feldkord, T Knollmann, M Malatyali, F Meyer auf der Heide Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and …, 2022 | 5 | 2022 |
| The online multi-commodity facility location problem J Castenow, B Feldkord, T Knollmann, M Malatyali, F Meyer Auf der Heide Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020 | 5 | 2020 |
| Monitoring of domain-related problems in distributed data streams P Bemmann, F Biermeier, J Bürmann, A Kemper, T Knollmann, S Knorr, ... International Colloquium on Structural Information and Communication …, 2017 | 5 | 2017 |
| A unifying approach to efficient (near)-gathering of disoriented robots with limited visibility J Castenow, J Harbig, D Jung, P Kling, T Knollmann arXiv preprint arXiv:2206.07567, 2022 | 4 | 2022 |
| The Max-Line-Formation Problem: And New Insights for Gathering and Chain-Formation J Castenow, T Götte, T Knollmann, F Meyer auf der Heide International Symposium on Stabilizing, Safety, and Security of Distributed …, 2021 | 4 | 2021 |
| Brief announcement: gathering in linear time: a closed chain of disoriented and luminous robots with limited visibility J Castenow, J Harbig, D Jung, T Knollmann, F Meyer auf der Heide International Symposium on Stabilizing, Safety, and Security of Distributed …, 2020 | 3 | 2020 |
| Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation J Castenow, J Harbig, D Jung, T Knollmann, FM auf der Heide Theoretical Computer Science 939, 261-291, 2023 | 1 | 2023 |
| A discrete and continuous study of the Max-Chain-Formation problem J Castenow, P Kling, T Knollmann, FM auf der Heide Information and Computation 285, 104877, 2022 | 1 | 2022 |
| A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension M Benter, T Knollmann, FM auf der Heide, A Setzer, J Sundermeier International Symposium on Algorithmic Aspects of Cloud Computing, 46-58, 2018 | 1 | 2018 |
| Brief announcement: Competitive routing in hybrid communication networks D Jung, C Kolb, C Scheideler, J Sundermeier Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018 | 1 | 2018 |
| A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks C Kolb, C Scheideler, J Sundermeier CoRR, 2018 | 1 | 2018 |
| Unifying Gathering Protocols for Swarms of Mobile Robots J Castenow, J Harbig, F Meyer auf der Heide International Conference on Algorithms and Complexity, 5-16, 2023 | | 2023 |
| Heinz Nixdorf Institute and Computer Science Department, Paderborn University, Paderborn, Germany {jannik. castenow, jonas. harbig, fmadh}@ upb. de https://www. hni. uni … J Castenow Algorithms and Complexity: 13th International Conference, CIAC 2023, Larnaca …, 2023 | | 2023 |
| Distributed Data Streams J Castenow, B Feldkord, J Hanselle, T Knollmann, M Malatyali, ... Algorithms for Big Data: DFG Priority Program 1736, 179-195, 2023 | | 2023 |
