Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation
J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical Computer Science 939 (2023) 261–291.
LibreCat: /record/33947
DOI: 10.1016/j.tcs.2022.10.031
arXiv: 2010.04424 

A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility 
J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: E. Hillel, R. Palmieri, E. Riviére (Eds.), Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) , Schloss Dagstuhl – Leibniz Zentrum für Informatik, Brussels, 2023, p. 15:1–15:25.
LibreCat: /record/34008
DOI: 10.4230/LIPIcs.OPODIS.2022.15
arXiv: 2206.07567 

Online load balancing on uniform machines with limited migration
M. Maack, Operations Research Letters 51 (2023) 220–225.
LibreCat: /record/44077
DOI: 10.1016/j.orl.2023.02.013

Unifying Gathering Protocols for Swarms of Mobile Robots
J. Castenow, J. Harbig, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2023.
LibreCat: /record/44769
DOI: 10.1007/978-3-031-30448-4_1

Local Protocols for Contracting and Expanding Robot Formation Problems
J. Castenow, Local Protocols for Contracting and Expanding Robot Formation Problems, 2023.
LibreCat: /record/45580
DOI: 10.17619/UNIPB/1-1750

Online Algorithms for Allocating Heterogeneous Resources
T. Knollmann, Online Algorithms for Allocating Heterogeneous Resources, 2023.
LibreCat: /record/45579
DOI: 10.17619/UNIPB/1-1751

On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling
S. Pukrop, On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling, 2023.
LibreCat: /record/45781
DOI: 10.17619/UNIPB/1-1768 

Server Cloud Scheduling
M. Maack, F. Meyer auf der Heide, S. Pukrop, Algorithmica (2023).
LibreCat: /record/50458
DOI: 10.1007/s00453-023-01189-x

Scheduling with Many Shared Resources
M.A. Deppert, K. Jansen, M. Maack, S. Pukrop, M. Rau, in: 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2023.
LibreCat: /record/50460
DOI: 10.1109/ipdps54959.2023.00049

A Discrete and Continuous Study of the Max-Chain-Formation Problem
J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, Information and Computation (2022).
LibreCat: /record/29843
DOI: 10.1016/j.ic.2022.104877

The k-Server with Preferences Problem
J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2022, pp. 345–356.
LibreCat: /record/31847
DOI: 10.1145/3490148.3538595
arXiv: 2205.11102

Fair, Individually Rational and Cheap Adjustment
G. Polevoy, M. Dziubiski, in: L. De Raedt (Ed.), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence Organization, 2022.
LibreCat: /record/34040
DOI: 10.24963/ijcai.2022/64

Cardinality Constrained Scheduling in Online Models
L. Epstein, A. Lassota, A. Levin, M. Maack, L. Rohwedder, in: P. Berenbrink, B. Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15.
LibreCat: /record/33085
DOI: 10.4230/LIPIcs.STACS.2022.28

(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling
M. Maack, S. Pukrop, A.R. Rasmussen, in: S. Chechik, G. Navarro, E. Rotenberg, G. Herman (Eds.), 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13.
LibreCat: /record/33491
DOI: 10.4230/LIPIcs.ESA.2022.77

Mincut Sensitivity Data Structures for the Insertion of an Edge
S. Baswana, S. Gupta, T. Knollmann, Algorithmica (2022).
LibreCat: /record/31479
DOI: 10.1007/s00453-022-00978-0

Server Cloud Scheduling
M. Maack, F. Meyer auf der Heide, S. Pukrop, in: Approximation and Online Algorithms, Springer International Publishing, Cham, 2022.
LibreCat: /record/29872
DOI: 10.1007/978-3-030-92702-8_10

A self-stabilizing Hashed Patricia Trie
T. Knollmann, C. Scheideler, Information and Computation (2022).
LibreCat: /record/21096
DOI: 10.1016/j.ic.2021.104697

Gathering a Euclidean Closed Chain of Robots in Linear Time
J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in: L. Gasieniec, R. Klasing, T. Radzik (Eds.), Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Springer, 2021, pp. 29–44.
LibreCat: /record/23730
DOI: 10.1007/978-3-030-89240-1_3
arXiv: 2010.04424

A Meta-Review on Artiû01cial Intelligence in Product Creation
R. Bernijazov, A. Dicks, R. Dumitrescu, M. Foullois, J.M. Hanselle, E. Hüllermeier, G. Karakaya, P. Ködding, V. Lohweg, M. Malatyali, F. Meyer auf der Heide, M. Panzner, C. Soltenborn, in: Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21), 2021.
LibreCat: /record/23779

Managing Multiple Mobile Resources
B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, Theory of Computing Systems 65 (2021) 943–984.
LibreCat: /record/20683
DOI: 10.1007/s00224-020-10023-8