Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “The K-Server with Preferences Problem.”https://doi.org/10.1145/3490148.3538595__In Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 345–56. Association for Computing Machinery, 2022.https://doi.org/10.1145/3490148.3538595 .

Polevoy, Gleb, and Marcin Dziubiski. “Fair, Individually Rational and Cheap Adjustment.”https://doi.org/10.24963/ijcai.2022/64__In Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, edited by Luc De Raedt. International Joint Conferences on Artificial Intelligence Organization, 2022.https://doi.org/10.24963/ijcai.2022/64 .

Epstein, Leah, Alexandra Lassota, Asaf Levin, Marten Maack, and Lars Rohwedder. “Cardinality Constrained Scheduling in Online Models.”https://doi.org/10.4230/LIPIcs.STACS.2022.28__In 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference), edited by Petra Berenbrink and Benjamin Monmege, 219:28:1–28:15. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.STACS.2022.28 .

Maack, Marten, Simon Pukrop, and Anna Rodriguez Rasmussen. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.”https://doi.org/10.4230/LIPIcs.ESA.2022.77__In 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, edited by Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz Herman, 244:77:1–77:13. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.ESA.2022.77 .

Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity Data Structures for the Insertion of an Edge.”https://doi.org/10.1007/s00453-022-00978-0__Algorithmica, 2022.https://doi.org/10.1007/s00453-022-00978-0 .

Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Server Cloud Scheduling.”https://doi.org/10.1007/978-3-030-92702-8_10__In Approximation and Online Algorithms. Cham: Springer International Publishing, 2022.https://doi.org/10.1007/978-3-030-92702-8_10 .

Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.”https://doi.org/10.1016/j.ic.2021.104697__Information and Computation, 2022.https://doi.org/10.1016/j.ic.2021.104697 .

Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time.”https://doi.org/10.1007/978-3-030-89240-1_3__In Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), edited by Leszek Gasieniec, Ralf Klasing, and Tomasz Radzik, 12961:29–44. LNCS. Springer, 2021.https://doi.org/10.1007/978-3-030-89240-1_3 .

Bernijazov, Ruslan, Alexander Dicks, Roman Dumitrescu, Marc Foullois, Jonas Manuel Hanselle, Eyke Hüllermeier, Gökce Karakaya, et al. “A Meta-Review on Artiû01cial Intelligence in Product Creation.” In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21), 2021.

Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Managing Multiple Mobile Resources.”https://doi.org/10.1007/s00224-020-10023-8__Theory of Computing Systems 65 (2021): 943–984.https://doi.org/10.1007/s00224-020-10023-8 .