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

Castenow J. Local Protocols for Contracting and Expanding Robot Formation Problems.; 2023. doi:10.17619/UNIPB/1-1750

Knollmann T. Online Algorithms for Allocating Heterogeneous Resources.; 2023. doi:10.17619/UNIPB/1-1751

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

Deppe V. Routing in Hypergraphs.; 2023.

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

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

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

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

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

Everling L. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme.; 2021.

Adsul V. Peer-to-Peer Matching for Distributed Systems.; 2021.

Werthmann J. Derandomization and Local Graph Problems in the Node-Capacitated Clique.; 2021.

Mengshi M. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter.; 2021.

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

Berger TF. Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation.; 2021.

Pranger S. Online K-Facility Reallocation Using k-Server Algorithms.; 2021.

Yeole PK. Plurality Consensus in Hybrid Networks.; 2020.

Jochmaring M. A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks.; 2020.

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