Castenow, Jannik, et al. “The K-Server with Preferences Problem.”10.1145/3490148.3538595__Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2022, pp. 345–56, doi:10.1145/3490148.3538595.
LibreCat: /record/31847
DOI: 10.1145/3490148.3538595
arXiv: 2205.11102

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

Epstein, Leah, et al. “Cardinality Constrained Scheduling in Online Models.”10.4230/LIPIcs.STACS.2022.28__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, vol. 219, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15, doi:10.4230/LIPIcs.STACS.2022.28.
LibreCat: /record/33085
DOI: 10.4230/LIPIcs.STACS.2022.28

Maack, Marten, et al. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.”10.4230/LIPIcs.ESA.2022.77__30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, edited by Shiri Chechik et al., vol. 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13, doi:10.4230/LIPIcs.ESA.2022.77.
LibreCat: /record/33491
DOI: 10.4230/LIPIcs.ESA.2022.77

Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion of an Edge.”10.1007/s00453-022-00978-0__Algorithmica, Springer Science and Business Media LLC, 2022, doi:10.1007/s00453-022-00978-0.
LibreCat: /record/31479
DOI: 10.1007/s00453-022-00978-0

Maack, Marten, et al. “Server Cloud Scheduling.”10.1007/978-3-030-92702-8_10__Approximation and Online Algorithms, Springer International Publishing, 2022, doi:10.1007/978-3-030-92702-8_10.
LibreCat: /record/29872
DOI: 10.1007/978-3-030-92702-8_10

Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.”10.1016/j.ic.2021.104697__Information and Computation, 104697, 2022, doi:10.1016/j.ic.2021.104697.
LibreCat: /record/21096
DOI: 10.1016/j.ic.2021.104697

Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear Time.”10.1007/978-3-030-89240-1_3__Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), edited by Leszek Gasieniec et al., vol. 12961, Springer, 2021, pp. 29–44, doi:10.1007/978-3-030-89240-1_3.
LibreCat: /record/23730
DOI: 10.1007/978-3-030-89240-1_3
arXiv: 2010.04424

Bernijazov, Ruslan, et al. “A Meta-Review on Artiû01cial Intelligence in Product Creation.” Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21), 2021.
LibreCat: /record/23779

Feldkord, Björn, et al. “Managing Multiple Mobile Resources.”10.1007/s00224-020-10023-8__Theory of Computing Systems, vol. 65, 2021, pp. 943–984, doi:10.1007/s00224-020-10023-8.
LibreCat: /record/20683
DOI: 10.1007/s00224-020-10023-8

Bienkowski, Marcin, et al. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.”10.4230/LIPIcs.STACS.2021.14__Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17, doi:10.4230/LIPIcs.STACS.2021.14.
LibreCat: /record/20817
DOI: 10.4230/LIPIcs.STACS.2021.14

Li, Shouwei, et al. “A Continuous Strategy for Collisionless Gathering.”10.1016/j.tcs.2020.10.037__Theoretical Computer Science, vol. 852, 2021, pp. 41–60, doi:10.1016/j.tcs.2020.10.037.
LibreCat: /record/22510
DOI: 10.1016/j.tcs.2020.10.037

Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.”10.1016/j.tcs.2020.11.009__Theoretical Computer Science, vol. 852, 2021, pp. 29–40, doi:10.1016/j.tcs.2020.11.009.
LibreCat: /record/22511
DOI: 10.1016/j.tcs.2020.11.009

Castenow, Jannik, et al. “The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation.”10.1007/978-3-030-91081-5_19__Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, edited by C. Johnen et al., vol. 13046, Springer, 2021, pp. 289–304, doi:10.1007/978-3-030-91081-5_19.
LibreCat: /record/26986
DOI: 10.1007/978-3-030-91081-5_19
arXiv: 2109.11856

Maack, Marten, et al. “Full Version -- Server Cloud Scheduling.” ArXiv:2108.02109, 2021.
LibreCat: /record/27778

Berger, Thilo Frederik. Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation. 2021.
LibreCat: /record/44234

Pranger, Sebastian. Online K-Facility Reallocation Using k-Server Algorithms. 2021.
LibreCat: /record/44233

Castenow, Jannik, et al. “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up.”10.1007/978-3-030-64348-5_6__Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings, edited by Stéphane10.1007/978-3-030-64348-5_6__Devismes10.1007/978-3-030-64348-5_6__and Neeraj10.1007/978-3-030-64348-5_6__Mittal, vol. 12514, Springer, 2020, pp. 65–80, doi:10.1007/978-3-030-64348-5_6.
LibreCat: /record/19899
DOI: 10.1007/978-3-030-64348-5_6
arXiv: 2010.02043 

Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion of an Edge.”10.4230/LIPIcs.ESA.2020.12__28th Annual European Symposium on Algorithms (ESA 2020), edited by Fabrizio Grandoni et al., vol. 173, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2020, pp. 12:1-12:14, doi:10.4230/LIPIcs.ESA.2020.12.
LibreCat: /record/20159
DOI: 10.4230/LIPIcs.ESA.2020.12

Castenow, Jannik, et al. “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &; Luminous Robots with Limited Visibility .”10.1007/978-3-030-64348-5_5__Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , edited by Stéphane10.1007/978-3-030-64348-5_5__Devismes and Neeraj10.1007/978-3-030-64348-5_5__Mittal, vol. 12514, Springer, 2020, pp. 60–64, doi:10.1007/978-3-030-64348-5_5.
LibreCat: /record/20185
DOI: 10.1007/978-3-030-64348-5_5
arXiv: 2010.04424