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 

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

Maack, M. (2023). Online load balancing on uniform machines with limited migration. Operations Research Letters, 51(3), 220–225.https://doi.org/10.1016/j.orl.2023.02.013 

Castenow, J., Harbig, J., &; Meyer auf der Heide, F. (2023). Unifying Gathering Protocols for Swarms of Mobile Robots. In Lecture Notes in Computer Science. Springer International Publishing.https://doi.org/10.1007/978-3-031-30448-4_1 

Castenow, J. (2023). Local Protocols for Contracting and Expanding Robot Formation Problems.https://doi.org/10.17619/UNIPB/1-1750 

Knollmann, T. (2023). Online Algorithms for Allocating Heterogeneous Resources.https://doi.org/10.17619/UNIPB/1-1751 

Pukrop, S. (2023). On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling.https://doi.org/10.17619/UNIPB/1-1768  

Maack, M., Meyer auf der Heide, F., &; Pukrop, S. (2023). Server Cloud Scheduling. Algorithmica.https://doi.org/10.1007/s00453-023-01189-x 

Deppert, M. A., Jansen, K., Maack, M., Pukrop, S., &; Rau, M. (2023). Scheduling with Many Shared Resources. 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS).https://doi.org/10.1109/ipdps54959.2023.00049 

Castenow, J., Kling, P., Knollmann, T., &; Meyer auf der Heide, F. (2022). A Discrete and Continuous Study of the Max-Chain-Formation Problem. Information and Computation, Article 104877.https://doi.org/10.1016/j.ic.2022.104877 

Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., &; Meyer auf der Heide, F. (2022). The k-Server with Preferences Problem. Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 345–356.https://doi.org/10.1145/3490148.3538595 

Polevoy, G., &; Dziubiski, M. (2022). Fair, Individually Rational and Cheap Adjustment. In L. De Raedt (Ed.), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization.https://doi.org/10.24963/ijcai.2022/64 

Epstein, L., Lassota, A., Levin, A., Maack, M., &; Rohwedder, L. (2022). Cardinality Constrained Scheduling in Online Models. 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) (Vol. 219, p. 28:1–28:15). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.STACS.2022.28 

Maack, M., Pukrop, S., &; Rasmussen, A. R. (2022). (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. 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 (Vol. 244, p. 77:1–77:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ESA.2022.77 

Baswana, S., Gupta, S., &; Knollmann, T. (2022). Mincut Sensitivity Data Structures for the Insertion of an Edge. Algorithmica.https://doi.org/10.1007/s00453-022-00978-0 

Maack, M., Meyer auf der Heide, F., &; Pukrop, S. (2022). Server Cloud Scheduling. In Approximation and Online Algorithms. Springer International Publishing.https://doi.org/10.1007/978-3-030-92702-8_10 

Knollmann, T., &; Scheideler, C. (2022). A self-stabilizing Hashed Patricia Trie. Information and Computation, Article 104697.https://doi.org/10.1016/j.ic.2021.104697 

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

Bernijazov, R., Dicks, A., Dumitrescu, R., Foullois, M., Hanselle, J. M., Hüllermeier, E., Karakaya, G., Ködding, P., Lohweg, V., Malatyali, M., Meyer auf der Heide, F., Panzner, M., &; Soltenborn, C. (2021). A Meta-Review on Artiû01cial Intelligence in Product Creation. Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21). 30th International Joint Conference on Artificial Intelligence (IJCAI 2021) - Workshop “AI and Product Design,” Montreal, Kanada.

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