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
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,” Theoretical Computer Science, vol. 939, pp. 261–291, 2023, doi: 10.1016/j.tcs.2022.10.031.
LibreCat | DOI | arXiv
 

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

2023 | Journal Article | LibreCat-ID: 46310
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,” Theoretical Computer Science, vol. 940, pp. 123–145, 2023, doi: https://doi.org/10.1016/j.tcs.2022.10.019.
LibreCat | DOI
 

2021 | Journal Article | LibreCat-ID: 22510
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 | DOI
 

2021 | Journal Article | LibreCat-ID: 22511
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 | DOI
 

2020 | Journal Article | LibreCat-ID: 16299
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 | DOI
 

2019 | Journal Article | LibreCat-ID: 2916
S. Brauer, “Complexity of single-swap heuristics for metric facility location and related problems,” Theoretical Computer Science, vol. 754, pp. 88–106, 2019.
LibreCat | DOI
 

2009 | Journal Article | LibreCat-ID: 2999
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 | DOI
 

2009 | Journal Article | LibreCat-ID: 16429
J. Kutyłowski 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 | DOI
 

2005 | Journal Article | LibreCat-ID: 18790
A. Czumaj and C. Sohler, “Testing hypergraph colorability,” Theoretical Computer Science, vol. 331, no. 1, pp. 37–52, 2005.
LibreCat | DOI
 

2005 | Journal Article | LibreCat-ID: 15058
M. Ziegler, “Stability versus speed in a computable algebraic model,” Theoretical Computer Science, pp. 14–26, 2005.
LibreCat | DOI
 

2004 | Journal Article | LibreCat-ID: 16521
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 | DOI
 

1998 | Journal Article | LibreCat-ID: 16503
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 | DOI
 

1998 | Journal Article | LibreCat-ID: 16504
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 | DOI
 

1989 | Journal Article | LibreCat-ID: 19818
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 | DOI
 

1988 | Journal Article | LibreCat-ID: 16765
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 | DOI
 

1985 | Journal Article | LibreCat-ID: 16781
F. Meyer auf der Heide, “Simulating probabilistic by deterministic algebraic computation trees,” Theoretical Computer Science, pp. 325–330, 1985.
LibreCat | DOI
 

1981 | Journal Article | LibreCat-ID: 16820
F. Meyer auf der Heide, “A comparison of two variations of a pebble game on graphs,” Theoretical Computer Science, pp. 315–322, 1981.
LibreCat | DOI
 

Filters and Search Terms

issn=0304-3975

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed