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
Castenow, J., Harbig, J., Jung, D., Knollmann, T., & Meyer auf der Heide, F. (2023). Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. Theoretical Computer Science, 939, 261–291. https://doi.org/10.1016/j.tcs.2022.10.031
LibreCat
| DOI
| arXiv
2023 | Journal Article | LibreCat-ID: 48871
Bossek, J., & Sudholt, D. (2023). Do Additional Target Points Speed Up Evolutionary Algorithms? Theoretical Computer Science, 113757. https://doi.org/10.1016/j.tcs.2023.113757
LibreCat
| DOI
2023 | Journal Article | LibreCat-ID: 46310
Heins, J., Bossek, J., Pohl, J., Seiler, M., Trautmann, H., & Kerschke, P. (2023). A study on the effects of normalized TSP features for automated algorithm selection. Theoretical Computer Science, 940, 123–145. https://doi.org/10.1016/j.tcs.2022.10.019
LibreCat
| DOI
2021 | Journal Article | LibreCat-ID: 22510
Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2021). A continuous strategy for collisionless gathering. Theoretical Computer Science, 852, 41–60. https://doi.org/10.1016/j.tcs.2020.10.037
LibreCat
| DOI
2021 | Journal Article | LibreCat-ID: 22511
Li, S., Meyer auf der Heide, F., & Podlipyan, P. (2021). The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. Theoretical Computer Science, 852, 29–40. https://doi.org/10.1016/j.tcs.2020.11.009
LibreCat
| DOI
2020 | Journal Article | LibreCat-ID: 16299
Castenow, J., Fischer, M., Harbig, J., Jung, D., & Meyer auf der Heide, F. (2020). Gathering Anonymous, Oblivious Robots on a Grid. Theoretical Computer Science, 815, 289–309. https://doi.org/10.1016/j.tcs.2020.02.018
LibreCat
| DOI
2019 | Journal Article | LibreCat-ID: 2916
Brauer, S. (2019). Complexity of single-swap heuristics for metric facility location and related problems. Theoretical Computer Science, 754, 88–106. https://doi.org/10.1016/j.tcs.2018.04.048
LibreCat
| DOI
2009 | Journal Article | LibreCat-ID: 2999
Blömer, J., & Naewe, S. (2009). Sampling methods for shortest vectors, closest vectors and successive minima. Theoretical Computer Science, (18), 1648–1665. https://doi.org/10.1016/j.tcs.2008.12.045
LibreCat
| DOI
2009 | Journal Article | LibreCat-ID: 16429
Kutyłowski, J., & Meyer auf der Heide, F. (2009). Optimal strategies for maintaining a chain of relays between an explorer and a base camp. Theoretical Computer Science, 3391–3405. https://doi.org/10.1016/j.tcs.2008.04.010
LibreCat
| DOI
2005 | Journal Article | LibreCat-ID: 18790
Czumaj, A., & Sohler, C. (2005). Testing hypergraph colorability. Theoretical Computer Science, 331(1), 37–52. https://doi.org/10.1016/j.tcs.2004.09.031
LibreCat
| DOI
2005 | Journal Article | LibreCat-ID: 15058
Ziegler, M. (2005). Stability versus speed in a computable algebraic model. Theoretical Computer Science, 14–26. https://doi.org/10.1016/j.tcs.2005.09.053
LibreCat
| DOI
2004 | Journal Article | LibreCat-ID: 16521
Bezrukov, S., Elsässer, R., Monien, B., Preis, R., & Tillich, J.-P. (2004). New spectral lower bounds on the bisection width of graphs. Theoretical Computer Science, 155–174. https://doi.org/10.1016/j.tcs.2004.03.059
LibreCat
| DOI
1998 | Journal Article | LibreCat-ID: 16503
Meyer auf der Heide, F., Schröder, K., & Schwarze, F. (1998). Routing on networks of optical crossbars. Theoretical Computer Science, 196, 181–200. https://doi.org/10.1016/s0304-3975(97)86791-6
LibreCat
| DOI
1998 | Journal Article | LibreCat-ID: 16504
Bäumker, A., Dittrich, W., & Meyer auf der Heide, F. (1998). Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. Theoretical Computer Science, 175–203. https://doi.org/10.1016/s0304-3975(98)00020-6
LibreCat
| DOI
1989 | Journal Article | LibreCat-ID: 19818
Kleine Büning, H., Lettmann, T., & Mayr, E. W. (1989). Projections of vector addition system reachability sets are semilinear. Theoretical Computer Science, 343–350. https://doi.org/10.1016/0304-3975(89)90055-8
LibreCat
| DOI
1988 | Journal Article | LibreCat-ID: 16765
Borodin, A., Fich, F. E., Meyer auf der Heide, F., Upfal, E., & Wigderson, A. (1988). A tradeoff between search and update time for the implicit dictionary problem. Theoretical Computer Science, 57–68. https://doi.org/10.1016/0304-3975(88)90018-7
LibreCat
| DOI
1985 | Journal Article | LibreCat-ID: 16781
Meyer auf der Heide, F. (1985). Simulating probabilistic by deterministic algebraic computation trees. Theoretical Computer Science, 325–330. https://doi.org/10.1016/0304-3975(85)90079-9
LibreCat
| DOI
1981 | Journal Article | LibreCat-ID: 16820
Meyer auf der Heide, F. (1981). A comparison of two variations of a pebble game on graphs. Theoretical Computer Science, 315–322. https://doi.org/10.1016/s0304-3975(81)80004-7
LibreCat
| DOI