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

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

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

Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation Algorithms for Clustering via Random Sampling.” Random Structures &; Algorithms, vol. 30, no. 1–2, 2007, pp. 226-- 256.

Sohler, Christian, et al. “A PTAS for K-Means Clustering Based on Weak Coresets.” Proceedings of the 23rd Annual Symposium on Computational Geometry (SoCG’07), 2007, pp. 11–18.

Sohler, Christian, et al. “Efficient Kinetic Data Structures for MaxCut.” Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG), 2007, pp. 157–60.

Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.

Arens, Stephan, et al. “Smart Teams: Simulating Large Robotic Swarms in Vast Environments.” Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment, Heinz Nixdorf Institut, University of Paderborn, 2007, pp. 215–22.

Dynia, Miroslaw, et al. “Local Strategies for Maintaining a Chain of Relay Stations between an Explorer and a Base Station.”10.1145/1248377.1248420__Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’07, 2007, doi:10.1145/1248377.1248420.

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

Rührup, Stefan. Position-Based Routing Strategies. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.

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

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

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

Mahlmann, Peter, and Christian Schindelhauer. “Distributed Random Digraph Transformations for Peer-to-Peer Networks.”10.1145/1148109.1148162__Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’06, 2006, pp. 308--317, doi:10.1145/1148109.1148162.

Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing in a Maze.”10.1007/11940128_65__Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006, doi:10.1007/11940128_65.

Schindelhauer, Christian, and Gunnar Schomaker. “SAN Optimal Multi Parameter Access Scheme.”10.1109/icniconsmcl.2006.190__5th International Conference on Networking (ICN), 2006, doi:10.1109/icniconsmcl.2006.190.

Rührup, Stefan, and Christian Schindelhauer. Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks. 2006.

Schomaker, Gunnar, et al. “Predictive Replication and Placement Strategies for Movie Documents in Heterogeneous Content Delivery Networks.” 5th International Conference on Networking (ICN)., 2006.

Brinkmann, Andre, et al. “Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments.”10.1109/icniconsmcl.2006.182__5th International Conference on Networking (ICN), 2006, doi:10.1109/icniconsmcl.2006.182.

Kortenjan, Michael, and Gunnar Schomaker. “Size Equivalent Cluster Trees (SEC-Trees) Realtime Rendering of Large Industrial Scenes.”10.1145/1108590.1108608__4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006), 2006, doi:10.1145/1108590.1108608.

Kutyowski, Jarosaw, and Filip Zagórski. “Reliable Broadcasting Without Collision Detection.”10.1007/11611257_37__SOFSEM 2006: Theory and Practice of Computer Science, 2006, doi:10.1007/11611257_37.

Brinkmann, Andre, et al. “Influence of Adaptive Data Layouts on Performance in Dynamically Changing Storage Environments.”10.1109/pdp.2006.44__14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06), 2006, doi:10.1109/pdp.2006.44.

Rammig, Franz-Josef, et al., editors. Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems. Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006.

Monien, Burkhard, and Friedhelm Meyer auf der Heide. New Trends in Parallel and Distributed Computing. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.

Grünewald, Matthias, et al. “Directional Communication in Mobile Ad Hoc Networks.” New Trends in Parallel &; Distributed Computing, 6th Int. Heinz Nixdorf Symposium, Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006, pp. 225–34.

Sohler, Christian, et al. “Computing Clustering Coefficients in Data Streams.” Proceedings of  the European Conference on Complex Systems (ECCS’06), 2006.

Sohler, Christian, et al. Counting Triangles in Data Streams. Edited by Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS), 2006.

Sohler, Christian, et al. “A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem.” Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2006.

Dynia, Miroslaw, et al. “Power-Aware Collective Tree Exploration.”10.1007/11682127_24__Architecture of Computing Systems - ARCS, no. 3894, 2006, pp. 341--351, doi:10.1007/11682127_24.

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

Bonorden, Olaf, et al. “A Web Computing Environment for Parallel Algorithms in Java.” Journal on Scalable Computing: Practice and Experience, 2006, pp. 1–14.

Gehweiler, Joachim, and Gunnar Schomaker. “Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries.”10.1109/ds-rt.2006.15__Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT), 2006, pp. 51–58, doi:10.1109/ds-rt.2006.15.

Faigle, Ulrich, and Gereon Frahling. “A Combinatorial Algorithm for Weighted Stable Sets in Bipartite Graphs.”10.1016/j.dam.2005.05.037__Discrete Applied Mathematics, 2006, pp. 1380–91, doi:10.1016/j.dam.2005.05.037.

Frahling, Gereon, and Christian Sohler. “A Fast K-Means Implementation Using Coresets.”10.1145/1137856.1137879__Proceedings of the Twenty-Second Annual Symposium on Computational Geometry  - SCG ’06, 2006, doi:10.1145/1137856.1137879.

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

Schindelhauer, Christian, et al. “Geometric Spanners with Applications in Wireless Networks.”10.1016/j.comgeo.2006.02.001__Computational Geometry, 2006, pp. 197–214, doi:10.1016/j.comgeo.2006.02.001.

Ziegler, Martin. “Effectively Open Real Functions.”10.1016/j.jco.2006.05.002__Journal of Complexity, 2006, pp. 827–49, doi:10.1016/j.jco.2006.05.002.

Meer, Klaus, and Martin Ziegler. “Uncomputability Below the Real Halting Problem.”10.1007/11780342_39__Logical Approaches to Computational Barriers, 2006, doi:10.1007/11780342_39.

Dangelmaier, Wilhelm, et al. “D<sup>3</sup>FACT Insight Goes Parallel - Aggregation of Multiple Simulations.” Simulation and Visualization 2006 (SimViS), SCS European Publishing House, 2006, pp. 79–88.

Sohler, Christian, and Artur Czumaj. “Sublinear-Time Algorithms.” EATCS Bulletin, no. 89, 2006, pp. 23--47.

Bonorden, Olaf, et al. “Efficient Parallel Algorithms.” Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel &; Distributed Computing, vol. 181, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006, pp. 137–53.

Demaine, Erik D., et al. “De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space).”10.1007/11682462_34__LATIN 2006: Theoretical Informatics, 2006, doi:10.1007/11682462_34.

Dynia, M., et al. “Smart Robot Teams Exploring Sparse Trees.”10.1007/11821069_29__Lecture Notes in Computer Science, 2006, doi:10.1007/11821069_29.

Dynia, Miroslaw, et al. “Maintaining Communication Between an Explorer and a Base Station.”10.1007/978-0-387-34733-2_14__IFIP International Federation for Information Processing, 2006, doi:10.1007/978-0-387-34733-2_14.

Dynia, Miroslaw, et al. SmartS Simulator Design. 2006.

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

Mahlmann, Peter, and Christian Schindelhauer. “Peer-to-Peer Networks Based on Random Transformations of Connected Regular Undirected Graphs.”10.1145/1073970.1073992__Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05, 2005, doi:10.1145/1073970.1073992.

Rührup, Stefan, and Christian Schindelhauer. “Competitive Time and Traffic Analysis of Position-Based Routing Using a Cell Structure.”10.1109/ipdps.2005.147__19th IEEE International Parallel and Distributed Processing Symposium, 2005, p. 248, doi:10.1109/ipdps.2005.147.

Rührup, Stefan, et al. “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks.”10.1007/11561354_21__Proc. of 4th International Conference on Ad-Hoc, Mobile &; Wireless Networks (ADHOC-NOW 2005), vol. 3738, 2005, pp. 244–57, doi:10.1007/11561354_21.

Schindelhauer, Christian, and Kerstin Voß. “Probability Distributions for Channel Utilisation.”10.1007/11561354_23__Proc. of 4th International Conference on Ad-Hoc Networks &; Wireless (ADHOC-NOW 2005), 2005, pp. 271–84, doi:10.1007/11561354_23.

Schindelhauer, Christian, et al. “Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search.” European Conference on Complex Systems (ECCS 2005), 2005.

Brinkmann, André, et al. “Distributed MD.” In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 81–88.

Brinkmann, André, et al. “An Integrated Architecture for Business Intelligence Support from Application down to Storage.” In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 1–8.

Klein, Jan, and Gabriel Zachmann. “The Expected Running Time of Hierarchical Collision Detection.”10.1145/1186954.1187087__ACM SIGGRAPH 2005 Posters on 10.1145/1186954.1187087__- SIGGRAPH ’05, 2005, doi:10.1145/1186954.1187087.

Klein, Jan, and Gabriel Zachmann. “Interpolation Search for Point Cloud Intersection.”10.1145/1186223.1186329__Proceedings of the 13-Th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005), 2005, pp. 163–70, doi:10.1145/1186223.1186329.

Loeser, Chris, et al. “Content Distribution in Heterogenous Video-on-Demand P Networks with ARIMA Forecasts.”10.1007/978-3-540-31957-3_90__Proceedings of the 4th International Conference on Networking, vol. 3421, 2005, pp. 800–10, doi:10.1007/978-3-540-31957-3_90.

Ziegler, Martin, and Benno Fuchssteiner. “Nonlinear Reformulation of Heisenberg’s Dynamics.”10.1007/s10773-005-7048-9__International Journal of Theoretical Physics, 2005, pp. 693–717, doi:10.1007/s10773-005-7048-9.

Schindelhauer, Christian, and Gunnar Schomaker. “Weighted Distributed Hash Tables.”10.1145/1073970.1074008__SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, Nevada, USA, 2005, doi:10.1145/1073970.1074008.

Rührup, Stefan, and Christian Schindelhauer. “Online Routing in Faulty Meshes with Sub-Linear Comparative Time and Traffic Ratio.”10.1007/11561071_5__Algorithms – ESA 2005, 2005, doi:10.1007/11561071_5.

Fischer, Matthias. Design, Analysis, and Evaluation of a Data Structure for Distributed Virtual Environments. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.

Dangelmaier, Wilhelm, et al. “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation.”10.1016/j.compind.2005.01.007__Computers in Industry, 2005, pp. 371–83, doi:10.1016/j.compind.2005.01.007.

Fischer, Matthias, et al. “Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations.”10.1109/wsc.2005.1574470__Proceedings of the Winter Simulation Conference, 2005, doi:10.1109/wsc.2005.1574470.

Czumaj, Artur, and Christian Sohler. “Abstract Combinatorial Programs and Efficient Property Testers.”10.1137/s009753970444199x__SIAM Journal on Computing, vol. 34, no. 3, 2005, pp. 580–615, doi:10.1137/s009753970444199x.

Bdoiu, Mihai, et al. “Facility Location in Sublinear Time.”10.1007/11523468_70__Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 2005, pp. 866–77, doi:10.1007/11523468_70.

Sohler, Christian, and Gereon Frahling. “Coresets in Dynamic Geometric Data Streams.” Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), 2005, pp. 209–17.

Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Colorability.”10.1016/j.tcs.2004.09.031__Theoretical Computer Science, vol. 331, no. 1, 2005, pp. 37–52, doi:10.1016/j.tcs.2004.09.031.

Czumaj, Artur, et al. “Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time.”10.1137/s0097539703435297__SIAM Journal on Computing, vol. 35, no. 1, 2005, pp. 91–109, doi:10.1137/s0097539703435297.

Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.”10.1007/11561071_67__Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669, Springer, 2005, pp. 758–69, doi:10.1007/11561071_67.

Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.”10.1007/11549468_105__Proc. of the European Conference in Parallel Processing (Euro-Par), 2005, doi:10.1007/11549468_105.

Bienkowski, Marcin, and Jarosaw Byrka. “Bucket Game with Applications to Set Multicover and Dynamic Page Migration.”10.1007/11561071_72__Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669, Springer , 2005, pp. 815–26, doi:10.1007/11561071_72.

Bienkowski, Marcin. “Dynamic Page Migration with Stochastic Requests.” Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), ACM Press, NY, USA, 2005, pp. 270–78.

Bienkowski, Marcin, et al. “Cube Connected Cycles Based Bluetooth Scatternet Formation.”10.1007/978-3-540-31956-6_49__Proceedings of the 4th International Conference on Networking, vol. 3420, Springer, 2005, pp. 413–20, doi:10.1007/978-3-540-31956-6_49.

Bienkowski, Marcin, et al. “Improved Algorithms for Dynamic Page Migration.”10.1007/978-3-540-31856-9_30__Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–76, doi:10.1007/978-3-540-31856-9_30.

Räcke, Harald. Data Management and Routing in General Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.

Frahling, Gereon, et al. “Sampling in Dynamic Data Streams and Applications.”10.1145/1064092.1064116__Proceedings of the Twenty-First Annual Symposium on Computational Geometry  - SCG ’05, 2005, doi:10.1145/1064092.1064116.

Köhler, Sven, et al. “On Approximating Real-World Halting Problems.”10.1007/11537311_40__Fundamentals of Computation Theory, 2005, doi:10.1007/11537311_40.

Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over the Reals.”10.1007/11537311_41__Fundamentals of Computation Theory, 2005, doi:10.1007/11537311_41.

Ziegler, Martin. “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.”10.1007/11494645_68__Proc. CiE 2005: New Computational Paradigms, vol. 3526, Springer, 2005, pp. 562–71, doi:10.1007/11494645_68.

Ziegler, Martin. “Computational Power of Infinite Quantum Parallelism.”10.1007/s10773-005-8984-0__International Journal of Theoretical Physics, vol. 44, no. 11, 2005, pp. 2059–71, doi:10.1007/s10773-005-8984-0.

Dangelmaier, Wilhelm, et al. “Methods to Lead the User to Significant Processes in a 3D Material Flow Simulation.” Simulation in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005, 2005, pp. 267–70.

Loeser, Christoph, et al. “Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario.” IEEE International Conference on Industrial Informatics (INDIN), 2005.

Oesterdiekhoff, Brigitte. “Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices.” IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), 2005.

Bienkowski, Marcin, et al. “Dynamic Load Balancing in Distributed Hash Tables.”10.1007/11558989_20__Peer-to-Peer Systems IV, 2005, doi:10.1007/11558989_20.

Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.”10.1007/11549345_1__Mathematical Foundations of Computer Science 2005, 2005, doi:10.1007/11549345_1.

Bonorden, Olaf, et al. “A Web Computing Environment for Parallel Algorithms in Java.”10.1007/11752578_96__Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 801–08, doi:10.1007/11752578_96.

Bonorden, Olaf, et al. “Load Balancing Strategies in a Web Computing Environment.”10.1007/11752578_101__Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 839–46, doi:10.1007/11752578_101.

Bienkowski, Marcin, et al. “Average Case Complexity of Voronoi Diagrams of n Sites from the Unit Cube.” Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005, Technische Universiteit Eindhoven, 2005.

Leonardi, Stefano, et al., editors. Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks. Vol. 05361, 2005.

Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.”10.1016/j.tcs.2005.09.053__Theoretical Computer Science, 2005, pp. 14–26, doi:10.1016/j.tcs.2005.09.053.

Salzwedel, Kay. Data Distribution Algorithms for Storage Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2004.

Briest, Patrick, et al. “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.”10.1007/978-3-540-30217-9_4__Parallel Problem Solving from Nature - PPSN VIII, 2004, doi:10.1007/978-3-540-30217-9_4.

Schweer, Andrea, et al. “Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.” Parallel Problem Solving from Nature - PPSN VIII, 2004.

Brinkmann, André, et al. “A Case for Virtualized Arrays of RAID.”10.1145/1162628.1162630__Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os - SNAPI ’04, 2004, pp. 9–16, doi:10.1145/1162628.1162630.

Schindelhauer, Christian, et al. “The Design of PaMaNet the Paderborn Mobile Ad-Hoc Network.”10.1145/1023783.1023807__Proceedings of the Second International Workshop on Mobility Management &; Wireless Access Protocols, 2004, doi:10.1145/1023783.1023807.

Bleckmann, Peter, et al. “Virtualization with Prefetching Abilities Based on ISCSI.”10.1145/1162628.1162634__Proceeding of International Workshop on Storage Network Architecture and Parallel I/O, no. 2, 2004, pp. 40–47, doi:10.1145/1162628.1162634.

Klein, Jan, and Gabriel Zachmann. “Point Cloud Surfaces Using Geometric Proximity Graphs.”10.1016/j.cag.2004.08.012__Computers and Graphics, vol. 28, no. 6, 2004, pp. 839–50, doi:10.1016/j.cag.2004.08.012.

Klein, Jan, and Gabriel Zachmann. “Proximity Graphs for Defining Surfaces over Point Clouds.” Eurographics Symposium on Point-Based Grahics (SPBG’04), 2004, pp. 131–38.

Klein, Jan, and Gabriel Zachmann. “Nice and Fast Implicit Surfaces over Noisy Point Clouds.” SIGGRAPH 2004, Sketches, 2004.

Klein, Jan, and Gabriel Zachmann. “Point Cloud Collision Detection.” Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004), 2004, pp. 567–76.