Götte, Thorsten, et al. “Beep-and-Sleep: Message and Energy Efficient Set Cover.”10.1016/j.tcs.2023.113756__Theor. Comput. Sci., vol. 950, 2023, p. 113756, doi:10.1016/j.tcs.2023.113756.
LibreCat: /record/43109
DOI: 10.1016/j.tcs.2023.113756

Werthmann, Julian, et al. Routing Schemes for Hybrid Communication Networks. 2023, doi:10.48550/ARXIV.2210.05333.
LibreCat: /record/45188
DOI: 10.48550/ARXIV.2210.05333

Dou, Jinfeng, et al. “Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs.” Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23), 2023.
LibreCat: /record/45193

Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.”https://doi.org/10.1007/s00446-023-00442-4__Distributed Computing, 2023, doi:https://doi.org/10.1007/s00446-023-00442-4.
LibreCat: /record/45192
DOI: https://doi.org/10.1007/s00446-023-00442-4

Götte, Thorsten, et al. “Capabilities and Limitations of Local Strategies in Dynamic Networks.”10.5281/zenodo.8060372__On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 1--20, doi:10.5281/zenodo.8060372.
LibreCat: /record/45875
DOI: 10.5281/zenodo.8060372

Haake, Claus-Jochen, et al. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Heinz Nixdorf Institut, Universität Paderborn, 2023, doi:10.17619/UNIPB/1-1797.
LibreCat: /record/45863
DOI: 10.17619/UNIPB/1-1797

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

Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.”10.4230/LIPIcs.DNA.28.8__28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 8:1–8:22, doi:10.4230/LIPIcs.DNA.28.8.
LibreCat: /record/32602
DOI: 10.4230/LIPIcs.DNA.28.8

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

Daymude, Joshua J., et al. “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.”10.4230/LIPIcs.SAND.2022.12__1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 12:1–12:19, doi:10.4230/LIPIcs.SAND.2022.12.
LibreCat: /record/33230
DOI: 10.4230/LIPIcs.SAND.2022.12

Aguiliera, Marcos, et al. “Edsger W. Dijkstra Prize in Distributed Computing.”10.1145/3519270.3538411__PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, edited by Alessia Milani and Philipp Woelfel, ACM, 2022, p. 1, doi:10.1145/3519270.3538411.
LibreCat: /record/33967
DOI: 10.1145/3519270.3538411

Scheideler, Christian, editor. 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
LibreCat: /record/33968

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

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

Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.”10.1145/3465084.3467932__Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), edited by Keren Censor-Hillel, ACM, doi:10.1145/3465084.3467932.
LibreCat: /record/22283
DOI: 10.1145/3465084.3467932

Götte, Thorsten, et al. “Beep-And-Sleep: Message and Energy Efficient Set Cover.”10.1007/978-3-030-89240-1_7__Algorithms for Sensor Systems (ALGOSENSORS ’21), 2021, doi:10.1007/978-3-030-89240-1_7.
LibreCat: /record/26888
DOI: 10.1007/978-3-030-89240-1_7

Castenow, Jannik, et al. “The Online Multi-Commodity Facility Location Problem.”10.1145/3350755.3400281__Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020, doi:10.1145/3350755.3400281.
LibreCat: /record/17370
DOI: 10.1145/3350755.3400281
arXiv: 2005.08391

Werneck Richa, Andrea, and Christian Scheideler, editors. Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings. Vol. 12156, Springer, 2020, doi:10.1007/978-3-030-54921-3.
LibreCat: /record/17836
DOI: 10.1007/978-3-030-54921-3

Scheideler, Christian, and Michael Spear, editors. SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM, 2020, doi:10.1145/3350755.
LibreCat: /record/17839
DOI: 10.1145/3350755