T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-and-Sleep: Message and Energy Efficient Set Cover,”10.1016/j.tcs.2023.113756__Theor. Comput. Sci., vol. 950, p. 113756, 2023, doi:10.1016/j.tcs.2023.113756 .
LibreCat: /record/43109
DOI: 10.1016/j.tcs.2023.113756

J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, and P. Schneider, “Routing Schemes for Hybrid Communication Networks,”10.48550/ARXIV.2210.05333__2023, doi:10.48550/ARXIV.2210.05333 .
LibreCat: /record/45188
DOI: 10.48550/ARXIV.2210.05333

J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, and J. Werthmann, “Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs,” presented at the ACM Symposium on Principles of Distributed Computing (PODC), Orlando, USA, 2023.
LibreCat: /record/45193

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

T. Götte, T. Knollmann, F. Meyer auf der Heide, C. Scheideler, and J. Werthmann, “Capabilities and Limitations of Local Strategies in Dynamic Networks,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 1--20.
LibreCat: /record/45875
DOI: 10.5281/zenodo.8060372

C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023.
LibreCat: /record/45863
DOI: 10.17619/UNIPB/1-1797

J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “The k-Server with Preferences Problem,”10.1145/3490148.3538595__in Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 2022, pp. 345–356, doi:10.1145/3490148.3538595 .
LibreCat: /record/31847
DOI: 10.1145/3490148.3538595
arXiv: 2205.11102

A. Padalkin, C. Scheideler, and D. Warner, “The Structural Power of Reconfigurable Circuits in the Amoebot Model,”10.4230/LIPIcs.DNA.28.8__in 28th International Conference on DNA Computing and Molecular Programming (DNA 28), 2022, vol. 238, p. 8:1–8:22, doi:10.4230/LIPIcs.DNA.28.8 .
LibreCat: /record/32602
DOI: 10.4230/LIPIcs.DNA.28.8

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

J. J. Daymude, A. W. Richa, and C. Scheideler, “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems,”10.4230/LIPIcs.SAND.2022.12__in 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, 2022, vol. 221, p. 12:1–12:19, doi:10.4230/LIPIcs.SAND.2022.12 .
LibreCat: /record/33230
DOI: 10.4230/LIPIcs.SAND.2022.12

M. Aguiliera, A. W. Richa, A. A. Schwarzmann, A. Panconesi, C. Scheideler, and P. Woelfel, “Edsger W. Dijkstra Prize in Distributed Computing,”10.1145/3519270.3538411__in PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, 2022, p. 1, doi:10.1145/3519270.3538411 .
LibreCat: /record/33967
DOI: 10.1145/3519270.3538411

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

T. Knollmann and C. Scheideler, “A self-stabilizing Hashed Patricia Trie,”10.1016/j.ic.2021.104697__Information and Computation, Art. no. 104697, 2022, doi:10.1016/j.ic.2021.104697 .
LibreCat: /record/21096
DOI: 10.1016/j.ic.2021.104697

B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,”10.1007/s00224-020-10023-8__Theory of Computing Systems, vol. 65, pp. 943–984, 2021, doi:10.1007/s00224-020-10023-8 .
LibreCat: /record/20683
DOI: 10.1007/s00224-020-10023-8

M. Bienkowski, B. Feldkord, and P. Schmidt, “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location,” in Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17.
LibreCat: /record/20817
DOI: 10.4230/LIPIcs.STACS.2021.14

T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction of Overlays,” in Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), Virtual.
LibreCat: /record/22283
DOI: 10.1145/3465084.3467932

T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-And-Sleep: Message and Energy Efficient Set Cover,” in Algorithms for Sensor Systems (ALGOSENSORS ’21), Cham, 2021.
LibreCat: /record/26888
DOI: 10.1007/978-3-030-89240-1_7

J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “The Online Multi-Commodity Facility Location Problem,” in Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.
LibreCat: /record/17370
DOI: 10.1145/3350755.3400281
arXiv: 2005.08391

A. Werneck Richa and C. Scheideler, Eds., Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings, vol. 12156. Springer, 2020.
LibreCat: /record/17836
DOI: 10.1007/978-3-030-54921-3

C. Scheideler and M. Spear, Eds., SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM, 2020.
LibreCat: /record/17839
DOI: 10.1145/3350755

M. Feldmann, K. Hinnenthal, and C. Scheideler, “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs,” in Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), 2020.
LibreCat: /record/20755
DOI: 10.4230/LIPIcs.OPODIS.2020.31
arXiv: 2007.01191

M. Feldmann, C. Scheideler, and S. Schmid, “Survey on Algorithms for Self-Stabilizing Overlay Networks,” ACM Computing Surveys, 2020.
LibreCat: /record/16902
DOI: 10.1145/3397190

J. Castenow, C. Kolb, and C. 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), Kolkata, Indien.
LibreCat: /record/15169

H. Karl, D. Kundisch, F. Meyer auf der Heide, and H. Wehrheim, “A Case for a New IT Ecosystem: On-The-Fly Computing,”10.1007/s12599-019-00627-x__Business &; Information Systems Engineering, vol. 62, no. 6, pp. 467–481, 2020, doi:10.1007/s12599-019-00627-x .
LibreCat: /record/13770
DOI: 10.1007/s12599-019-00627-x

L. Luo, C. Scheideler, and T. F. 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), Rio de Janeiro, Brazil, 2019.
LibreCat: /record/7636

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

J. Augustine et al., “Distributed Computation in Node-Capacitated Networks,” in Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, 2019, pp. 69--79.
LibreCat: /record/8871
DOI: 10.1145/3323165.3323195

C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,” in Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.
LibreCat: /record/10586
DOI: 10.4230/LIPICS.ICALP.2019.150

B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” in Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), 2019, pp. 120–137.
LibreCat: /record/12870
DOI: 10.1007/978-3-030-39479-0_9
arXiv: 1907.09834

J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, and P. Schneider, “Shortest Paths in a Hybrid Network Model,” in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, pp. 1280–1299.
LibreCat: /record/15627
DOI: 10.1137/1.9781611975994.78

C. Scheideler and P. Berenbrink, Eds., The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019. ACM, 2019.
LibreCat: /record/14829
DOI: 10.1145/3323165

B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” ACM Transactions on Parallel Computing (TOPC), vol. 6, no. 3, 2019.
LibreCat: /record/13873
DOI: 10.1145/3364204

C. Markarian and F. Meyer auf der Heide, “Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location,” in Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, 2019, pp. 315–321.
LibreCat: /record/13942
DOI: 10.5220/0007369503150321

F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “Efficient parallel algorithms for parameterized problems,” Theoretical Computer Science, vol. 786, pp. 2–12, 2019.
LibreCat: /record/13946
DOI: 10.1016/j.tcs.2018.11.006

J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), L’Aquila, Italy, 2019, pp. 345–348.
LibreCat: /record/14539
DOI: 10.1007/978-3-030-24922-9‑26

M. Feldmann, T. Götte, and C. Scheideler, “A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory,” in Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2019, pp. 149–164.
LibreCat: /record/13182
DOI: https://doi.org/10.1007/978-3-030-34992-9_13
arXiv: 1909.04544

K. Hinnenthal, C. Scheideler, and M. Struijs, “Fast Distributed Algorithms for LP-Type Problems of Low Dimension,” in 33rd International Symposium on Distributed Computing (DISC 2019), 2019.
LibreCat: /record/13652
DOI: 10.4230/LIPICS.DISC.2019.23

B. Feldkord et al., “Fully-Dynamic Bin Packing with Little Repacking,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prag, 2018, vol. 107, pp. 51:1-51:24.
LibreCat: /record/2484
DOI: 10.4230/LIPIcs.ICALP.2018.51
arXiv: 1711.01231

B. Feldkord and F. Meyer auf der Heide, “Online Facility Location with Mobile Facilities,” in Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien, 2018, pp. 373–381.
LibreCat: /record/2485
DOI: 10.1145/3210377.3210389

F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks,” Theory of Computing Systems, 2018.
LibreCat: /record/2849
DOI: 10.1007/s00224-017-9836-z

H. Hamann, C. Markarian, F. Meyer auf der Heide, and M. Wahby, “Pick, Pack, &; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets,” in Ninth International Conference on Fun with Algorithms (FUN), 2018.
LibreCat: /record/2850
DOI: 10.4230/LIPIcs.FUN.2018.22

M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing Supervised Publish-Subscribe Systems,” in Proceedings of the 32nd IEEE International Parallel &; Distributed Processing Symposium (IPDPS), Vancouver, 2018.
LibreCat: /record/1163
DOI: 10.1109/IPDPS.2018.00114
arXiv: 1710.08128

M. Feldmann, C. Scheideler, and A. Setzer, “Skueue: A Scalable and Sequentially Consistent Distributed Queue,” in Proceedings of the 32nd IEEE International Parallel &; Distributed Processing Symposium (IPDPS), Vancouver, 2018.
LibreCat: /record/1164
DOI: 10.1109/IPDPS.2018.00113
arXiv: 1802.07504

C. Scheideler, “Preface,” Theor. Comput. Sci., vol. 751, p. 1, 2018.
LibreCat: /record/5984
DOI: 10.1016/j.tcs.2018.11.004

T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Tokyo, 2018, vol. 11201.
LibreCat: /record/4411
DOI: 10.1007/978-3-030-03232-6_1
arXiv: 1809.04923

D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Helsinki, 2018.
LibreCat: /record/4563

D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement: Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien, 2018.
LibreCat: /record/4565
DOI: 10.1145/3210377.3210663

F. Meyer auf der Heide and J. S. Schaefer, “Brief Announcement: Communication in Systems of Home Based Mobile Agents,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, Vienna, 2018.
LibreCat: /record/7570
DOI: 10.1145/3210377.3210662

M. Feldmann, C. Kolb, and C. Scheideler, “Self-stabilizing Overlays for high-dimensional Monotonic Searchability,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2018, vol. 11201, pp. 16–31.
LibreCat: /record/4351
DOI: 10.1007/978-3-030-03232-6_2
arXiv: 1808.10300

M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, and J. Sundermeier, “A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension,” in Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), Helsinki, 2018.
LibreCat: /record/4375
DOI: 10.1007/978-3-030-19759-9_4

T. Götte, C. Scheideler, and A. 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), Tokyo, Japan, 2018, vol. 11201, pp. 50–64.
LibreCat: /record/5222

C. Markarian, “Leasing with Uncertainty,” in International Conference on Operations Research (OR), Berlin, 2017.
LibreCat: /record/2851
DOI: 10.1007/978-3-319-89920-6_57

F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity,” in Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 2017, pp. 139–150.
LibreCat: /record/82
DOI: 10.1007/978-3-319-59605-1_13

C. Scheideler and M. 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.
LibreCat: /record/5980
DOI: 10.1145/3087556

B. Feldkord, C. Markarian, and F. Meyer auf der Heide, “Price Fluctuations in Online Leasing,” in Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31.
LibreCat: /record/70
DOI: 10.1007/978-3-319-71147-8_2

B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” in Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–319.
LibreCat: /record/55
DOI: 10.1145/3087556.3087575

R. Gmyr, K. Hinnenthal, C. Scheideler, and C. Sohler, “Distributed Monitoring of Network Properties: The Power of Hybrid Networks,” in Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, pp. 137:1--137:15.
LibreCat: /record/105
DOI: 10.4230/LIPIcs.ICALP.2017.137

M. Feldmann and C. Scheideler, “A Self-Stabilizing General De Bruijn Graph,” in Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2017, vol. 10616, pp. 250–264.
LibreCat: /record/125
DOI: 10.1007/978-3-319-69084-1_17
arXiv: 1708.06542

F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “On the Parameterized Parallel Complexity and the Vertex Cover Problem,” in Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–488.
LibreCat: /record/177
DOI: 10.1007/978-3-319-48749-6_35

F. Meyer auf der Heide, Ed., Introduction to the Special Issue on SPAA 2014, no. 1. 2016.
LibreCat: /record/187
DOI: 10.1145/2936716

T. F. Strothmann, “The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree,” Journal of Graph Algorithms and Applications, vol. 20, no. 1, pp. 79–100, 2016.
LibreCat: /record/5762
DOI: 10.7155/jgaa.00385

M. Drees, B. Feldkord, and A. Skopalik, “Strategic Online Facility Location,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607.
LibreCat: /record/149
DOI: 10.1007/978-3-319-48749-6_43

S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, and P. Pietrzyk, “Towards the price of leasing online,” Journal of Combinatorial Optimization, no. 4, pp. 1197--1216, 2016.
LibreCat: /record/139
DOI: 10.1007/s10878-015-9915-5

C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks,” in Proceedings of the 30th International Symposium on Distributed Computing (DISC), 2016, pp. 71--84.
LibreCat: /record/142
DOI: 10.1007/978-3-662-53426-7_6

F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “The Monotone Circuit Value Problem with Bounded Genus Is in NC,” in Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102.
LibreCat: /record/143
DOI: 10.1007/978-3-319-42634-1_8

M. Feldotto and K. Graffi, “Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM,” Concurrency and Computation: Practice and Experience, vol. 28, no. 5, pp. 1655–1677, 2016.
LibreCat: /record/145
DOI: 10.1002/cpe.3716

C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures,” in Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS), 2015.
LibreCat: /record/241
DOI: 10.4230/LIPIcs.OPODIS.2015.24

A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks,” in Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2015, pp. 201–216.
LibreCat: /record/242
DOI: 10.1007/978-3-319-21741-3_14

T. F. Strothmann, “The impact of communication patterns on distributed locally self-adjusting binary search trees,” in Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM), 2015, pp. 175--186.
LibreCat: /record/243
DOI: 10.1007/978-3-319-15612-5_16

C. Markarian and F. Meyer auf der Heide, “Online Resource Leasing,” in Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–344.
LibreCat: /record/266
DOI: 10.1145/2767386.2767454

S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A deterministic worst-case message complexity optimal solution for resource discovery,” Theoretical Computer Science, pp. 67–79, 2015.
LibreCat: /record/327
DOI: 10.1016/j.tcs.2014.11.027

A. Cord-Landwehr and P. Lenzner, “Network Creation Games: Think Global - Act Local,” in Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS), 2015, pp. 248--260.
LibreCat: /record/275
DOI: 10.1007/978-3-662-48054-0_21

S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, and S. Riechers, “Towards Flexible Demands in Online Leasing Problems,” in Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON), 2015, pp. 277--288.
LibreCat: /record/240
DOI: 10.1007/978-3-319-21398-9_22

L. Blazovics, T. Lukovszki, and B. Forstner, “Surrounding robots -- A discrete localized solution for the intruder problem,” Journal of Advanced Computational Intelligence and Intelligent Informatics, no. 3, pp. 315--319, 2014.
LibreCat: /record/356
DOI: 10.20965/jaciii.2014.p0315

J. Janiuk, A. Mäcker, and K. Graffi, “Secure Distributed Data Structures for Peer-to-Peer-based Social Networks,” in Proceedings of the International Conference on Collaboration Technologies and Systems (CTS), 2014, pp. 396–405.
LibreCat: /record/367
DOI: 10.1109/CTS.2014.6867595

S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: A Self-stabilizing Chord Overlay Network,” Theory of Computing Systems, no. 3, pp. 591–612, 2014.
LibreCat: /record/378
DOI: 10.1007/s00224-012-9431-2

S. Abshoff, C. Markarian, and F. Meyer auf der Heide, “Randomized Online Algorithms for Set Cover Leasing Problems,” in Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp. 25–34.
LibreCat: /record/379
DOI: 10.1007/978-3-319-12691-3_3

A. Cord-Landwehr, A. Mäcker, and F. Meyer auf der Heide, “Quality of Service in Network Creation Games,” in Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 423–428.
LibreCat: /record/380
DOI: 10.1007/978-3-319-13129-0_34

S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Brief Announcement: A Model for Multilevel Network Games,” in Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, p. 294.
LibreCat: /record/452

S. Kniesburges, C. Markarian, F. Meyer auf der Heide, and C. Scheideler, “Algorithmic Aspects of Resource Management in the Cloud,” in Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13.
LibreCat: /record/459
DOI: 10.1007/978-3-319-09620-9_1

D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization,” Theory of Computing Systems, no. 1, pp. 110–135, 2014.
LibreCat: /record/464
DOI: 10.1007/s00224-013-9504-x

D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, and T. F. Strothmann, “On Stabilizing Departures in Overlay Networks,” in Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2014, pp. 48--62.
LibreCat: /record/393
DOI: 10.1007/978-3-319-11764-5_4

S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Multilevel Network Games,” in Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 435–440.
LibreCat: /record/395
DOI: 10.1007/978-3-319-13129-0_36

C. Scheideler, M. Eikel, and A. Setzer, “Minimum Linear Arrangement of Series-Parallel Graphs,” in Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA), 2014, pp. 168--180.
LibreCat: /record/397

M. Feldotto, C. Scheideler, and K. Graffi, “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths,” in Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P), 2014, pp. 1–10.
LibreCat: /record/412
DOI: 10.1109/P2P.2014.6934300
arXiv: 1408.0395

P. Kolman and C. Scheideler, “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing,” Theory of Computing Systems, no. 2, pp. 341–363, 2013.
LibreCat: /record/476
DOI: 10.1007/s00224-013-9454-3

S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, and F. Meyer auf der Heide, “Token Dissemination in Geometric Dynamic Networks,” in Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers, 2013, pp. 22–34.
LibreCat: /record/477
DOI: 10.1007/978-3-642-45346-5_3

K. Graffi and L. Bremer, “Symbiotic Coupling of P and Cloud Systems: The Wikipedia Case,” in Proceedings of the International Conference on Communications (ICC’13), 2013, pp. 3444–3449.
LibreCat: /record/481
DOI: 10.1109/ICC.2013.6655082

S. Abshoff, M. Benter, M. Malatyali, and F. Meyer auf der Heide, “On Two-Party Communication Through Dynamic Networks,” in Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS), 2013, pp. 11–22.
LibreCat: /record/507
DOI: 10.1007/978-3-319-03850-6_2

C. Avin, B. Häupler, Z. Lotker, C. Scheideler, and S. Schmid, “Locally Self-Adjusting Tree Networks,” in Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406.
LibreCat: /record/513
DOI: 10.1109/IPDPS.2013.40

F. Meyer auf der Heide and K. Swirkot, “Hierarchies in Local Distributed Decision.” arXiv, 2013.
LibreCat: /record/524
arXiv: 1311.7229

K. Graffi and V. Rapp, “Continuous Gossip-based Aggregation through Dynamic Information Aging,” in Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13), 2013, pp. 1–7.
LibreCat: /record/541
DOI: 10.1109/ICCCN.2013.6614118

M. Feldotto and K. Graffi, “Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM,” in Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13), 2013, pp. 99–106.
LibreCat: /record/544
DOI: 10.1109/HPCSim.2013.6641399

K. Graffi, M. Benter, M. Divband, S. Kniesburges, and A. Koutsopoulos, “Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network,” in Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 27–34.
LibreCat: /record/546
DOI: 10.1109/NetSys.2013.11

K. Graffi and T. Klerx, “Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks,” in Proceedings of the International Conference on Peer-to-Peer Computing (P’13), 2013, pp. 1–5.
LibreCat: /record/548
DOI: 10.1109/P2P.2013.6688720

P. Flocchini, J. Gao, E. Kranakis, and F. Meyer auf der Heide, Eds., Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, vol. 8243. Springer, 2013.
LibreCat: /record/558
DOI: 10.1007/978-3-642-45346-5

P. Wette and K. Graffi, “Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables,” in Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 35–42.
LibreCat: /record/559
DOI: 10.1109/NetSys.2013.9

M. Keller, S. Pawlik, P. Pietrzyk, and H. Karl, “A Local Heuristic for Latency-Optimized Distributed Cloud Deployment,” in Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing, 2013, pp. 429–434.
LibreCat: /record/562
DOI: 10.1109/UCC.2013.85

C. Markarian, F. Meyer auf der Heide, and M. Schubert, “A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks,” in Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS), 2013, pp. 217–227.
LibreCat: /record/563
DOI: 10.1007/978-3-642-45346-5_16

S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery,” in Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO), 2013, pp. 165–176.
LibreCat: /record/564
DOI: 10.1007/978-3-319-03578-9_14