Kolb C. Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks.; 2022. doi:10.17619/UNIPB/1-1673 
LibreCat: /record/30239
DOI: 10.17619/UNIPB/1-1673 

Knollmann T, Scheideler C. A self-stabilizing Hashed Patricia Trie. Information and Computation. Published online 2022. doi:10.1016/j.ic.2021.104697
LibreCat: /record/21096
DOI: 10.1016/j.ic.2021.104697

Hinnenthal K. Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter.; 2021. doi:10.17619/UNIPB/1-1169 
LibreCat: /record/24887
DOI: 10.17619/UNIPB/1-1169 

Liedtke DJ. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model.; 2021.
LibreCat: /record/25126

Feldmann M, Padalkin A, Scheideler C, Dolev S. Coordinating Amoebots via Reconfigurable Circuits. In: Johnen C, Michael Schiller E, Schmid S, eds. Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings. Vol 13046. Lecture Notes in Computer Science. Springer; 2021:484-488. doi:10.1007/978-3-030-91081-5‑34
LibreCat: /record/28917
DOI: 10.1007/978-3-030-91081-5‑34

Suermann D. Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers.; 2021.
LibreCat: /record/28998

Everling L. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme.; 2021.
LibreCat: /record/27053

Adsul V. Peer-to-Peer Matching for Distributed Systems.; 2021.
LibreCat: /record/27072

Werthmann J. Derandomization and Local Graph Problems in the Node-Capacitated Clique.; 2021.
LibreCat: /record/21084

Mengshi M. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter.; 2021.
LibreCat: /record/21197

Liedtke D. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model.; 2021.
LibreCat: /record/21627

Feldmann M. Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks.; 2021. doi:10.17619/UNIPB/1-1113
LibreCat: /record/21628
DOI: 10.17619/UNIPB/1-1113

Coy S, Czumaj A, Feldmann M, et al. Near-Shortest Path Routing in Hybrid Communication Networks. In: Bramas Q, Gramoli V, Milani A, eds. 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France. Vol 217. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021:11:1–11:23. doi:10.4230/LIPIcs.OPODIS.2021.11
LibreCat: /record/30217
DOI: 10.4230/LIPIcs.OPODIS.2021.11

Yeole PK. Plurality Consensus in Hybrid Networks.; 2020.
LibreCat: /record/20221

Werneck Richa A, Scheideler C, eds. 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 C, Spear M, eds. 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

Jochmaring M. A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks.; 2020.
LibreCat: /record/20495

Feldmann M, Hinnenthal K, Scheideler C. Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. In: 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
LibreCat: /record/20755
DOI: 10.4230/LIPIcs.OPODIS.2020.31
arXiv: 2007.01191

Skowronek M. Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn; 2020.
LibreCat: /record/18066

Setzer A. Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks. Universität Paderborn; 2020. doi:10.17619/UNIPB/1-1026
LibreCat: /record/18520
DOI: 10.17619/UNIPB/1-1026