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 

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 

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 

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.

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 

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 

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 

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 

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 

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