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.
20 Publications
2025 | Journal Article | LibreCat-ID: 62051
K. Hinnenthal, D. J. Liedtke, and C. Scheideler, “Efficient shape formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures,” Theoretical Computer Science, vol. 1057, Art. no. 115552, 2025, doi: 10.1016/j.tcs.2025.115552.
LibreCat
| DOI
2024 | Journal Article | LibreCat-ID: 61172
S. Coy, A. Czumaj, C. Scheideler, P. Schneider, and J. Werthmann, “Routing Schemes for Hybrid Communication Networks,” Theoretical Computer Science, vol. 985, Art. no. 114352, 2024, doi: 10.1016/j.tcs.2023.114352.
LibreCat
| DOI
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
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
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, vol. 410, no. 18, pp. 1648–1665, 2009, doi: 10.1016/j.tcs.2008.12.045.
LibreCat
| DOI