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

Feldotto, M., Scheideler, C., &; Graffi, K. (2014). 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) (pp. 1–10).https://doi.org/10.1109/P2P.2014.6934300 
LibreCat: /record/412
DOI: 10.1109/P2P.2014.6934300
arXiv: 1408.0395

Eikel, M., &; Scheideler, C. (2015). IRIS: A Robust Information System Against Insider DoS Attacks. Transactions on Parallel Computing, (3), 18:1--18:33.https://doi.org/10.1145/2809806 
LibreCat: /record/284
DOI: 10.1145/2809806

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

Koutsopoulos, A., Scheideler, C., &; Strothmann, T. F. (2015). 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) (pp. 201–216).https://doi.org/10.1007/978-3-319-21741-3_14 
LibreCat: /record/242
DOI: 10.1007/978-3-319-21741-3_14

Kniesburges, S., Koutsopoulos, A., &; Scheideler, C. (2015). A deterministic worst-case message complexity optimal solution for resource discovery. Theoretical Computer Science, 67–79.https://doi.org/10.1016/j.tcs.2014.11.027 
LibreCat: /record/327
DOI: 10.1016/j.tcs.2014.11.027

Derakhshandeh, Z., Gmyr, R., Strothmann, T. F., A. Bazzi, R., W. Richa, A., &; Scheideler, C. (2015). Leader Election and Shape Formation with Self-organizing Programmable Matter. In DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings (Vol. 9211, pp. 117--132).https://doi.org/10.1007/978-3-319-21999-8_8 
LibreCat: /record/1850
DOI: 10.1007/978-3-319-21999-8_8

Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2015). An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems. In Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015 (pp. 21:1--21:2). ACM.https://doi.org/10.1145/2800795.2800829 
LibreCat: /record/1851
DOI: 10.1145/2800795.2800829

Derakhshandeh, Z., Gmyr, R., Strothmann, T. F., A. Bazzi, R., W. Richa, A., &; Scheideler, C. (2015). Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti\rquote an, Spain, July 21 - 23, 2015 (pp. 67--69). ACM.https://doi.org/10.1145/2767386.2767451 
LibreCat: /record/1852
DOI: 10.1145/2767386.2767451

Koutsopoulos, A., Scheideler, C., &; Strothmann, T. F. (2015). Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015 (pp. 77--79). ACM.https://doi.org/10.1145/2755573.2755614 
LibreCat: /record/1853
DOI: 10.1145/2755573.2755614

Drees, M., Gmyr, R., &; Scheideler, C. (2016). Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 417--427).https://doi.org/10.1145/2935764.2935783 
LibreCat: /record/215
DOI: 10.1145/2935764.2935783

Schmid, S., Avin, C., Scheideler, C., Borokhovich, M., Haeupler, B., &; Lotker, Z. (2016). SplayNet: Towards Locally Self-Adjusting Networks. IEEE/ACM Trans. Netw., (3), 1421--1433.https://doi.org/10.1109/TNET.2015.2410313 
LibreCat: /record/1835
DOI: 10.1109/TNET.2015.2410313

Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2016). On the Runtime of Universal Coating for Programmable Matter. In DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings (Vol. 9818, pp. 148--164).https://doi.org/10.1007/978-3-319-43994-5_10 
LibreCat: /record/1836
DOI: 10.1007/978-3-319-43994-5_10

Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2016). Universal Shape Formation for Programmable Matter. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016 (pp. 289--299). ACM.https://doi.org/10.1145/2935764.2935784 
LibreCat: /record/1837
DOI: 10.1145/2935764.2935784

W. Richa, A., &; Scheideler, C. (2016). Jamming-Resistant MAC Protocols for Wireless Networks. In Encyclopedia of Algorithms (pp. 999--1002).https://doi.org/10.1007/978-1-4939-2864-4_593 
LibreCat: /record/1845
DOI: 10.1007/978-1-4939-2864-4_593

Gmyr, R., Lefèvre, J., &; Scheideler, C. (2016). Self-stabilizing Metric Graphs. In Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 248--262).https://doi.org/10.1007/978-3-319-49259-9_20 
LibreCat: /record/155
DOI: 10.1007/978-3-319-49259-9_20

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

Ogierman, A., Richa, A., Scheideler, C., Schmid, S., &; Zhang, J. (2017). Sade: competitive MAC under adversarial SINR. Distributed Computing, 31(3), 241–254.https://doi.org/10.1007/s00446-017-0307-1 
LibreCat: /record/3872
DOI: 10.1007/s00446-017-0307-1

Koutsopoulos, A., Scheideler, C., &; Strothmann, T. F. (2017). Towards a universal approach for the finite departure problem in overlay networks. Inf. Comput., 408--424.https://doi.org/10.1016/j.ic.2016.12.006 
LibreCat: /record/1812
DOI: 10.1016/j.ic.2016.12.006

P. Fekete, S., W. Richa, A., Römer, K., &; Scheideler, C. (2017). Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271. SIGACT News, (2), 87--94.https://doi.org/10.1145/3106700.3106713 
LibreCat: /record/1813
DOI: 10.1145/3106700.3106713

Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2017). Universal coating for programmable matter. Theor. Comput. Sci., 56--68.https://doi.org/10.1016/j.tcs.2016.02.039 
LibreCat: /record/1814
DOI: 10.1016/j.tcs.2016.02.039

J. Daymude, J., Gmyr, R., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2017). Improved Leader Election for Self-organizing Programmable Matter. In Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers (pp. 127--140).https://doi.org/10.1007/978-3-319-72751-6_10 
LibreCat: /record/1815
DOI: 10.1007/978-3-319-72751-6_10

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

Feldmann, M., &; Scheideler, C. (2017). A Self-Stabilizing General De Bruijn Graph. In Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 10616, pp. 250–264). Springer, Cham.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

Robinson, P., Scheideler, C., &; Setzer, A. (n.d.). Breaking the $\'4fmega(\'73qrtn)$ Barrier: Fast Consensus under a Late Adversary. In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien.https://doi.org/10.1145/3210377.3210399 
LibreCat: /record/3422
DOI: 10.1145/3210377.3210399

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

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

J. Daymude, J., Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2018). On the runtime of universal coating for programmable matter. Natural Computing, (1), 81--96.https://doi.org/10.1007/s11047-017-9658-6 
LibreCat: /record/1796
DOI: 10.1007/s11047-017-9658-6

Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., Scheideler, C., &; Strothmann, T. F. (2018). Forming Tile Shapes with Simple Robots. In Proceedings of the 24th International Conference on DNA Computing and Molecular Programming (pp. 122–138). Springer International Publishing.https://doi.org/10.1007/978-3-030-00030-1_8 
LibreCat: /record/5764
DOI: 10.1007/978-3-030-00030-1_8

Blömer, J., Bobolz, J., Scheideler, C., &; Setzer, A. (n.d.). Provably Anonymous Communication Based on Trusted Execution Environments.
LibreCat: /record/5820

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

Scheideler, C. (2018). Relays: Towards a Link Layer for Robust and Secure Fog Computing. In Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018 (pp. 1–2).https://doi.org/10.1145/3229774.3229781 
LibreCat: /record/5985
DOI: 10.1145/3229774.3229781

Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., &; Scheideler, C. (2018). Shape Recognition by a Finite Automaton Robot. In 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK (pp. 52:1-52:15).https://doi.org/10.4230/LIPIcs.MFCS.2018.52 
LibreCat: /record/5986
DOI: 10.4230/LIPIcs.MFCS.2018.52

Knollmann, T., &; Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi &; P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201). Tokyo: Springer, Cham.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, D., Kolb, C., Scheideler, C., &; Sundermeier, J. (2018). Competitive Routing in Hybrid Communication Networks. In Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Helsinki: Springer.
LibreCat: /record/4563

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

Feldmann, M., Kolb, C., &; Scheideler, C. (2018). Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201, pp. 16–31). Springer, Cham.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

Scheideler, C., &; Setzer, A. (2018). Relays: A New Approach for the Finite Departure Problem in Overlay Networks. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018). Tokyo, Japan.https://doi.org/10.1007/978-3-030-03232-6_16 
LibreCat: /record/5216
DOI: 10.1007/978-3-030-03232-6_16

Götte, T., Scheideler, C., &; Setzer, A. (2018). On Underlay-Aware Self-Stabilizing Overlay Networks. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018) (Vol. 11201, pp. 50–64). Tokyo, Japan: Springer.
LibreCat: /record/5222

Luo, L., Scheideler, C., &; Strothmann, T. F. (2019). 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.
LibreCat: /record/7636

Feldmann, M., &; Scheideler, C. (2019). 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) (pp. 287--296). ACM.https://doi.org/10.1145/3323165.3323193 
LibreCat: /record/8534
DOI: 10.1145/3323165.3323193
arXiv: 1805.03472

Augustine, J., Ghaffari, M., Gmyr, R., Hinnenthal, K., Kuhn, F., Li, J., &; Scheideler, C. (2019). Distributed Computation in Node-Capacitated Networks. In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (pp. 69--79). ACM.https://doi.org/10.1145/3323165.3323195 
LibreCat: /record/8871
DOI: 10.1145/3323165.3323195

Daymude, J. J., Hinnenthal, K., Richa, A. W., &; Scheideler, C. (2019). Computing by Programmable Particles. In Distributed Computing by Mobile Entities, Current Research in Moving and Computing. (pp. 615–681). Springer, Cham.https://doi.org/10.1007/978-3-030-11072-7_22 
LibreCat: /record/9599
DOI: https://doi.org/10.1007/978-3-030-11072-7_22

Götte, T., Vijayalakshmi, V. R., &; Scheideler, C. (n.d.). Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary. In Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19). Rio de Janeiro, Brazil: IEEE.
LibreCat: /record/6976

Scheideler, C., &; Setzer, A. (2019). On the Complexity of Local Graph Transformations. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (Vol. 132, pp. 150:1--150:14). Patras, Greece: Dagstuhl Publishing.https://doi.org/10.4230/LIPICS.ICALP.2019.150 
LibreCat: /record/10586
DOI: 10.4230/LIPICS.ICALP.2019.150

Götte, T., Hinnenthal, K., &; Scheideler, C. (2019). Faster Construction of Overlay Networks. In Structural Information and Communication Complexity. Cham.https://doi.org/10.1007/978-3-030-24922-9_18 
LibreCat: /record/12944
DOI: 10.1007/978-3-030-24922-9_18

Augustine, J., Hinnenthal, K., Kuhn, F., Scheideler, C., &; Schneider, P. (2019). Shortest Paths in a Hybrid Network Model. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1280–1299). Philadelphia, PA.https://doi.org/10.1137/1.9781611975994.78 
LibreCat: /record/15627
DOI: 10.1137/1.9781611975994.78

Gmyr, R., Lefevre, J., &; Scheideler, C. (2019). Self-Stabilizing Metric Graphs. Theory Comput. Syst., 63(2), 177–199.https://doi.org/10.1007/s00224-017-9823-4 
LibreCat: /record/14830
DOI: 10.1007/s00224-017-9823-4

Castenow, J., Kolb, C., &; Scheideler, C. (2019). 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) (pp. 345–348). L’Aquila, Italy.https://doi.org/10.1007/978-3-030-24922-9‑26 
LibreCat: /record/14539
DOI: 10.1007/978-3-030-24922-9‑26

Feldmann, M., Götte, T., &; Scheideler, C. (2019). 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) (pp. 149–164). Springer, Cham.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