Meyer auf der Heide, Friedhelm, and Barbara Schneider. “Local Strategies for Connecting Stations by Small Robotic Networks.”10.1007/978-0-387-09655-1_9__Biologically-Inspired Collaborative Computing, 2008, doi:10.1007/978-0-387-09655-1_9.

Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing Oder eWie Bekomme Ich Die Klamotten in Die Kisten?“.”10.1007/978-3-540-76394-9_40__Taschenbuch Der Algorithmen, 2008, doi:10.1007/978-3-540-76394-9_40.

Fischer, Matthias, et al. “Planar Visibility Counting.” ArXiv:0810.0052, 2008.

Meyer auf der Heide, Friedhelm, and Nir Shavit, editors. Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’08. ACM, 2008, doi:10.1145/1378533.

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

Bonorden, Olaf. “Load Balancing in the Bulk-Synchronous-Parallel Setting Using Process Migrations.”10.1109/ipdps.2007.370330__2007 IEEE International Parallel and Distributed Processing Symposium, 2007, doi:10.1109/ipdps.2007.370330.

Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning for Wireless Robots.”10.1007/s11036-008-0150-5__ROBOCOMM’07: Proc. of the 1st International Conference on Robot Communication and Coordination, 2007, pp. 309–21, doi:10.1007/s11036-008-0150-5.

Schomaker, Gunnar. “DHHT-RAID: A Distributed Heterogeneous Scalable Architecture for Dynamic Storage Environments.”10.1109/aina.2007.59__Advanced Information Networking and Applications (AINA-07), vol. 21, 2007, pp. 331–39, doi:10.1109/aina.2007.59.

Bienkowski, Marcin, and Jarosaw Kutyowski. “The K-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces.”10.1007/978-3-540-73951-7_30__Lecture Notes in Computer Science, 2007, doi:10.1007/978-3-540-73951-7_30.

Mahlmann, Peter, and Christian Schindelhauer. Peer-to-Peer-Netzwerke. Springer, 2007, doi:10.1007/978-3-540-33992-2.

Leonardi, Stefano, et al. “Guarding Our Digital Society’s Well-Being.” E-Strategies, Www.Britishpublishers.Com, vol. 3-10–2007, 2007.

Dynia, Miroslaw, et al. “Why Robots Need Maps.”10.1007/978-3-540-72951-8_5__Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO), 2007, pp. 37-- 46, doi:10.1007/978-3-540-72951-8_5.

Dynia, Miroslaw, et al. “Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs.”10.1007/978-3-540-69507-3_21__Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07), vol. 4362, 2007, pp. 260--271, doi:10.1007/978-3-540-69507-3_21.

Kutylowski, Jaroslaw. Using Mobile Relays for Ensuring Connectivity in Sparse Networks. 2007.

Kutylowski, Jaroslaw. Competitive Maintenance of Minimum Spanning Trees under Stochastic Adversaries. 2007.

Dorigo, Marco, et al. “Orientation in a Trail Network by Exploiting Its Geometry for Swarm Robotics.”10.1109/SIS.2007.367953__IEEE Swarm Intelligence Symposium, Honolulu, USA, April 1-5, IEEE Press, 2007, pp. 310--315, doi:10.1109/SIS.2007.367953.

Hamann, Heiko, et al. “An Analytical and Spatial Model of Foraging in a Swarm of Robots.”10.1007/978-3-540-71541-2_4__Swarm Robotics - Second SAB 2006 International Workshop, vol. 4433, 2007, pp. 43--55, doi:10.1007/978-3-540-71541-2_4.

Hamann, Heiko, and Heinz Wörn. “A Space- and Time-Continuous Model of Self-Organizing Robot Swarms for Design Support.”10.1109/saso.2007.3__First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007), 2007, pp. 23--31, doi:10.1109/saso.2007.3.

Hamann, Heiko, et al. “Embodied Computation.” Parallel Processing Letters, vol. 17, no. 3, 2007, pp. 287--298.

Hamann, Heiko, et al. “From Micro to Nano and Swarm Robotics.”10.1142/9789812770189_0003__Advances in Climbing and Walking Robots. Proceedings of 10th International Conference (CLAWAR’07), Singapore, July 16-18, 2007, pp. 15--24, doi:10.1142/9789812770189_0003.