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

J. Bossek and D. Sudholt, “Do Additional Target Points Speed Up Evolutionary Algorithms?,”10.1016/j.tcs.2023.113757__Theoretical Computer Science, p. 113757, 2023, doi:10.1016/j.tcs.2023.113757 .
LibreCat: /record/48871
DOI: 10.1016/j.tcs.2023.113757

J. Heins, J. Bossek, J. Pohl, M. Seiler, H. Trautmann, and P. Kerschke, “A study on the effects of normalized TSP features for automated algorithm selection,”https://doi.org/10.1016/j.tcs.2022.10.019__Theoretical Computer Science, vol. 940, pp. 123–145, 2023, doi:https://doi.org/10.1016/j.tcs.2022.10.019 .
LibreCat: /record/46310
DOI: https://doi.org/10.1016/j.tcs.2022.10.019

S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “A continuous strategy for collisionless gathering,” Theoretical Computer Science, vol. 852, pp. 41–60, 2021.
LibreCat: /record/22510
DOI: 10.1016/j.tcs.2020.10.037

S. Li, F. Meyer auf der Heide, and P. Podlipyan, “The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots,” Theoretical Computer Science, vol. 852, pp. 29–40, 2021.
LibreCat: /record/22511
DOI: 10.1016/j.tcs.2020.11.009

J. Castenow, M. Fischer, J. Harbig, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” Theoretical Computer Science, vol. 815, pp. 289–309, 2020.
LibreCat: /record/16299
DOI: 10.1016/j.tcs.2020.02.018

S. Brauer, “Complexity of single-swap heuristics for metric facility location and related problems,” Theoretical Computer Science, vol. 754, pp. 88–106, 2019.
LibreCat: /record/2916
DOI: 10.1016/j.tcs.2018.04.048

J. Blömer and S. Naewe, “Sampling methods for shortest vectors, closest vectors and successive minima,” Theoretical Computer Science, no. 18, pp. 1648–1665, 2009.
LibreCat: /record/2999
DOI: 10.1016/j.tcs.2008.12.045

J. Kutyowski and F. Meyer auf der Heide, “Optimal strategies for maintaining a chain of relays between an explorer and a base camp,” Theoretical Computer Science, pp. 3391–3405, 2009.
LibreCat: /record/16429
DOI: 10.1016/j.tcs.2008.04.010

A. Czumaj and C. Sohler, “Testing hypergraph colorability,” Theoretical Computer Science, vol. 331, no. 1, pp. 37–52, 2005.
LibreCat: /record/18790
DOI: 10.1016/j.tcs.2004.09.031

M. Ziegler, “Stability versus speed in a computable algebraic model,” Theoretical Computer Science, pp. 14–26, 2005.
LibreCat: /record/15058
DOI: 10.1016/j.tcs.2005.09.053

S. Bezrukov, R. Elsässer, B. Monien, R. Preis, and J.-P. Tillich, “New spectral lower bounds on the bisection width of graphs,” Theoretical Computer Science, pp. 155–174, 2004.
LibreCat: /record/16521
DOI: 10.1016/j.tcs.2004.03.059

F. Meyer auf der Heide, K. Schröder, and F. Schwarze, “Routing on networks of optical crossbars,” Theoretical Computer Science, vol. 196, pp. 181–200, 1998.
LibreCat: /record/16503
DOI: 10.1016/s0304-3975(97)86791-6

A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model,” Theoretical Computer Science, pp. 175–203, 1998.
LibreCat: /record/16504
DOI: 10.1016/s0304-3975(98)00020-6

H. Kleine Büning, T. Lettmann, and E. W. Mayr, “Projections of vector addition system reachability sets are semilinear,” Theoretical Computer Science, pp. 343–350, 1989.
LibreCat: /record/19818
DOI: 10.1016/0304-3975(89)90055-8

A. Borodin, F. E. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A tradeoff between search and update time for the implicit dictionary problem,” Theoretical Computer Science, pp. 57–68, 1988.
LibreCat: /record/16765
DOI: 10.1016/0304-3975(88)90018-7

F. Meyer auf der Heide, “Simulating probabilistic by deterministic algebraic computation trees,” Theoretical Computer Science, pp. 325–330, 1985.
LibreCat: /record/16781
DOI: 10.1016/0304-3975(85)90079-9

F. Meyer auf der Heide, “A comparison of two variations of a pebble game on graphs,” Theoretical Computer Science, pp. 315–322, 1981.
LibreCat: /record/16820
DOI: 10.1016/s0304-3975(81)80004-7