V. Damerow, Average and Smoothed Complexity of Geometric Structures, vol. 190. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.

O. Bonorden, F. Meyer auf der Heide, and J. Gehweiler, “A Web Computing Environment for Parallel Algorithms in Java,” in Journal on Scalable Computing: Practice and Experience, 2006, pp. 1–14.

J. Gehweiler and G. Schomaker, “Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries,” in Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT), 2006, pp. 51–58.

U. Faigle and G. Frahling, “A combinatorial algorithm for weighted stable sets in bipartite graphs,” Discrete Applied Mathematics, pp. 1380–1391, 2006.

G. Frahling and C. Sohler, “A fast k-means implementation using coresets,” in Proceedings of the twenty-second annual symposium on Computational geometry  - SCG ’06, 2006.

H. Hamann, Modeling and Investigation of Robot Swarms. 2006.

C. Schindelhauer, K. Volbert, and M. Ziegler, “Geometric spanners with applications in wireless networks,” Computational Geometry, pp. 197–214, 2006.

M. Ziegler, “Effectively open real functions,” Journal of Complexity, pp. 827–849, 2006.

K. Meer and M. Ziegler, “Uncomputability Below the Real Halting Problem,” in Logical Approaches to Computational Barriers, Berlin, Heidelberg, 2006.

W. Dangelmaier et al., <sup>3</sup>FACT insight goes parallel - Aggregation of multiple simulations,” in Simulation and Visualization 2006 (SimViS), 2006, pp. 79–88.

C. Sohler and A. Czumaj, “Sublinear-time Algorithms,” EATCS Bulletin, no. 89, pp. 23--47, 2006.

O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, and B. Rehberg, “Efficient Parallel Algorithms,” in Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel &; Distributed Computing, 2006, vol. 181, pp. 137–153.

E. D. Demaine, F. Meyer auf der Heide, R. Pagh, and M. Petrafcu, “De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space),” in LATIN 2006: Theoretical Informatics, Berlin, Heidelberg, 2006.

M. Dynia, J. Kutyowski, F. Meyer auf der Heide, and C. Schindelhauer, “Smart Robot Teams Exploring Sparse Trees,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2006.

M. Dynia, J. Kutyowski, P. Lorek, and F. Meyer auf der Heide, “Maintaining Communication Between an Explorer and a Base Station,” in IFIP International Federation for Information Processing, Boston, MA, 2006.

M. Dynia, A. Kuhmlehn, J. Kutylowski, F. Meyer auf der Heide, and C. Schindelhauer, SmartS Simulator Design. 2006.

K. Volbert, Geometric Spanners for Topology Control in Wireless Networks, vol. 168. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.

P. Mahlmann and C. Schindelhauer, “Peer-to-peer networks based on random transformations of connected regular undirected graphs,” in Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures  - SPAA’05, 2005.

S. Rührup and C. Schindelhauer, “Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure,”10.1109/ipdps.2005.147__in 19th IEEE International Parallel and Distributed Processing Symposium, 2005, p. 248, doi:10.1109/ipdps.2005.147 .

S. Rührup, C. Schindelhauer, and K. Volbert, “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks,” in Proc. of 4th International Conference on Ad-Hoc, Mobile &; Wireless Networks (ADHOC-NOW 2005), 2005, vol. 3738, pp. 244–257.