Routing Schemes for Hybrid Communication Networks
S. Coy, A. Czumaj, C. Scheideler, P. Schneider, J. Werthmann, Theoretical Computer Science 985 (2024).

On-The-Fly Computing -- Individualized IT-services in dynamic markets
C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim, On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023.

Beep-and-Sleep: Message and Energy Efficient Set Cover
T. Götte, C. Kolb, C. Scheideler, J. Werthmann, Theor. Comput. Sci. 950 (2023) 113756.

Minimum Edge Cuts in Overlay Networks
J. Schweichhart, Minimum Edge Cuts in Overlay Networks, 2023.

Routing Schemes for Hybrid Communication Networks
J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, P. Schneider, in: 2023.

Time-Optimal Construction of Overlays
T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, Distributed Computing (2023).

Local Protocols for Contracting and Expanding Robot Formation Problems
J. Castenow, Local Protocols for Contracting and Expanding Robot Formation Problems, 2023.

Online Algorithms for Allocating Heterogeneous Resources
T. Knollmann, Online Algorithms for Allocating Heterogeneous Resources, 2023.

Capabilities and Limitations of Local Strategies in Dynamic Networks
T. Götte, T. Knollmann, F. Meyer auf der Heide, C. Scheideler, J. Werthmann, 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, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 1--20.

Virtual On-Demand Volunteer System Based on Delaunay Triangulation
N. Ashri, Virtual On-Demand Volunteer System Based on Delaunay Triangulation, 2023.

Routing in Hypergraphs
V. Deppe, Routing in Hypergraphs, 2023.

Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs
J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, J. Werthmann, in: Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23), 2023.

Evaluation of Algorithms for the Node Capacitated Clique
R. Roopa, Evaluation of Algorithms for the Node Capacitated Clique, 2022.

Hybrid Routing in Three Dimensions
M. Nachtigall, Hybrid Routing in Three Dimensions, 2022.

Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen
H. Hillebrandt, Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen, 2022.

The k-Server with Preferences Problem
J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2022, pp. 345–356.

The Structural Power of Reconfigurable Circuits in the Amoebot Model
A. Padalkin, C. Scheideler, D. Warner, in: T.E. Ouldridge, S.F.J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 8:1–8:22.

Mincut Sensitivity Data Structures for the Insertion of an Edge
S. Baswana, S. Gupta, T. Knollmann, Algorithmica (2022).

Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems
J.J. Daymude, A.W. Richa, C. Scheideler, in: J. Aspnes, O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 12:1–12:19.

2022 Edsger W. Dijkstra Prize in Distributed Computing
M. Aguiliera, A.W. Richa, A.A. Schwarzmann, A. Panconesi, C. Scheideler, P. Woelfel, in: A. Milani, P. Woelfel (Eds.), PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, ACM, 2022, p. 1.