Sohler C, Lammersen C. StrSort Algorithms for Geometric Problems. In: Proceedings of the 23rd European Workshop on Computational Geometry (EWCG). ; 2007:69-72.

Sohler C, Czumaj A. Testing Expansion in Bounded-Degree Graphs. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS). ; 2007:570-578.

Sohler C, Czumaj A. 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:536-548.

Sohler C, Czumaj A. Sublinear-time approximation algorithms for clustering via random sampling. Random Structures &; Algorithms. 2007;30(1-2):226-- 256.

Sohler C, Monemizahdeh M, Feldman D. A PTAS for k-means clustering based on weak coresets. In: Proceedings of the 23rd Annual Symposium on Computational Geometry (SoCG’07). ; 2007:11-18.

Sohler C, Czumaj A, Frahling G. Efficient kinetic data structures for MaxCut. In: Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG). ; 2007:157-160.

Brinkmann A, Effert S, Meyer auf der Heide F, Scheideler C. Dynamic and redundant data placement. In: IEEE International Conference on Distributed Computing Systems (ICDCS). ; 2007.

Arens S, Buss A, Deck H, 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. Buenos Aires, Argentina: Heinz Nixdorf Institut, University of Paderborn; 2007:215-222.

Dynia M, Kutylowski J, Meyer auf der Heide F, Schrieb J. 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. doi:10.1145/1248377.1248420

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

Rührup S. Position-Based Routing Strategies. Vol 203. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006.

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

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

Degener B. Die Analyse von Estimation-of-Distribution-Algorithmen Auf Ausgewählten Funktionen.; 2006.

Mahlmann P, Schindelhauer C. 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:308--317. doi:10.1145/1148109.1148162

Rührup S, Schindelhauer C. Online Multi-path Routing in a Maze. In: Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006). ; 2006. doi:10.1007/11940128_65

Schindelhauer C, Schomaker G. SAN Optimal Multi Parameter Access Scheme. In: 5th International Conference on Networking (ICN). ; 2006. doi:10.1109/icniconsmcl.2006.190

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

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

Brinkmann A, Effert S, Heidebuer M, Vodisek M. Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments. In: 5th International Conference on Networking (ICN). ; 2006. doi:10.1109/icniconsmcl.2006.182