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 .

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 .

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 .

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.

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.

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.

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

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.

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.

A. Czumaj and C. Sohler, “Testing hypergraph colorability,” Theoretical Computer Science, vol. 331, no. 1, pp. 37–52, 2005.