Monitoring of Domain-Related Problems in Distributed Data Streams. - Pascal Bemmann; Felix Biermeier; Jan Bürmann; Arne Kemper; Till Knollmann; Steffen Knorr; Nils Kothe; Alexander Mäcker; Manuel Malatyali; Friedhelm Meyer auf der Heide; Sören Riechers; Johannes Schaefer; et al. (SIROCCO, 2017)

A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension. - Markus Benter; Till Knollmann; Friedhelm Meyer auf der Heide; Alexander Setzer; Jannik Sundermeier (ALGOCLOUD, 2018)

The Online Multi-Commodity Facility Location Problem. - Jannik Castenow; Björn Feldkord; Till Knollmann; Manuel Malatyali; Friedhelm Meyer auf der Heide (SPAA, 2020)

A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up. - Jannik Castenow; Peter Kling; Till Knollmann; Friedhelm Meyer auf der Heide (SPAA, 2020)

Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented and Luminous Robots with Limited Visibility. - Jannik Castenow; Jonas Harbig; Daniel Jung 001; Till Knollmann; Friedhelm Meyer auf der Heide (SSS, 2020)

Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility. - Jannik Castenow; Jonas Harbig; Daniel Jung 001; Till Knollmann; Friedhelm Meyer auf der Heide (CoRR, 2020)

Gathering a Euclidean Closed Chain of Robots in Linear Time. - Jannik Castenow; Jonas Harbig; Daniel Jung 001; Till Knollmann; Friedhelm Meyer auf der Heide (ALGOSENSORS, 2021)

The Max-Line-Formation Problem - And New Insights for Gathering and Chain-Formation. - Jannik Castenow; Thorsten Götte; Till Knollmann; Friedhelm Meyer auf der Heide (SSS, 2021)

The Max-Line-Formation Problem. - Jannik Castenow; Thorsten Götte; Till Knollmann; Friedhelm Meyer auf der Heide (CoRR, 2021)

Managing Multiple Mobile Resources. - Björn Feldkord; Till Knollmann; Manuel Malatyali; Friedhelm Meyer auf der Heide (Theory Comput. Syst., 2021)

Distributed Data Streams. - Jannik Castenow; Björn Feldkord; Jonas Hanselle; Till Knollmann; Manuel Malatyali; Friedhelm Meyer auf der Heide (Algorithms for Big Data, 2022)

A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility. - Jannik Castenow; Jonas Harbig; Daniel Jung 001; Peter Kling; Till Knollmann; Friedhelm Meyer auf der Heide (OPODIS, 2022)

The k-Server with Preferences Problem. - Jannik Castenow; Björn Feldkord; Till Knollmann; Manuel Malatyali; Friedhelm Meyer auf der Heide (SPAA, 2022)

Mincut Sensitivity Data Structures for the Insertion of an Edge. - Surender Baswana; Shiv Kumar Gupta 001; Till Knollmann (Algorithmica, 2022)

A discrete and continuous study of the Max-Chain-Formation problem. - Jannik Castenow; Peter Kling; Till Knollmann; Friedhelm Meyer auf der Heide (Inf. Comput., 2022)

A self-stabilizing Hashed Patricia Trie. - Till Knollmann; Christian Scheideler (Inf. Comput., 2022)

Online facility location with mobile facilities. - Björn Feldkord; Till Knollmann; Friedhelm Meyer auf der Heide (Theor. Comput. Sci., 2022)

Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation. - Jannik Castenow; Jonas Harbig; Daniel Jung 001; Till Knollmann; Friedhelm Meyer auf der Heide (Theor. Comput. Sci., 2023)

Online algorithms for allocating heterogeneous resources. - Till Knollmann (2023)