Gehweiler, J., &; Meyerhenke, H. (2010). On Dynamic Graph Partitioning and Graph Clustering using Diffusion. In Dagstuhl Seminar Proceedings 10261: Algorithm Engineering.

Thies, M., &; Gehweiler, J. (2010). Thread Migration and Checkpointing in Java.

Kernbach, S., Schmickl, T., Hamann, H., Stradner, J., Schlachter, F., Schwarzer, C. s. F.,  Matthias, R. (2010). Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics. In Artificial Life XII (ALife XII) (pp. 781–788). MIT Press.

Briest, P., Chalermsook, P., Khanna, S., Laekhanukit, B., &; Nanongkai, D. (2010). Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. In Workshop on Internet and Network Economics (WINE).https://doi.org/10.1007/978-3-642-17572-5_37 

Meyer auf der Heide, F., &; Scheideler, C. (2010). Algorithmische Grundlagen verteilter Speichersysteme. Informatik Spektrum, (5), 468--474.https://doi.org/10.1007/s00287-010-0470-2 

Briest, P., Chawla, S., Kleinberg, R., &; Weinberg, S. M. (2010). Pricing Randomized Allocations. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms.https://doi.org/10.1137/1.9781611973075.49 

Mahlmann, P. (2010). Peer-to-peer networks based on random graphs (Vol. 283). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Degener, B. (2010). Local, distributed approximation algorithms for geometric assignment problems (Vol. 278). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Fischer, M., Jähn, C., &; Suess, T. (2010). Asynchronous Parallel Reliefboard Computation for Scene Object Approximation. Eurographics Symposium on Parallel Graphics and Visualization (EGPGV), 43–51.https://doi.org/10.2312/EGPGV/EGPGV10/043-051 

Suess, T., Wiesemann, T., &; Fischer, M. (2010). Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments. 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage, 448–456.https://doi.org/10.1109/nas.2010.52