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

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

Coy, Sam, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, and Martijn Struijs. “Near-Shortest Path Routing in Hybrid Communication Networks.”https://doi.org/10.4230/LIPIcs.OPODIS.2021.11__In 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, 217:11:1–11:23. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.OPODIS.2021.11 .
LibreCat: /record/30217
DOI: 10.4230/LIPIcs.OPODIS.2021.11

Yeole, Paresh Kishor. Plurality Consensus in Hybrid Networks, 2020.
LibreCat: /record/20221

Werneck Richa, Andrea, and Christian Scheideler, eds. Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings. Vol. 12156. Lecture Notes in Computer Science. Springer, 2020.https://doi.org/10.1007/978-3-030-54921-3 .
LibreCat: /record/17836
DOI: 10.1007/978-3-030-54921-3

Scheideler, Christian, and Michael Spear, eds. SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM, 2020.https://doi.org/10.1145/3350755 .
LibreCat: /record/17839
DOI: 10.1145/3350755

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

Feldmann, Michael, Kristian Hinnenthal, and Christian Scheideler. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.”https://doi.org/10.4230/LIPIcs.OPODIS.2020.31__In Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.OPODIS.2020.31 .
LibreCat: /record/20755
DOI: 10.4230/LIPIcs.OPODIS.2020.31
arXiv: 2007.01191

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

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