Castenow, J., Harbig, J., Jung, D., Knollmann, T., &; Meyer auf der Heide, F. (2023). Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. Theoretical Computer Science, 939, 261–291.https://doi.org/10.1016/j.tcs.2022.10.031 
LibreCat: /record/33947
DOI: 10.1016/j.tcs.2022.10.031
arXiv: 2010.04424 

Castenow, J., Harbig, J., Jung, D., Kling, P., Knollmann, T., &; Meyer auf der Heide, F. (2023). A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility . In E. Hillel, R. Palmieri, &; E. Riviére (Eds.), Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS)  (Vol. 253, p. 15:1–15:25). Schloss Dagstuhl – Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.OPODIS.2022.15 
LibreCat: /record/34008
DOI: 10.4230/LIPIcs.OPODIS.2022.15
arXiv: 2206.07567 

Knollmann, T. (2023). Online Algorithms for Allocating Heterogeneous Resources.https://doi.org/10.17619/UNIPB/1-1751 
LibreCat: /record/45579
DOI: 10.17619/UNIPB/1-1751

Götte, T., Knollmann, T., Meyer auf der Heide, F., Scheideler, C., &; Werthmann, J. (2023). Capabilities and Limitations of Local Strategies in Dynamic Networks. 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 (Vol. 412, pp. 1--20). Heinz Nixdorf Institut, Universität Paderborn.https://doi.org/10.5281/zenodo.8060372 
LibreCat: /record/45875
DOI: 10.5281/zenodo.8060372

Castenow, J., Kling, P., Knollmann, T., &; Meyer auf der Heide, F. (2022). A Discrete and Continuous Study of the Max-Chain-Formation Problem. Information and Computation, Article 104877.https://doi.org/10.1016/j.ic.2022.104877 
LibreCat: /record/29843
DOI: 10.1016/j.ic.2022.104877

Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., &; Meyer auf der Heide, F. (2022). The k-Server with Preferences Problem. Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 345–356.https://doi.org/10.1145/3490148.3538595 
LibreCat: /record/31847
DOI: 10.1145/3490148.3538595
arXiv: 2205.11102

Baswana, S., Gupta, S., &; Knollmann, T. (2022). Mincut Sensitivity Data Structures for the Insertion of an Edge. Algorithmica.https://doi.org/10.1007/s00453-022-00978-0 
LibreCat: /record/31479
DOI: 10.1007/s00453-022-00978-0

Knollmann, T., &; Scheideler, C. (2022). A self-stabilizing Hashed Patricia Trie. Information and Computation, Article 104697.https://doi.org/10.1016/j.ic.2021.104697 
LibreCat: /record/21096
DOI: 10.1016/j.ic.2021.104697

Castenow, J., Harbig, J., Jung, D., Knollmann, T., &; Meyer auf der Heide, F. (2021). Gathering a Euclidean Closed Chain of Robots in Linear Time. In L. Gasieniec, R. Klasing, &; T. Radzik (Eds.), Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS) (Vol. 12961, pp. 29–44). Springer.https://doi.org/10.1007/978-3-030-89240-1_3 
LibreCat: /record/23730
DOI: 10.1007/978-3-030-89240-1_3
arXiv: 2010.04424

Feldkord, B., Knollmann, T., Malatyali, M., &; Meyer auf der Heide, F. (2021). Managing Multiple Mobile Resources. Theory of Computing Systems, 65, 943–984.https://doi.org/10.1007/s00224-020-10023-8 
LibreCat: /record/20683
DOI: 10.1007/s00224-020-10023-8

Castenow, J., Götte, T., Knollmann, T., &; Meyer auf der Heide, F. (2021). The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation. In C. Johnen, E. M. Schiller, &; S. Schmid (Eds.), Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021 (Vol. 13046, pp. 289–304). Springer.https://doi.org/10.1007/978-3-030-91081-5_19 
LibreCat: /record/26986
DOI: 10.1007/978-3-030-91081-5_19
arXiv: 2109.11856

Castenow, J., Kling, P., Knollmann, T., &; Meyer auf der Heide, F. (2020). A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up. In S. Devismeshttps://doi.org/10.1007/978-3-030-64348-5_6__&; N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings (Vol. 12514, pp. 65–80). Springer.https://doi.org/10.1007/978-3-030-64348-5_6 
LibreCat: /record/19899
DOI: 10.1007/978-3-030-64348-5_6
arXiv: 2010.02043 

Baswana, S., Gupta, S., &; Knollmann, T. (2020). Mincut Sensitivity Data Structures for the Insertion of an Edge. In F. Grandoni, G. Herman, &; P. Sanders (Eds.), 28th Annual European Symposium on Algorithms (ESA 2020) (Vol. 173, pp. 12:1-12:14). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ESA.2020.12 
LibreCat: /record/20159
DOI: 10.4230/LIPIcs.ESA.2020.12

Castenow, J., Harbig, J., Jung, D., Knollmann, T., &; Meyer auf der Heide, F. (2020). Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &; Luminous Robots with Limited Visibility . In S. Devismes &; N.https://doi.org/10.1007/978-3-030-64348-5_5__Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings  (Vol. 12514, pp. 60–64). Springer.https://doi.org/10.1007/978-3-030-64348-5_5 
LibreCat: /record/20185
DOI: 10.1007/978-3-030-64348-5_5
arXiv: 2010.04424 

Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., &; Meyer auf der Heide, F. (2020). The Online Multi-Commodity Facility Location Problem. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures.https://doi.org/10.1145/3350755.3400281 
LibreCat: /record/17370
DOI: 10.1145/3350755.3400281
arXiv: 2005.08391

Castenow, J., Kling, P., Knollmann, T., &; Meyer auf der Heide, F. (2020). 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.https://doi.org/10.1145/3350755.3400263 
LibreCat: /record/17371
DOI: 10.1145/3350755.3400263
arXiv: 2010.02043 

Feldkord, B., Knollmann, T., Malatyali, M., &; Meyer auf der Heide, F. (2019). Managing Multiple Mobile Resources. In Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA) (pp. 120–137). Springer.https://doi.org/10.1007/978-3-030-39479-0_9 
LibreCat: /record/12870
DOI: 10.1007/978-3-030-39479-0_9
arXiv: 1907.09834

Knollmann, T., &; Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi &; P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201). Tokyo: Springer, Cham.https://doi.org/10.1007/978-3-030-03232-6_1 
LibreCat: /record/4411
DOI: 10.1007/978-3-030-03232-6_1
arXiv: 1809.04923

Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., &; Sundermeier, J. (2018). 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.https://doi.org/10.1007/978-3-030-19759-9_4 
LibreCat: /record/4375
DOI: 10.1007/978-3-030-19759-9_4

Bemmann, P., Biermeier, F., Bürmann, J., Kemper, A., Knollmann, T., Knorr, S., Kothe, N., Mäcker, A., Malatyali, M., Meyer auf der Heide, F., Riechers, S., Schaefer, J. S., &; Sundermeier, J. (2017). Monitoring of Domain-Related Problems in Distributed Data Streams. In Structural Information and Communication Complexity.https://doi.org/10.1007/978-3-319-72050-0_13 
LibreCat: /record/16461
DOI: 10.1007/978-3-319-72050-0_13
arXiv: arXiv:1706.03568