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

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

Planar Visibility Counting
M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, M. Ziegler, ArXiv:0810.0052 (2008).

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA 
F. Meyer auf der Heide, N. Shavit, eds., Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’08, ACM, 2008.

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

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

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

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

The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces
M. Bienkowski, J. Kutyowski, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.

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

Guarding our digital society's well-being
S. Leonardi, P. Mahlmann, F. Meyer auf der Heide, P.G. Spirakis, G. Weikum, E-Strategies, Www.Britishpublishers.Com 3-10–2007 (2007).

Why Robots Need Maps
M. Dynia, J. opuszaski, C. Schindelhauer, in: Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO), 2007, pp. 37-- 46.

Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
M. Dynia, M. Korzeniowski, J. Kutyowski, in: Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07), 2007, pp. 260--271.

Using Mobile Relays for Ensuring Connectivity in Sparse Networks
J. Kutylowski, Using Mobile Relays for Ensuring Connectivity in Sparse Networks, Universität Paderborn, 2007.

Competitive Maintenance of Minimum Spanning Trees under Stochastic Adversaries
J. Kutylowski, (2007).

Orientation in a Trail Network by Exploiting its Geometry for Swarm Robotics
M. Dorigo, H. Hamann, M. Szymanski, H. Wörn, Y. Shi, in: IEEE Swarm Intelligence Symposium, Honolulu, USA, April 1-5, IEEE Press, 2007, pp. 310--315.

An analytical and spatial model of foraging in a swarm of robots
H. Hamann, H. Wörn, E. Sahin, W. Spears, W. Winfield, in: Swarm Robotics - Second SAB 2006 International Workshop, 2007, pp. 43--55.

A Space- and Time-Continuous Model of Self-Organizing Robot Swarms for Design Support
H. Hamann, H. Wörn, in: First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007), 2007, pp. 23--31.

Embodied Computation
H. Hamann, H. Wörn, M. Nagy, N. Nagy, Parallel Processing Letters 17 (2007) 287--298.

From Micro to Nano and Swarm Robotics
H. Hamann, M. Szymanski, H. Wörn, R. Estana, M. Xie, S. Dubowsky, in: Advances in Climbing and Walking Robots. Proceedings of 10th International Conference (CLAWAR’07), Singapore, July 16-18, 2007, pp. 15--24.