Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation
J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical Computer Science 939 (2023) 261–291.

Do Additional Target Points Speed Up Evolutionary Algorithms?
J. Bossek, D. Sudholt, Theoretical Computer Science (2023) 113757.

A study on the effects of normalized TSP features for automated algorithm selection
J. Heins, J. Bossek, J. Pohl, M. Seiler, H. Trautmann, P. Kerschke, Theoretical Computer Science 940 (2023) 123–145.

A continuous strategy for collisionless gathering
S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 852 (2021) 41–60.

The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots
S. Li, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 852 (2021) 29–40.

Gathering Anonymous, Oblivious Robots on a Grid
J. Castenow, M. Fischer, J. Harbig, D. Jung, F. Meyer auf der Heide, Theoretical Computer Science 815 (2020) 289–309.

Complexity of single-swap heuristics for metric facility location and related problems
S. Brauer, Theoretical Computer Science 754 (2019) 88–106.

Sampling methods for shortest vectors, closest vectors and successive minima
J. Blömer, S. Naewe, Theoretical Computer Science (2009) 1648–1665.

Optimal strategies for maintaining a chain of relays between an explorer and a base camp
J. Kutyowski, F. Meyer auf der Heide, Theoretical Computer Science (2009) 3391–3405.

Testing hypergraph colorability
A. Czumaj, C. Sohler, Theoretical Computer Science 331 (2005) 37–52.

Stability versus speed in a computable algebraic model
M. Ziegler, Theoretical Computer Science (2005) 14–26.

New spectral lower bounds on the bisection width of graphs
S. Bezrukov, R. Elsässer, B. Monien, R. Preis, J.-P. Tillich, Theoretical Computer Science (2004) 155–174.

Routing on networks of optical crossbars
F. Meyer auf der Heide, K. Schröder, F. Schwarze, Theoretical Computer Science 196 (1998) 181–200.

Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, Theoretical Computer Science (1998) 175–203.

Projections of vector addition system reachability sets are semilinear
H. Kleine Büning, T. Lettmann, E.W. Mayr, Theoretical Computer Science (1989) 343–350.

A tradeoff between search and update time for the implicit dictionary problem
A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, Theoretical Computer Science (1988) 57–68.

Simulating probabilistic by deterministic algebraic computation trees
F. Meyer auf der Heide, Theoretical Computer Science (1985) 325–330.

A comparison of two variations of a pebble game on graphs
F. Meyer auf der Heide, Theoretical Computer Science (1981) 315–322.