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.

792 Publications


2021 | Conference Paper | LibreCat-ID: 20817
A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location
M. Bienkowski, B. Feldkord, P. Schmidt, in: Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17.
LibreCat | DOI
 

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
 

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
 

2021 | Conference Paper | LibreCat-ID: 26986
The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation
J. Castenow, T. Götte, T. Knollmann, F. Meyer auf der Heide, in: C. Johnen, E.M. Schiller, S. Schmid (Eds.), Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, Springer, 2021, pp. 289–304.
LibreCat | DOI | arXiv
 

2021 | Preprint | LibreCat-ID: 27778
Full Version -- Server Cloud Scheduling
M. Maack, F. Meyer auf der Heide, S. Pukrop, ArXiv:2108.02109 (2021).
LibreCat
 

2021 | Bachelorsthesis | LibreCat-ID: 44234
Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation
T.F. Berger, Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation, 2021.
LibreCat
 

2021 | Bachelorsthesis | LibreCat-ID: 44233
Online k-Facility Reallocation using k-Server Algorithms
S. Pranger, Online K-Facility Reallocation Using k-Server Algorithms, 2021.
LibreCat
 

2020 | Conference Paper | LibreCat-ID: 19899
A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up
J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes , N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings, Springer, 2020, pp. 65–80.
LibreCat | DOI | arXiv
 

2020 | Conference Paper | LibreCat-ID: 20159
Mincut Sensitivity Data Structures for the Insertion of an Edge
S. Baswana, S. Gupta, T. Knollmann, in: F. Grandoni, G. Herman, P. Sanders (Eds.), 28th Annual European Symposium on Algorithms (ESA 2020), Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, pp. 12:1-12:14.
LibreCat | DOI
 

2020 | Conference Paper | LibreCat-ID: 20185
Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility
J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes, N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , Springer, 2020, pp. 60–64.
LibreCat | DOI | arXiv
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Export / Embed