| Mincut sensitivity data structures for the insertion of an edge S Baswana, S Gupta, T Knollmann Algorithmica 84 (9), 2702-2734, 2022 | 7 | 2022 |
| 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 |
| Online facility location with mobile facilities B Feldkord, T Knollmann, FM auf der Heide Theoretical Computer Science 907, 45-61, 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 |
| Managing multiple mobile resources B Feldkord, T Knollmann, M Malatyali, F Meyer auf der Heide International Workshop on Approximation and Online Algorithms, 120-137, 2019 | 5 | 2019 |
| 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 |
| A self-stabilizing Hashed Patricia Trie T Knollmann, C Scheideler Information and Computation 285, 104697, 2022 | 2 | 2022 |
| A Self-stabilizing Hashed Patricia Trie T Knollmann, C Scheideler International Symposium on Stabilizing, Safety, and Security of Distributed …, 2018 | 2 | 2018 |
| 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 |
| 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 |
| Online Algorithms for Allocating Heterogeneous Resources T Knollmann Universitätsbibliothek, 2023 | | 2023 |
| Managing Multiple Mobile Resources B örn Feldkord, T Knollmann, M Malatyali, FM auf der Heide | | 2021 |
| Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility. J Castenow, J Harbig, D Jung, T Knollmann, FM auf der Heide CoRR, 2020 | | 2020 |
