Götte, T., Kolb, C., Scheideler, C., &; Werthmann, J. (2023). Beep-and-Sleep: Message and Energy Efficient Set Cover. Theor. Comput. Sci., 950, 113756.https://doi.org/10.1016/j.tcs.2023.113756 
LibreCat: /record/43109
DOI: 10.1016/j.tcs.2023.113756

Werthmann, J., Scheideler, C., Coy, S., Czumaj, A., &; Schneider, P. (2023). Routing Schemes for Hybrid Communication Networks.https://doi.org/10.48550/ARXIV.2210.05333 
LibreCat: /record/45188
DOI: 10.48550/ARXIV.2210.05333

Dou, J., Götte, T., Hillebrandt, H., Scheideler, C., &; Werthmann, J. (2023). 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). ACM Symposium on Principles of Distributed Computing (PODC), Orlando, USA.
LibreCat: /record/45193

Götte, T., Hinnenthal, K., Scheideler, C., &; Werthmann, J. (2023). Time-Optimal Construction of Overlays. Distributed Computing.https://doi.org/10.1007/s00446-023-00442-4 
LibreCat: /record/45192
DOI: https://doi.org/10.1007/s00446-023-00442-4

Götte, T., Knollmann, T., Meyer auf der Heide, F., Scheideler, C., &; Werthmann, J. (2023). Capabilities and Limitations of Local Strategies in Dynamic Networks. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, &; H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412, pp. 1--20). Heinz Nixdorf Institut, Universität Paderborn.https://doi.org/10.5281/zenodo.8060372 
LibreCat: /record/45875
DOI: 10.5281/zenodo.8060372

Haake, C.-J., Meyer auf der Heide, F., Platzner, M., Wachsmuth, H., &; Wehrheim, H. (2023). On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412). Heinz Nixdorf Institut, Universität Paderborn.https://doi.org/10.17619/UNIPB/1-1797 
LibreCat: /record/45863
DOI: 10.17619/UNIPB/1-1797

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 
LibreCat: /record/31847
DOI: 10.1145/3490148.3538595
arXiv: 2205.11102

Padalkin, A., Scheideler, C., &; Warner, D. (2022). The Structural Power of Reconfigurable Circuits in the Amoebot Model. In T. E. Ouldridge &; S. F. J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28) (Vol. 238, p. 8:1–8:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.DNA.28.8 
LibreCat: /record/32602
DOI: 10.4230/LIPIcs.DNA.28.8

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 
LibreCat: /record/31479
DOI: 10.1007/s00453-022-00978-0

Daymude, J. J., Richa, A. W., &; Scheideler, C. (2022). Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. In J. Aspnes &; O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference (Vol. 221, p. 12:1–12:19). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SAND.2022.12 
LibreCat: /record/33230
DOI: 10.4230/LIPIcs.SAND.2022.12

Aguiliera, M., Richa, A. W., Schwarzmann, A. A., Panconesi, A., Scheideler, C., &; Woelfel, P. (2022). 2022 Edsger W. Dijkstra Prize in Distributed Computing. In A. Milani &; P. Woelfel (Eds.), PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022 (p. 1). ACM.https://doi.org/10.1145/3519270.3538411 
LibreCat: /record/33967
DOI: 10.1145/3519270.3538411

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

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 
LibreCat: /record/21096
DOI: 10.1016/j.ic.2021.104697

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 
LibreCat: /record/20683
DOI: 10.1007/s00224-020-10023-8

Bienkowski, M., Feldkord, B., &; Schmidt, P. (2021). A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 14:1-14:17).https://doi.org/10.4230/LIPIcs.STACS.2021.14 
LibreCat: /record/20817
DOI: 10.4230/LIPIcs.STACS.2021.14

Götte, T., Hinnenthal, K., Scheideler, C., &; Werthmann, J. (n.d.). Time-Optimal Construction of Overlays. In K. Censor-Hillel (Ed.), Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21). New York: ACM.https://doi.org/10.1145/3465084.3467932 
LibreCat: /record/22283
DOI: 10.1145/3465084.3467932

Götte, T., Kolb, C., Scheideler, C., &; Werthmann, J. (2021). Beep-And-Sleep: Message and Energy Efficient Set Cover. In Algorithms for Sensor Systems (ALGOSENSORS ’21). ALGOSENSORS 2021, Lisbon, Portgual.https://doi.org/10.1007/978-3-030-89240-1_7 
LibreCat: /record/26888
DOI: 10.1007/978-3-030-89240-1_7

Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., &; Meyer auf der Heide, F. (2020). The Online Multi-Commodity Facility Location Problem. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures.https://doi.org/10.1145/3350755.3400281 
LibreCat: /record/17370
DOI: 10.1145/3350755.3400281
arXiv: 2005.08391

Werneck Richa, A., &; Scheideler, C. (Eds.). (2020). Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings (Vol. 12156). Springer.https://doi.org/10.1007/978-3-030-54921-3 
LibreCat: /record/17836
DOI: 10.1007/978-3-030-54921-3

Scheideler, C., &; Spear, M. (Eds.). (2020). SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM.https://doi.org/10.1145/3350755 
LibreCat: /record/17839
DOI: 10.1145/3350755