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, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation.” Theoretical Computer Science 939 (2023): 261–91. https://doi.org/10.1016/j.tcs.2022.10.031.
LibreCat
| DOI
| arXiv
2023 | Journal Article | LibreCat-ID: 48871
Bossek, Jakob, and Dirk Sudholt. “Do Additional Target Points Speed Up Evolutionary Algorithms?” Theoretical Computer Science, 2023, 113757. https://doi.org/10.1016/j.tcs.2023.113757.
LibreCat
| DOI
2023 | Journal Article | LibreCat-ID: 46310
Heins, Jonathan, Jakob Bossek, Janina Pohl, Moritz Seiler, Heike Trautmann, and Pascal Kerschke. “A Study on the Effects of Normalized TSP Features for Automated Algorithm Selection.” Theoretical Computer Science 940 (2023): 123–45. https://doi.org/10.1016/j.tcs.2022.10.019.
LibreCat
| DOI
2021 | Journal Article | LibreCat-ID: 22510
Li, Shouwei, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “A Continuous Strategy for Collisionless Gathering.” Theoretical Computer Science 852 (2021): 41–60. https://doi.org/10.1016/j.tcs.2020.10.037.
LibreCat
| DOI
2021 | Journal Article | LibreCat-ID: 22511
Li, Shouwei, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” Theoretical Computer Science 852 (2021): 29–40. https://doi.org/10.1016/j.tcs.2020.11.009.
LibreCat
| DOI
2020 | Journal Article | LibreCat-ID: 16299
Castenow, Jannik, Matthias Fischer, Jonas Harbig, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” Theoretical Computer Science 815 (2020): 289–309. https://doi.org/10.1016/j.tcs.2020.02.018.
LibreCat
| DOI
2019 | Journal Article | LibreCat-ID: 2916
Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.” Theoretical Computer Science 754 (2019): 88–106. https://doi.org/10.1016/j.tcs.2018.04.048.
LibreCat
| DOI
2009 | Journal Article | LibreCat-ID: 2999
Blömer, Johannes, and Stefanie Naewe. “Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima.” Theoretical Computer Science, no. 18 (2009): 1648–65. https://doi.org/10.1016/j.tcs.2008.12.045.
LibreCat
| DOI
2009 | Journal Article | LibreCat-ID: 16429
Kutyłowski, Jarosław, and Friedhelm Meyer auf der Heide. “Optimal Strategies for Maintaining a Chain of Relays between an Explorer and a Base Camp.” Theoretical Computer Science, 2009, 3391–3405. https://doi.org/10.1016/j.tcs.2008.04.010.
LibreCat
| DOI
2005 | Journal Article | LibreCat-ID: 18790
Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Colorability.” Theoretical Computer Science 331, no. 1 (2005): 37–52. https://doi.org/10.1016/j.tcs.2004.09.031.
LibreCat
| DOI
2005 | Journal Article | LibreCat-ID: 15058
Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.” Theoretical Computer Science, 2005, 14–26. https://doi.org/10.1016/j.tcs.2005.09.053.
LibreCat
| DOI
2004 | Journal Article | LibreCat-ID: 16521
Bezrukov, S., R. Elsässer, B. Monien, R. Preis, and J.-P. Tillich. “New Spectral Lower Bounds on the Bisection Width of Graphs.” Theoretical Computer Science, 2004, 155–74. https://doi.org/10.1016/j.tcs.2004.03.059.
LibreCat
| DOI
1998 | Journal Article | LibreCat-ID: 16503
Meyer auf der Heide, Friedhelm, Klaus Schröder, and Frank Schwarze. “Routing on Networks of Optical Crossbars.” Theoretical Computer Science 196 (1998): 181–200. https://doi.org/10.1016/s0304-3975(97)86791-6.
LibreCat
| DOI
1998 | Journal Article | LibreCat-ID: 16504
Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.” Theoretical Computer Science, 1998, 175–203. https://doi.org/10.1016/s0304-3975(98)00020-6.
LibreCat
| DOI
1989 | Journal Article | LibreCat-ID: 19818
Kleine Büning, Hans, Theodor Lettmann, and Ernst W. Mayr. “Projections of Vector Addition System Reachability Sets Are Semilinear.” Theoretical Computer Science, 1989, 343–50. https://doi.org/10.1016/0304-3975(89)90055-8.
LibreCat
| DOI
1988 | Journal Article | LibreCat-ID: 16765
Borodin, Allan, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, and Avi Wigderson. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” Theoretical Computer Science, 1988, 57–68. https://doi.org/10.1016/0304-3975(88)90018-7.
LibreCat
| DOI
1985 | Journal Article | LibreCat-ID: 16781
Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic Algebraic Computation Trees.” Theoretical Computer Science, 1985, 325–30. https://doi.org/10.1016/0304-3975(85)90079-9.
LibreCat
| DOI
1981 | Journal Article | LibreCat-ID: 16820
Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” Theoretical Computer Science, 1981, 315–22. https://doi.org/10.1016/s0304-3975(81)80004-7.
LibreCat
| DOI