J. Gehweiler, C. Lammersen, and B. Degener, “The Kinetic Facility Location Problem,” in Proceedings of the 24th European Workshop on Computational Geometry, 2008, pp. 251–254.

M. Mense and C. Scheideler, “SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems,” in Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, 2008, pp. 1135--1144.

H. Hamann and H. Wörn, “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem,” in The tenth International Conference on Simulation of Adaptive Behavior (SAB’08), 2008, vol. 5040, pp. 447--456.

H. Hamann, T. Schmickl, H. Wörn, and K. Crailsheim, “Spatial Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm,” in IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS’08), 2008, pp. 1415--1420.

H. Hamann and H. Wörn, “A framework of space–time continuous models for algorithm design in swarm robotics,” Swarm Intelligence, vol. 2, no. 2–4, pp. 209–239, 2008.

K. Lürwer-Brüggemeier and M. Ziegler, “On Faster Integer Calculations Using Non-arithmetic Primitives,” in Unconventional Computing, Berlin, Heidelberg, 2008.

C. Laroque, M. Fischer, W. Dangelmaier, and B. Eikel, “Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations,” in Industrial Simulation Conference (ISC 2008), 2008, pp. 306–310.

C. Laroque, M. Fischer, and B. Eikel, “Regelung von Animationen in Simulationen von  hochdynamischen Fabrikszenen ,” in Augmented &; Virtual Reality in der Produktentstehung, 2008, vol. 232, pp. 193--206.

S. Le Roux and M. Ziegler, “Singular Coverings and Non-Uniform Notions of Closed Set Computability,”10.1016/j.entcs.2008.03.009__Electronic Notes in Theoretical Computer Science, pp. 73–88, 2008, doi:10.1016/j.entcs.2008.03.009 .

H. Ackermann, P. Briest, A. Fanghänel, and B. Vöcking, “Who Should Pay for Forwarding Packets?,” Internet Mathematics, vol. 5, no. 4, pp. 459–475, 2008.

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.