Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
18 Publications
2023 | Journal Article | LibreCat-ID: 33947
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.
LibreCat
| DOI
| arXiv
J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical Computer Science 939 (2023) 261–291.
2023 | Journal Article | LibreCat-ID: 48871
Do Additional Target Points Speed Up Evolutionary Algorithms?
J. Bossek, D. Sudholt, Theoretical Computer Science (2023) 113757.
LibreCat
| DOI
J. Bossek, D. Sudholt, Theoretical Computer Science (2023) 113757.
2023 | Journal Article | LibreCat-ID: 46310
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.
LibreCat
| DOI
J. Heins, J. Bossek, J. Pohl, M. Seiler, H. Trautmann, P. Kerschke, Theoretical Computer Science 940 (2023) 123–145.
2021 | Journal Article | LibreCat-ID: 22510
A continuous strategy for collisionless gathering
S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 852 (2021) 41–60.
LibreCat
| DOI
S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 852 (2021) 41–60.
2021 | Journal Article | LibreCat-ID: 22511
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.
LibreCat
| DOI
S. Li, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 852 (2021) 29–40.
2020 | Journal Article | LibreCat-ID: 16299
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.
LibreCat
| DOI
J. Castenow, M. Fischer, J. Harbig, D. Jung, F. Meyer auf der Heide, Theoretical Computer Science 815 (2020) 289–309.
2019 | Journal Article | LibreCat-ID: 2916
Complexity of single-swap heuristics for metric facility location and related problems
S. Brauer, Theoretical Computer Science 754 (2019) 88–106.
LibreCat
| DOI
S. Brauer, Theoretical Computer Science 754 (2019) 88–106.
2009 | Journal Article | LibreCat-ID: 2999
Sampling methods for shortest vectors, closest vectors and successive minima
J. Blömer, S. Naewe, Theoretical Computer Science (2009) 1648–1665.
LibreCat
| DOI
J. Blömer, S. Naewe, Theoretical Computer Science (2009) 1648–1665.
2009 | Journal Article | LibreCat-ID: 16429
Optimal strategies for maintaining a chain of relays between an explorer and a base camp
J. Kutyłowski, F. Meyer auf der Heide, Theoretical Computer Science (2009) 3391–3405.
LibreCat
| DOI
J. Kutyłowski, F. Meyer auf der Heide, Theoretical Computer Science (2009) 3391–3405.
2005 | Journal Article | LibreCat-ID: 18790
Testing hypergraph colorability
A. Czumaj, C. Sohler, Theoretical Computer Science 331 (2005) 37–52.
LibreCat
| DOI
A. Czumaj, C. Sohler, Theoretical Computer Science 331 (2005) 37–52.
2005 | Journal Article | LibreCat-ID: 15058
Stability versus speed in a computable algebraic model
M. Ziegler, Theoretical Computer Science (2005) 14–26.
LibreCat
| DOI
M. Ziegler, Theoretical Computer Science (2005) 14–26.
2004 | Journal Article | LibreCat-ID: 16521
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.
LibreCat
| DOI
S. Bezrukov, R. Elsässer, B. Monien, R. Preis, J.-P. Tillich, Theoretical Computer Science (2004) 155–174.
1998 | Journal Article | LibreCat-ID: 16503
Routing on networks of optical crossbars
F. Meyer auf der Heide, K. Schröder, F. Schwarze, Theoretical Computer Science 196 (1998) 181–200.
LibreCat
| DOI
F. Meyer auf der Heide, K. Schröder, F. Schwarze, Theoretical Computer Science 196 (1998) 181–200.
1998 | Journal Article | LibreCat-ID: 16504
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.
LibreCat
| DOI
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, Theoretical Computer Science (1998) 175–203.
1989 | Journal Article | LibreCat-ID: 19818
Projections of vector addition system reachability sets are semilinear
H. Kleine Büning, T. Lettmann, E.W. Mayr, Theoretical Computer Science (1989) 343–350.
LibreCat
| DOI
H. Kleine Büning, T. Lettmann, E.W. Mayr, Theoretical Computer Science (1989) 343–350.
1988 | Journal Article | LibreCat-ID: 16765
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.
LibreCat
| DOI
A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, Theoretical Computer Science (1988) 57–68.
1985 | Journal Article | LibreCat-ID: 16781
Simulating probabilistic by deterministic algebraic computation trees
F. Meyer auf der Heide, Theoretical Computer Science (1985) 325–330.
LibreCat
| DOI
F. Meyer auf der Heide, Theoretical Computer Science (1985) 325–330.
1981 | Journal Article | LibreCat-ID: 16820
A comparison of two variations of a pebble game on graphs
F. Meyer auf der Heide, Theoretical Computer Science (1981) 315–322.
LibreCat
| DOI
F. Meyer auf der Heide, Theoretical Computer Science (1981) 315–322.