Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model
D. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model, 2021.

Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks
M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks, 2021.

Near-Shortest Path Routing in Hybrid Communication Networks
S. Coy, A. Czumaj, M. Feldmann, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, M. Struijs, in: Q. Bramas, V. Gramoli, A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 11:1–11:23.

Plurality Consensus in Hybrid Networks
P.K. Yeole, Plurality Consensus in Hybrid Networks, 2020.

Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings
A. Werneck Richa, C. Scheideler, eds., Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings, Springer, 2020.

SPAA : 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020
C. Scheideler, M. Spear, eds., SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020, ACM, 2020.

A self stabilizing protocol for well-formed trees in hybrid networks
M. Jochmaring, A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks, 2020.

Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
M. Feldmann, K. Hinnenthal, C. Scheideler, in: Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.

Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks
M. Skowronek, Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks, Universität Paderborn, 2020.

Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks
A. Setzer, Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks, Universität Paderborn, 2020.

Algorithmen für selbststabilisierende Skip+-Delaunaygraphen
A. Guggenmos, Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen, Universität Paderborn, 2020.

Survey on Algorithms for Self-Stabilizing Overlay Networks
M. Feldmann, C. Scheideler, S. Schmid, ACM Computing Surveys (2020).

Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model
M. Feldmann, A. Khazraei, C. Scheideler, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2020.

On the complexity of local transformations in SDN overlays
D. Warner, On the Complexity of Local Transformations in SDN Overlays, Universität Paderborn, 2020.

A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.

Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems
N. N., Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems, 2019.

Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities
M. Feldmann, C. Scheideler, in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2019, pp. 287--296.

Distributed Computation in Node-Capacitated Networks
J. Augustine, M. Ghaffari, R. Gmyr, K. Hinnenthal, F. Kuhn, J. Li, C. Scheideler, in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM, 2019, pp. 69--79.

Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary
T. Götte, V.R. Vijayalakshmi, C. Scheideler, in: Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19), IEEE, n.d.

On the Complexity of Local Graph Transformations
C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.