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

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

Gehweiler, J., &; Schomaker, G. (2006). 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) (pp. 51–58).https://doi.org/10.1109/ds-rt.2006.15 

Faigle, U., &; Frahling, G. (2006). A combinatorial algorithm for weighted stable sets in bipartite graphs. Discrete Applied Mathematics, 1380–1391.https://doi.org/10.1016/j.dam.2005.05.037 

Frahling, G., &; Sohler, C. (2006). A fast k-means implementation using coresets. In Proceedings of the twenty-second annual symposium on Computational geometry  - SCG ’06.https://doi.org/10.1145/1137856.1137879 

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

Schindelhauer, C., Volbert, K., &; Ziegler, M. (2006). Geometric spanners with applications in wireless networks. Computational Geometry, 197–214.https://doi.org/10.1016/j.comgeo.2006.02.001 

Ziegler, M. (2006). Effectively open real functions. Journal of Complexity, 827–849.https://doi.org/10.1016/j.jco.2006.05.002 

Meer, K., &; Ziegler, M. (2006). Uncomputability Below the Real Halting Problem. In Logical Approaches to Computational Barriers. Berlin, Heidelberg.https://doi.org/10.1007/11780342_39 

Dangelmaier, W., Huber, D., Laroque, C., Aufenanger, M., Fischer, M., Krokowski, J., &; Kortenjan, M. (2006). d<sup>3</sup>FACT insight goes parallel - Aggregation of multiple simulations. In Simulation and Visualization 2006 (SimViS) (pp. 79–88). SCS European Publishing House.

Sohler, C., &; Czumaj, A. (2006). Sublinear-time Algorithms. EATCS Bulletin, (89), 23--47.

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

Demaine, E. D., Meyer auf der Heide, F., Pagh, R., &; Petrafcu, M. (2006). De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space). In LATIN 2006: Theoretical Informatics. Berlin, Heidelberg.https://doi.org/10.1007/11682462_34 

Dynia, M., Kutyowski, J., Meyer auf der Heide, F., &; Schindelhauer, C. (2006). Smart Robot Teams Exploring Sparse Trees. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/11821069_29 

Dynia, M., Kutyowski, J., Lorek, P., &; Meyer auf der Heide, F. (2006). Maintaining Communication Between an Explorer and a Base Station. In IFIP International Federation for Information Processing. Boston, MA.https://doi.org/10.1007/978-0-387-34733-2_14 

Dynia, M., Kuhmlehn, A., Kutylowski, J., Meyer auf der Heide, F., &; Schindelhauer, C. (2006). SmartS Simulator Design.

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

Mahlmann, P., &; Schindelhauer, C. (2005). 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.https://doi.org/10.1145/1073970.1073992 

Rührup, S., &; Schindelhauer, C. (2005). Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure. 19th IEEE International Parallel and Distributed Processing Symposium, 248.https://doi.org/10.1109/ipdps.2005.147 

Rührup, S., Schindelhauer, C., &; Volbert, K. (2005). 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) (Vol. 3738, pp. 244–257).https://doi.org/10.1007/11561354_21