Kolb, Christina. Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks. 2022, doi:10.17619/UNIPB/1-1673 .

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.

Hinnenthal, Kristian. Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter. 2021, doi:10.17619/UNIPB/1-1169 .

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

Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.”10.1007/978-3-030-91081-5‑34__Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, edited by Colette Johnen et al., vol. 13046, Springer, 2021, pp. 484–88, doi:10.1007/978-3-030-91081-5‑34.

Suermann, Dennis. Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers. 2021.

Everling, Leon. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme. 2021.

Adsul, Vaibhav. Peer-to-Peer Matching for Distributed Systems. 2021.

Werthmann, Julian. Derandomization and Local Graph Problems in the Node-Capacitated Clique. 2021.

Mengshi, Ma. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter. 2021.

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

Feldmann, Michael. Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks. 2021, doi:10.17619/UNIPB/1-1113.

Coy, Sam, et al. “Near-Shortest Path Routing in Hybrid Communication Networks.”10.4230/LIPIcs.OPODIS.2021.11__25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, edited by Quentin Bramas et al., vol. 217, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 11:1–11:23, doi:10.4230/LIPIcs.OPODIS.2021.11.

Yeole, Paresh Kishor. Plurality Consensus in Hybrid Networks. 2020.

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.

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.

Jochmaring, Moritz. A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks. 2020.

Feldmann, Michael, et al. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.”10.4230/LIPIcs.OPODIS.2020.31__Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.OPODIS.2020.31.

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

Setzer, Alexander. Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks. Universität Paderborn, 2020, doi:10.17619/UNIPB/1-1026.