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

Bossek J, Sudholt D. Do Additional Target Points Speed Up Evolutionary Algorithms? Theoretical Computer Science. Published online 2023:113757. doi:10.1016/j.tcs.2023.113757
LibreCat: /record/48871
DOI: 10.1016/j.tcs.2023.113757

Heins J, Bossek J, Pohl J, Seiler M, Trautmann H, Kerschke P. A study on the effects of normalized TSP features for automated algorithm selection. Theoretical Computer Science. 2023;940:123-145. 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

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

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

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

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

Blömer J, Naewe S. Sampling methods for shortest vectors, closest vectors and successive minima. Theoretical Computer Science. 2009;(18):1648-1665. doi:10.1016/j.tcs.2008.12.045
LibreCat: /record/2999
DOI: 10.1016/j.tcs.2008.12.045

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

Czumaj A, Sohler C. Testing hypergraph colorability. Theoretical Computer Science. 2005;331(1):37-52. doi:10.1016/j.tcs.2004.09.031
LibreCat: /record/18790
DOI: 10.1016/j.tcs.2004.09.031

Ziegler M. Stability versus speed in a computable algebraic model. Theoretical Computer Science. 2005:14-26. doi:10.1016/j.tcs.2005.09.053
LibreCat: /record/15058
DOI: 10.1016/j.tcs.2005.09.053

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

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

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

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

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

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

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