F. Meyer auf der Heide and B. Schneider, “Local Strategies for Connecting Stations by Small Robotic Networks,” in Biologically-Inspired Collaborative Computing, Boston, MA, 2008.

J. Gehweiler and F. Meyer auf der Heide, “Bin Packing oder eWie bekomme ich die Klamotten in die Kisten?“,” in Taschenbuch der Algorithmen, Berlin, Heidelberg, 2008.

M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, and M. Ziegler, “Planar Visibility Counting,” arXiv:0810.0052. 2008.

F. Meyer auf der Heide and N. Shavit, Eds., Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA ’08. ACM, 2008.

P. Briest and P. Krysta, “Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing,” in Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007.

O. Bonorden, “Load Balancing in the Bulk-Synchronous-Parallel Setting using Process Migrations,” in 2007 IEEE International Parallel and Distributed Processing Symposium, 2007.

C. C. Ooi and C. Schindelhauer, “Minimal Energy Path Planning for Wireless Robots,” in ROBOCOMM’07: Proc. of the 1st International Conference on Robot Communication and Coordination, 2007, pp. 309–321.

G. Schomaker, “DHHT-RAID: A Distributed Heterogeneous Scalable Architecture for Dynamic Storage Environments,” in Advanced Information Networking and Applications (AINA-07), 2007, vol. 21, pp. 331–339.

M. Bienkowski and J. Kutyowski, “The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces,”10.1007/978-3-540-73951-7_30__2007, doi:10.1007/978-3-540-73951-7_30 .

P. Mahlmann and C. Schindelhauer, Peer-to-Peer-Netzwerke. Berlin: Springer, 2007.