Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann. “Beep-and-Sleep: Message and Energy Efficient Set Cover.”https://doi.org/10.1016/j.tcs.2023.113756__Theor. Comput. Sci. 950 (2023): 113756.https://doi.org/10.1016/j.tcs.2023.113756 .
LibreCat: /record/43109
DOI: 10.1016/j.tcs.2023.113756

Schweichhart, Jonas. Minimum Edge Cuts in Overlay Networks, 2023.
LibreCat: /record/44735

Werthmann, Julian, Christian Scheideler, Sam Coy, Artur Czumaj, and Philipp Schneider. “Routing Schemes for Hybrid Communication Networks,”https://doi.org/10.48550/ARXIV.2210.05333__2023.https://doi.org/10.48550/ARXIV.2210.05333 .
LibreCat: /record/45188
DOI: 10.48550/ARXIV.2210.05333

Dou, Jinfeng, Thorsten Götte, Henning Hillebrandt, Christian Scheideler, and Julian Werthmann. “Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs.” In Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23), 2023.
LibreCat: /record/45193

Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian Werthmann. “Time-Optimal Construction of Overlays.”https://doi.org/10.1007/s00446-023-00442-4__Distributed Computing, 2023.https://doi.org/10.1007/s00446-023-00442-4 .
LibreCat: /record/45192
DOI: https://doi.org/10.1007/s00446-023-00442-4

Castenow, Jannik. Local Protocols for Contracting and Expanding Robot Formation Problems, 2023.https://doi.org/10.17619/UNIPB/1-1750 .
LibreCat: /record/45580
DOI: 10.17619/UNIPB/1-1750

Knollmann, Till. Online Algorithms for Allocating Heterogeneous Resources, 2023.https://doi.org/10.17619/UNIPB/1-1751 .
LibreCat: /record/45579
DOI: 10.17619/UNIPB/1-1751

Götte, Thorsten, Till Knollmann, Friedhelm Meyer auf der Heide, Christian Scheideler, and Julian Werthmann. “Capabilities and Limitations of Local Strategies in Dynamic Networks.”https://doi.org/10.5281/zenodo.8060372__In On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:1--20. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023.https://doi.org/10.5281/zenodo.8060372 .
LibreCat: /record/45875
DOI: 10.5281/zenodo.8060372

Ashri, Nivedita. Virtual On-Demand Volunteer System Based on Delaunay Triangulation, 2023.
LibreCat: /record/46110

Deppe, Volker. Routing in Hypergraphs, 2023.
LibreCat: /record/47134

Haake, Claus-Jochen, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol. 412. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023.https://doi.org/10.17619/UNIPB/1-1797 .
LibreCat: /record/45863
DOI: 10.17619/UNIPB/1-1797

Roopa, Rajanna. Evaluation of Algorithms for the Node Capacitated Clique, 2022.
LibreCat: /record/30152

Nachtigall, Marcel. Hybrid Routing in Three Dimensions, 2022.
LibreCat: /record/30199

Hillebrandt, Henning. Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen, 2022.
LibreCat: /record/31947

Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “The K-Server with Preferences Problem.”https://doi.org/10.1145/3490148.3538595__In Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 345–56. Association for Computing Machinery, 2022.https://doi.org/10.1145/3490148.3538595 .
LibreCat: /record/31847
DOI: 10.1145/3490148.3538595
arXiv: 2205.11102

Padalkin, Andreas, Christian Scheideler, and Daniel Warner. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.”https://doi.org/10.4230/LIPIcs.DNA.28.8__In 28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, 238:8:1–8:22. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.DNA.28.8 .
LibreCat: /record/32602
DOI: 10.4230/LIPIcs.DNA.28.8

Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity Data Structures for the Insertion of an Edge.”https://doi.org/10.1007/s00453-022-00978-0__Algorithmica, 2022.https://doi.org/10.1007/s00453-022-00978-0 .
LibreCat: /record/31479
DOI: 10.1007/s00453-022-00978-0

Daymude, Joshua J., Andréa W. Richa, and Christian Scheideler. “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.”https://doi.org/10.4230/LIPIcs.SAND.2022.12__In 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, edited by James Aspnes and Othon Michail, 221:12:1–12:19. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.SAND.2022.12 .
LibreCat: /record/33230
DOI: 10.4230/LIPIcs.SAND.2022.12

Aguiliera, Marcos, Andréa W. Richa, Alexander A. Schwarzmann, Alessandro Panconesi, Christian Scheideler, and Philipp Woelfel. “Edsger W. Dijkstra Prize in Distributed Computing.”https://doi.org/10.1145/3519270.3538411__In PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, edited by Alessia Milani and Philipp Woelfel, 1. ACM, 2022.https://doi.org/10.1145/3519270.3538411 .
LibreCat: /record/33967
DOI: 10.1145/3519270.3538411

Scheideler, Christian, ed. 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA. Vol. 246. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
LibreCat: /record/33968

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

Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.”https://doi.org/10.1016/j.ic.2021.104697__Information and Computation, 2022.https://doi.org/10.1016/j.ic.2021.104697 .
LibreCat: /record/21096
DOI: 10.1016/j.ic.2021.104697

Hinnenthal, Kristian. Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter, 2021.https://doi.org/10.17619/UNIPB/1-1169  .
LibreCat: /record/24887
DOI: 10.17619/UNIPB/1-1169 

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

Adsul, Vaibhav. Peer-to-Peer Matching for Distributed Systems, 2021.
LibreCat: /record/27072

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

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

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

Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Managing Multiple Mobile Resources.”https://doi.org/10.1007/s00224-020-10023-8__Theory of Computing Systems 65 (2021): 943–984.https://doi.org/10.1007/s00224-020-10023-8 .
LibreCat: /record/20683
DOI: 10.1007/s00224-020-10023-8

Bienkowski, Marcin, Björn Feldkord, and Pawel Schmidt. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.”https://doi.org/10.4230/LIPIcs.STACS.2021.14__In Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 14:1-14:17, 2021.https://doi.org/10.4230/LIPIcs.STACS.2021.14 .
LibreCat: /record/20817
DOI: 10.4230/LIPIcs.STACS.2021.14

Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian Werthmann. “Time-Optimal Construction of Overlays.”https://doi.org/10.1145/3465084.3467932__In Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), edited by Keren Censor-Hillel. New York: ACM, n.d.https://doi.org/10.1145/3465084.3467932 .
LibreCat: /record/22283
DOI: 10.1145/3465084.3467932

Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann. “Beep-And-Sleep: Message and Energy Efficient Set Cover.”https://doi.org/10.1007/978-3-030-89240-1_7__In Algorithms for Sensor Systems (ALGOSENSORS ’21). Cham, 2021.https://doi.org/10.1007/978-3-030-89240-1_7 .
LibreCat: /record/26888
DOI: 10.1007/978-3-030-89240-1_7

Berger, Thilo Frederik. Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation, 2021.
LibreCat: /record/44234

Pranger, Sebastian. Online K-Facility Reallocation Using k-Server Algorithms, 2021.
LibreCat: /record/44233

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

Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “The Online Multi-Commodity Facility Location Problem.”https://doi.org/10.1145/3350755.3400281__In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.https://doi.org/10.1145/3350755.3400281 .
LibreCat: /record/17370
DOI: 10.1145/3350755.3400281
arXiv: 2005.08391

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

Guggenmos, Andreas. Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen. Universität Paderborn, 2020.
LibreCat: /record/18648

Feldmann, Michael, Christian Scheideler, and Stefan Schmid. “Survey on Algorithms for Self-Stabilizing Overlay Networks.”https://doi.org/10.1145/3397190__ACM Computing Surveys, 2020.https://doi.org/10.1145/3397190 .
LibreCat: /record/16902
DOI: 10.1145/3397190

Feldkord, Björn. Mobile Resource Allocation. Universität Paderborn, 2020.https://doi.org/10.17619/UNIPB/1-869 .
LibreCat: /record/15631
DOI: 10.17619/UNIPB/1-869

Warner, Daniel. On the Complexity of Local Transformations in SDN Overlays. Universität Paderborn, 2020.
LibreCat: /record/15770

Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). ACM, n.d.
LibreCat: /record/15169

Karl, Holger, Dennis Kundisch, Friedhelm Meyer auf der Heide, and Heike Wehrheim. “A Case for a New IT Ecosystem: On-The-Fly Computing.”https://doi.org/10.1007/s12599-019-00627-x__Business &; Information Systems Engineering 62, no. 6 (2020): 467–81.https://doi.org/10.1007/s12599-019-00627-x .
LibreCat: /record/13770
DOI: 10.1007/s12599-019-00627-x

Luo, Linghui, Christian Scheideler, and Thim Frederik Strothmann. “MultiSkipGraph: A Self-Stabilizing Overlay Network That Maintains Monotonic Searchability.” In Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), 2019.
LibreCat: /record/7636

Feldmann, Michael, and Christian Scheideler. “Skeap &; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities.”https://doi.org/10.1145/3323165.3323193__In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 287--296. ACM, 2019.https://doi.org/10.1145/3323165.3323193 .
LibreCat: /record/8534
DOI: 10.1145/3323165.3323193
arXiv: 1805.03472

Augustine, John, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Fabian Kuhn, Jason Li, and Christian Scheideler. “Distributed Computation in Node-Capacitated Networks.”https://doi.org/10.1145/3323165.3323195__In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, 69--79. ACM, 2019.https://doi.org/10.1145/3323165.3323195 .
LibreCat: /record/8871
DOI: 10.1145/3323165.3323195

Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.”https://doi.org/10.4230/LIPICS.ICALP.2019.150__In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 132:150:1--150:14. LIPIcs. Dagstuhl Publishing, 2019.https://doi.org/10.4230/LIPICS.ICALP.2019.150 .
LibreCat: /record/10586
DOI: 10.4230/LIPICS.ICALP.2019.150

Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Managing Multiple Mobile Resources.”https://doi.org/10.1007/978-3-030-39479-0_9__In Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), 120–37. Springer, 2019.https://doi.org/10.1007/978-3-030-39479-0_9 .
LibreCat: /record/12870
DOI: 10.1007/978-3-030-39479-0_9
arXiv: 1907.09834

Augustine, John, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, and Philipp Schneider. “Shortest Paths in a Hybrid Network Model.”https://doi.org/10.1137/1.9781611975994.78__In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1280–99. Philadelphia, PA, 2019.https://doi.org/10.1137/1.9781611975994.78 .
LibreCat: /record/15627
DOI: 10.1137/1.9781611975994.78

Scheideler, Christian, and Petra Berenbrink, eds. The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019. ACM, 2019.https://doi.org/10.1145/3323165 .
LibreCat: /record/14829
DOI: 10.1145/3323165

Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.”https://doi.org/10.1145/3364204__ACM Transactions on Parallel Computing (TOPC) 6, no. 3 (2019).https://doi.org/10.1145/3364204 .
LibreCat: /record/13873
DOI: 10.1145/3364204

Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms for Leasing Vertex Cover and Leasing Non-Metric Facility Location.”https://doi.org/10.5220/0007369503150321__In Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, 315–21. SciTePress, 2019.https://doi.org/10.5220/0007369503150321 .
LibreCat: /record/13942
DOI: 10.5220/0007369503150321

Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “Efficient Parallel Algorithms for Parameterized Problems.”https://doi.org/10.1016/j.tcs.2018.11.006__Theoretical Computer Science 786 (2019): 2–12.https://doi.org/10.1016/j.tcs.2018.11.006 .
LibreCat: /record/13946
DOI: 10.1016/j.tcs.2018.11.006

Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.”https://doi.org/10.1007/978-3-030-24922-9‑26__In Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 345–48, 2019.https://doi.org/10.1007/978-3-030-24922-9‑26 .
LibreCat: /record/14539
DOI: 10.1007/978-3-030-24922-9‑26

Feldmann, Michael, Thorsten Götte, and Christian Scheideler. “A Loosely Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.”https://doi.org/10.1007/978-3-030-34992-9_13__In Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 149–64. Lecture Notes in Computer Science. Springer, Cham, 2019.https://doi.org/10.1007/978-3-030-34992-9_13 .
LibreCat: /record/13182
DOI: https://doi.org/10.1007/978-3-030-34992-9_13
arXiv: 1909.04544

Hinnenthal, Kristian, Christian Scheideler, and Martijn Struijs. “Fast Distributed Algorithms for LP-Type Problems of Low Dimension.”https://doi.org/10.4230/LIPICS.DISC.2019.23__In 33rd International Symposium on Distributed Computing (DISC 2019), 2019.https://doi.org/10.4230/LIPICS.DISC.2019.23 .
LibreCat: /record/13652
DOI: 10.4230/LIPICS.DISC.2019.23

Feldkord, Björn, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amithttps://doi.org/10.4230/LIPIcs.ICALP.2018.51__Kumar, Sören Riechers, and David Wajc. “Fully-Dynamic Bin Packing with Little Repacking.”https://doi.org/10.4230/LIPIcs.ICALP.2018.51__In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), edited by Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella, 107:51:1-51:24. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018.https://doi.org/10.4230/LIPIcs.ICALP.2018.51 .
LibreCat: /record/2484
DOI: 10.4230/LIPIcs.ICALP.2018.51
arXiv: 1711.01231

Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location with Mobile Facilities.”https://doi.org/10.1145/3210377.3210389__In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 373–81. ACM, 2018.https://doi.org/10.1145/3210377.3210389 .
LibreCat: /record/2485
DOI: 10.1145/3210377.3210389

Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide, and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.”https://doi.org/10.1007/s00224-017-9836-z__Theory of Computing Systems, 2018.https://doi.org/10.1007/s00224-017-9836-z .
LibreCat: /record/2849
DOI: 10.1007/s00224-017-9836-z

Hamann, Heiko, Christine Markarian, Friedhelm Meyer auf der Heide, and Mostafa Wahby. “Pick, Pack, &; Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.”https://doi.org/10.4230/LIPIcs.FUN.2018.22__In Ninth International Conference on Fun with Algorithms (FUN), 2018.https://doi.org/10.4230/LIPIcs.FUN.2018.22 .
LibreCat: /record/2850
DOI: 10.4230/LIPIcs.FUN.2018.22

Gmyr, Robert. Distributed Algorithms for Overlay Networks and Programmable Matter. Universität Paderborn, 2018.https://doi.org/10.17619/UNIPB/1-265 .
LibreCat: /record/1138
DOI: 10.17619/UNIPB/1-265

Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.”https://doi.org/10.1109/IPDPS.2018.00114__In Proceedings of the 32nd IEEE International Parallel &; Distributed Processing Symposium (IPDPS). IEEE, 2018.https://doi.org/10.1109/IPDPS.2018.00114 .
LibreCat: /record/1163
DOI: 10.1109/IPDPS.2018.00114
arXiv: 1710.08128

Feldmann, Michael, Christian Scheideler, and Alexander Setzer. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.”https://doi.org/10.1109/IPDPS.2018.00113__In Proceedings of the 32nd IEEE International Parallel &; Distributed Processing Symposium (IPDPS). IEEE, 2018.https://doi.org/10.1109/IPDPS.2018.00113 .
LibreCat: /record/1164
DOI: 10.1109/IPDPS.2018.00113
arXiv: 1802.07504

N., N. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn, 2018.
LibreCat: /record/18030

Wulfes, Robin. Load-Balanced Routing in Hybriden Kommunikationsnetzwerken. Universität Paderborn, 2018.
LibreCat: /record/18033

Scheideler, Christian. “Preface.”https://doi.org/10.1016/j.tcs.2018.11.004__Theor. Comput. Sci. 751 (2018): 1.https://doi.org/10.1016/j.tcs.2018.11.004 .
LibreCat: /record/5984
DOI: 10.1016/j.tcs.2018.11.004

Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.”https://doi.org/10.1007/978-3-030-03232-6_1__In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham, 2018.https://doi.org/10.1007/978-3-030-03232-6_1 .
LibreCat: /record/4411
DOI: 10.1007/978-3-030-03232-6_1
arXiv: 1809.04923

Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer, 2018.
LibreCat: /record/4563

Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.”https://doi.org/10.1145/3210377.3210663__In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press, 2018.https://doi.org/10.1145/3210377.3210663 .
LibreCat: /record/4565
DOI: 10.1145/3210377.3210663

Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.”https://doi.org/10.1145/3210377.3210662__In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. ACM Press, 2018.https://doi.org/10.1145/3210377.3210662 .
LibreCat: /record/7570
DOI: 10.1145/3210377.3210662

Feldmann, Michael, Christina Kolb, and Christian Scheideler. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.”https://doi.org/10.1007/978-3-030-03232-6_2__In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 11201:16–31. Lecture Notes in Computer Science. Springer, Cham, 2018.https://doi.org/10.1007/978-3-030-03232-6_2 .
LibreCat: /record/4351
DOI: 10.1007/978-3-030-03232-6_2
arXiv: 1808.10300

Benter, Markus, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander Setzer, and Jannik Sundermeier. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.”https://doi.org/10.1007/978-3-030-19759-9_4__In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018.https://doi.org/10.1007/978-3-030-19759-9_4 .
LibreCat: /record/4375
DOI: 10.1007/978-3-030-19759-9_4

Götte, Thorsten, Christian Scheideler, and Alexander Setzer. “On Underlay-Aware Self-Stabilizing Overlay Networks.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 11201:50–64. Lecture Notes in Computer Science. Springer, 2018.
LibreCat: /record/5222

Jochmaring, Moritz. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn, 2018.
LibreCat: /record/5368

Geromel, Marcel. Mobile Facility Leasing. Universität Paderborn, 2018.
LibreCat: /record/5403

Kolpaczki, Patrick Irenäus. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn, 2018.
LibreCat: /record/5404

Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität Paderborn, 2018.https://doi.org/10.17619/UNIPB/1-271 .
LibreCat: /record/1209
DOI: 10.17619/UNIPB/1-271

Markarian, Christine. “Leasing with Uncertainty.”https://doi.org/10.1007/978-3-319-89920-6_57__In International Conference on Operations Research (OR), 2017.https://doi.org/10.1007/978-3-319-89920-6_57 .
LibreCat: /record/2851
DOI: 10.1007/978-3-319-89920-6_57

Burkhardt, Michél . Untersuchungen Zum Cone-Hashing. Universität Paderborn, 2017.
LibreCat: /record/18026

Schenk, Andreas. Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen. Universität Paderborn, 2017.
LibreCat: /record/18028

Beckendorf, Björn. Visualisierung Zu Algorithmen Verteilter Netzwerksysteme. Universität Paderborn, 2017.
LibreCat: /record/18029

Luo, Linghui. MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained. Universität Paderborn, 2017.
LibreCat: /record/81

Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.”https://doi.org/10.1007/978-3-319-59605-1_13__In Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 139–50. LNCS, 2017.https://doi.org/10.1007/978-3-319-59605-1_13 .
LibreCat: /record/82
DOI: 10.1007/978-3-319-59605-1_13

Scheideler, Christian, and Mohammad Taghi Hajiaghayi, eds. Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. ACM, 2017.https://doi.org/10.1145/3087556 .
LibreCat: /record/5980
DOI: 10.1145/3087556

Strothmann, Thim Frederik. Self-* Algorithms for Distributed Systems. Universität Paderborn, 2017.https://doi.org/10.17619/UNIPB/1-150 .
LibreCat: /record/61
DOI: 10.17619/UNIPB/1-150

Sundermeier, Jannik. Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions. Universität Paderborn, 2017.
LibreCat: /record/699

Feldkord, Björn, Christine Markarian, and Friedhelm Meyer auf der Heide. “Price Fluctuations in Online Leasing.”https://doi.org/10.1007/978-3-319-71147-8_2__In Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 17–31, 2017.https://doi.org/10.1007/978-3-319-71147-8_2 .
LibreCat: /record/70
DOI: 10.1007/978-3-319-71147-8_2

Knollmann, Till. A Self-Stabilizing Protocol for Graphs of Diameter Two. Universität Paderborn, 2017.
LibreCat: /record/700

Götte, Thorsten. Self-Stabilizing Spanners for Tree Metrics. Universität Paderborn, 2017.
LibreCat: /record/701

Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.”https://doi.org/10.1145/3087556.3087575__In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 313–19, 2017.https://doi.org/10.1145/3087556.3087575 .
LibreCat: /record/55
DOI: 10.1145/3087556.3087575

Wachowiak, Lennart. Das Mobile Server Problem in Netzwerken. Universität Paderborn, 2017.
LibreCat: /record/696

Burkhardt, Michel. Untersuchungen zum Cone-Hashing. Universität Paderborn, 2017.
LibreCat: /record/697

Schenk, Andreas. Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen. Universität Paderborn, 2017.
LibreCat: /record/1048

Beckendorfer, Björn. Visualisierung zu Algorithmen verteilter Netzwerksysteme. Universität Paderborn, 2017.
LibreCat: /record/1049

Gmyr, Robert, Kristian Hinnenthal, Christian Scheideler, and Christian Sohler. “Distributed Monitoring of Network Properties: The Power of Hybrid Networks.”https://doi.org/10.4230/LIPIcs.ICALP.2017.137__In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 137:1--137:15. Leibniz International Proceedings in Informatics (LIPIcs), 2017.https://doi.org/10.4230/LIPIcs.ICALP.2017.137 .
LibreCat: /record/105
DOI: 10.4230/LIPIcs.ICALP.2017.137

Feldmann, Michael, and Christian Scheideler. “A Self-Stabilizing General De Bruijn Graph.”https://doi.org/10.1007/978-3-319-69084-1_17__In Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 10616:250–64. Lecture Notes in Computer Science. Springer, Cham, 2017.https://doi.org/10.1007/978-3-319-69084-1_17 .
LibreCat: /record/125
DOI: 10.1007/978-3-319-69084-1_17
arXiv: 1708.06542