C. Sohler and C. Lammersen, “StrSort Algorithms for Geometric Problems,” in Proceedings of the 23rd European Workshop on Computational Geometry (EWCG), 2007, pp. 69–72.

C. Sohler and A. Czumaj, “Testing Expansion in Bounded-Degree Graphs,” in Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2007, pp. 570–578.

C. Sohler and A. Czumaj, “Small Space Representations for Metric Min-Sum k-Clustering and their Applications,” in Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07), 2007, pp. 536–548.

C. Sohler and A. Czumaj, “Sublinear-time approximation algorithms for clustering via random sampling,” Random Structures &; Algorithms, vol. 30, no. 1–2, pp. 226-- 256, 2007.

C. Sohler, M. Monemizahdeh, and D. Feldman, “A PTAS for k-means clustering based on weak coresets,” in Proceedings of the 23rd annual symposium on computational geometry (SoCG’07), 2007, pp. 11–18.

C. Sohler, A. Czumaj, and G. Frahling, “Efficient kinetic data structures for MaxCut,” in Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG), 2007, pp. 157–160.

A. Brinkmann, S. Effert, F. Meyer auf der Heide, and C. Scheideler, “Dynamic and redundant data placement,” 2007.

S. Arens et al., “Smart Teams: Simulating Large Robotic Swarms in Vast Environments,” in Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment, 2007, pp. 215–222.

M. Dynia, J. Kutylowski, F. Meyer auf der Heide, and J. Schrieb, “Local strategies for maintaining a chain of relay stations between an explorer and a base station,” in Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’07, 2007.

J. Klein, Efficient Collision Detection for Point and Polygon Based Models, vol. 186. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.

S. Rührup, Position-based Routing Strategies, vol. 203. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.

P. Briest and P. Krysta, “Single-Minded Unlimited Supply Pricing on Sparse Instances,” in Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006.

P. Briest and C. Gunia, “Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels,” in Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC), 2006.

B. Degener, Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen. 2006.

P. Mahlmann and C. Schindelhauer, “Distributed random digraph transformations for peer-to-peer networks,” in Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA ’06, 2006, pp. 308--317.

S. Rührup and C. Schindelhauer, “Online Multi-path Routing in a Maze,” in Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006.

C. Schindelhauer and G. Schomaker, “SAN Optimal Multi Parameter Access Scheme,”10.1109/icniconsmcl.2006.190__2006, doi:10.1109/icniconsmcl.2006.190 .

S. Rührup and C. Schindelhauer, Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks. Universität Paderborn, 2006.

G. Schomaker, C. Loeser, and M. Schubert, “Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks,” in 5th International Conference on Networking (ICN)., 2006.

A. Brinkmann, S. Effert, M. Heidebuer, and M. Vodisek, “Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments,”10.1109/icniconsmcl.2006.182__2006, doi:10.1109/icniconsmcl.2006.182 .