Feldotto, Matthias. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn, 2013.

Graffi, Kalman, and Vitaly Rapp. “Continuous Gossip-Based Aggregation through Dynamic Information Aging.”https://doi.org/10.1109/ICCCN.2013.6614118__In Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13), 1–7, 2013.https://doi.org/10.1109/ICCCN.2013.6614118 .

Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System.”https://doi.org/10.1007/978-3-642-41527-2_37__In Proceedings of the 27th International Symposium on Distributed Computing (DISC), 537–49. LNCS, 2013.https://doi.org/10.1007/978-3-642-41527-2_37 .

Feldotto, Matthias, and Kalman Graffi. “Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.”https://doi.org/10.1109/HPCSim.2013.6641399__In Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13), 99–106, 2013.https://doi.org/10.1109/HPCSim.2013.6641399 .

Graffi, Kalman, Markus Benter, Mohammad Divband, Sebastian Kniesburges, and Andreas Koutsopoulos. “Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord Overlay Network.”https://doi.org/10.1109/NetSys.2013.11__In Proceedings of the Conference on Networked Systems (NetSys), 27–34, 2013.https://doi.org/10.1109/NetSys.2013.11 .

Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks.”https://doi.org/10.1109/P2P.2013.6688720__In Proceedings of the International Conference on Peer-to-Peer Computing (P’13), 1–5, 2013.https://doi.org/10.1109/P2P.2013.6688720 .

Setzer, Alexander. Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs. Universität Paderborn, 2013.

Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables.”https://doi.org/10.1109/NetSys.2013.9__In Proceedings of the Conference on Networked Systems (NetSys), 35–42, 2013.https://doi.org/10.1109/NetSys.2013.9 .

Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.”https://doi.org/10.1007/978-3-319-03578-9_14__In Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO), 165–76. Lecture Notes in Computer Science, 2013.https://doi.org/10.1007/978-3-319-03578-9_14 .

Dolev, Shlomi, and Christian Scheideler. “Editorial for Algorithmic Aspects of Wireless Sensor Networks.”https://doi.org/10.1016/j.tcs.2012.07.012__Theor. Comput. Sci., 2012, 1.https://doi.org/10.1016/j.tcs.2012.07.012 .