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

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

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

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

Mahlmann, P., &; Schindelhauer, C. (2006). 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 (pp. 308--317).https://doi.org/10.1145/1148109.1148162 

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

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

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

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

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

Kortenjan, M., &; Schomaker, G. (2006). Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes. In 4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006).https://doi.org/10.1145/1108590.1108608 

Kutyowski, J., &; Zagórski, F. (2006). Reliable Broadcasting Without Collision Detection. SOFSEM 2006: Theory and Practice of Computer Science.https://doi.org/10.1007/11611257_37 

Brinkmann, A., Effert, S., Heidebuer, M., &; Vodisek, M. (2006). Influence of adaptive data layouts on performance in dynamically changing storage environments. 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06).https://doi.org/10.1109/pdp.2006.44 

Rammig, F.-J., Dangelmaier, W., Karl, H., Mertsching, B., Meyer auf der Heide, F., &; Trächtler, A. (Eds.). (2006). Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems. Verlagsschriftenreihe des Heinz Nixdorf Instituts.

Monien, B., &; Meyer auf der Heide, F. (2006). New trends in parallel and distributed computing (Vol. 181). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Grünewald, M., Meyer auf der Heide, F., Rührup, S., Schindelhauer, C., &; Volbert, K. (2006). Directional Communication in Mobile Ad Hoc Networks. New Trends in Parallel &; Distributed Computing, 6th Int. Heinz Nixdorf Symposium, 225–234.

Sohler, C., Frahling, G., Marchetti-Spaccamela, A., Leonardi, S., &; Buriol, L. (2006). Computing Clustering Coefficients in Data Streams. In Proceedings of  the European Conference on Complex Systems (ECCS’06).

Sohler, C., Frahling, G., Marchetti-Spaccamela, A., Leonardi, S., &; Buriol, L. (2006). Counting Triangles in Data Streams. In Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS) (Ed.).

Sohler, C., Gehweiler, J., &; Lammersen, C. (2006). A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem. In Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).

Dynia, M., Korzeniowski, M., &; Schindelhauer, C. (2006). Power-Aware Collective Tree Exploration. In Architecture of Computing Systems - ARCS (pp. 341--351).https://doi.org/10.1007/11682127_24 

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 

Schindelhauer, C., &; Voß, K. (2005). Probability Distributions for Channel Utilisation. In Proc. of 4th International Conference on Ad-Hoc Networks &; Wireless (ADHOC-NOW 2005) (pp. 271–284).https://doi.org/10.1007/11561354_23 

Schindelhauer, C., Weikum, G., Hales, D., &; Triantafillou, P. (2005). Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search. In European Conference on Complex Systems (ECCS 2005).

Brinkmann, A., Effert, S., Heidebuer, M., &; Vodisek, M. (2005). Distributed MD. In In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os (pp. 81–88).

Brinkmann, A., Effert, S., Heidebuer, M., Vodisek, M., &; Baars, H. (2005). An integrated Architecture for Business Intelligence support from Application down to Storage. In In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os (pp. 1–8).

Klein, J., &; Zachmann, G. (2005). The expected running time of hierarchical collision detection. In ACM SIGGRAPH 2005 Posters on https://doi.org/10.1145/1186954.1187087__- SIGGRAPH ’05.https://doi.org/10.1145/1186954.1187087 

Klein, J., &; Zachmann, G. (2005). Interpolation Search for Point Cloud Intersection. In Proceedings of the 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005) (pp. 163–170).https://doi.org/10.1145/1186223.1186329 

Loeser, C., Schomaker, G., Brinkmann, A., Vodisek, M., &; Heidebuer, M. (2005). Content Distribution in Heterogenous Video-on-Demand P Networks with ARIMA Forecasts. In Proceedings of the 4th International Conference on Networking (Vol. 3421, pp. 800–810). Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-31957-3_90 

Ziegler, M., &; Fuchssteiner, B. (2005). Nonlinear Reformulation of Heisenberg’s Dynamics. International Journal of Theoretical Physics, 693–717.https://doi.org/10.1007/s10773-005-7048-9 

Schindelhauer, C., &; Schomaker, G. (2005). Weighted distributed hash tables. SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, Nevada, USA.https://doi.org/10.1145/1073970.1074008 

Rührup, S., &; Schindelhauer, C. (2005). Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio. In Algorithms – ESA 2005.https://doi.org/10.1007/11561071_5 

Fischer, M. (2005). Design, analysis, and evaluation of a data structure for distributed virtual environments (Vol. 164). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Dangelmaier, W., Fischer, M., Gausemeier, J., Grafe, M., Matysczok, C., &; Mueck, B. (2005). Virtual and augmented reality support for discrete manufacturing system simulation. Computers in Industry, 371–383.https://doi.org/10.1016/j.compind.2005.01.007 

Fischer, M., Mueck, B., Mahajan, K., Kortenjan, M., Laroque, C., &; Dangelmaier, W. (2005). Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations. In Proceedings of the Winter Simulation Conference.https://doi.org/10.1109/wsc.2005.1574470 

Czumaj, A., &; Sohler, C. (2005). Abstract Combinatorial Programs and Efficient Property Testers. SIAM Journal on Computing, 34(3), 580–615.https://doi.org/10.1137/s009753970444199x 

Bdoiu, M., Czumaj, A., Indyk, P., &; Sohler, C. (2005). Facility Location in Sublinear Time. In Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP) (pp. 866–877). Berlin, Heidelberg.https://doi.org/10.1007/11523468_70 

Sohler, C., &; Frahling, G. (2005). Coresets in Dynamic Geometric Data Streams. In Proceedings of the 37th ACM Symposium on Theory of Computing (STOC) (pp. 209–217).

Czumaj, A., &; Sohler, C. (2005). Testing hypergraph colorability. Theoretical Computer Science, 331(1), 37–52.https://doi.org/10.1016/j.tcs.2004.09.031 

Czumaj, A., Ergün, F., Fortnow, L., Magen, A., Newman, I., Rubinfeld, R., &; Sohler, C. (2005). Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM Journal on Computing, 35(1), 91–109.https://doi.org/10.1137/s0097539703435297 

Frahling, G., &; Krokowski, J. (2005). Online Occlusion Culling. In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) (Vol. 3669, pp. 758–769). Berlin, Heidelberg: Springer.https://doi.org/10.1007/11561071_67 

Bienkowski, M., &; Korzeniowski, M. (2005). Dynamic Page Migration Under Brownian Motion. In Proc. of the European Conference in Parallel Processing (Euro-Par). Berlin, Heidelberg.https://doi.org/10.1007/11549468_105 

Bienkowski, M., &; Byrka, J. (2005). Bucket Game with Applications to Set Multicover and Dynamic Page Migration. In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) (Vol. 3669, pp. 815–826). Berlin, Heidelberg: Springer .https://doi.org/10.1007/11561071_72 

Bienkowski, M. (2005). Dynamic Page Migration with Stochastic Requests. In Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005) (pp. 270–278). Las Vegas, Nevada, USA: ACM Press, NY, USA.

Bienkowski, M., Brinkmann, A., Korzeniowski, M., &; Orhan, O. (2005). Cube Connected Cycles Based Bluetooth Scatternet Formation. In Proceedings of the 4th International Conference on Networking (Vol. 3420, pp. 413–420). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-540-31956-6_49 

Bienkowski, M., Dynia, M., &; Korzeniowski, M. (2005). Improved Algorithms for Dynamic Page Migration. In Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 365–376).https://doi.org/10.1007/978-3-540-31856-9_30 

Räcke, H. (2005). Data Management and Routing in General Networks (Vol. 154). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Frahling, G., Indyk, P., &; Sohler, C. (2005). Sampling in dynamic data streams and applications. In Proceedings of the twenty-first annual symposium on Computational geometry  - SCG ’05.https://doi.org/10.1145/1064092.1064116 

Köhler, S., Schindelhauer, C., &; Ziegler, M. (2005). On Approximating Real-World Halting Problems. In Fundamentals of Computation Theory. Berlin, Heidelberg.https://doi.org/10.1007/11537311_40 

Meer, K., &; Ziegler, M. (2005). An Explicit Solution to Post’s Problem over the Reals. In Fundamentals of Computation Theory. Berlin, Heidelberg.https://doi.org/10.1007/11537311_41 

Ziegler, M. (2005). Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In Proc. CiE 2005: New Computational Paradigms (Vol. 3526, pp. 562–571). Springer.https://doi.org/10.1007/11494645_68 

Ziegler, M. (2005). Computational Power of Infinite Quantum Parallelism. International Journal of Theoretical Physics, 44(11), 2059–2071.https://doi.org/10.1007/s10773-005-8984-0 

Dangelmaier, W., Mueck, B., Fischer, M., Mahajan, K., &;  Laroque, C. (2005). Methods to lead the user to significant processes in a 3D material flow simulation. In Simulation in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005 (pp. 267–270).

Loeser, C., Drüke, I., &; Oesterdiekhoff, B. (2005).  Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario. In IEEE International Conference on Industrial Informatics (INDIN).

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

Bienkowski, M., Korzeniowski, M., &; Meyer auf der Heide, F. (2005). Dynamic Load Balancing in Distributed Hash Tables. In Peer-to-Peer Systems IV. Berlin, Heidelberg.https://doi.org/10.1007/11558989_20 

Bienkowski, M., &; Meyer auf der Heide, F. (2005). Page Migration in Dynamic Networks. In Mathematical Foundations of Computer Science 2005. Berlin, Heidelberg.https://doi.org/10.1007/11549345_1 

Bonorden, O., Gehweiler, J., &; Meyer auf der Heide, F. (2005). A Web Computing Environment for Parallel Algorithms in Java. In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 801–808).https://doi.org/10.1007/11752578_96 

Bonorden, O., Gehweiler, J., &; Meyer auf der Heide, F. (2005). Load Balancing Strategies in a Web Computing Environment. In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 839–846).https://doi.org/10.1007/11752578_101 

Bienkowski, M., Damerow, V., Meyer auf der Heide, F., &; Sohler, C. (2005). Average case complexity of Voronoi diagrams of n sites from the unit cube. In Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005. Technische Universiteit Eindhoven.

Leonardi, S., Meyer auf der Heide, F., &; Wagner, D. (Eds.). (2005). Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks (Vol. 05361). Presented at the Dagstuhl Seminar Proceedings, Schloss Dagstuhl, Germany.

Ziegler, M. (2005). Stability versus speed in a computable algebraic model. Theoretical Computer Science, 14–26.https://doi.org/10.1016/j.tcs.2005.09.053 

Salzwedel, K. (2004). Data Distribution Algorithms for Storage Networks (Vol. 153). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Briest, P., Brockhoff, D., Degener, B., Englert, M., Gunia, C., Heering, O.,https://doi.org/10.1007/978-3-540-30217-9_4__Wegener, I. (2004). The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. In Parallel Problem Solving from Nature - PPSN VIII. Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-30217-9_4 

Schweer, A., Leifhelm, M., Degener, B., Heering, O., Tannenbaum, S., Röglin, H.,  Plociennik, K. (2004). Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. In Parallel Problem Solving from Nature - PPSN VIII.

Brinkmann, A., Salzwedel, K., &; Vodisek, M. (2004). A case for virtualized arrays of RAID. In Proceedings of the international workshop on Storage network architecture and parallel I/Os - SNAPI ’04 (pp. 9–16).https://doi.org/10.1145/1162628.1162630 

Schindelhauer, C., Böttcher, S., &; Rammig, F. (2004). The design of PaMaNet the Paderborn mobile ad-hoc network. In Proceedings of the second international workshop on Mobility management &; wireless access protocols.https://doi.org/10.1145/1023783.1023807 

Bleckmann, P., Schomaker, G., &; Slowik, A. (2004). Virtualization with prefetching abilities based on iSCSI. Proceeding of International Workshop on Storage Network Architecture and Parallel I/O, 2, 40–47.https://doi.org/10.1145/1162628.1162634 

Klein, J., &; Zachmann, G. (2004). Point Cloud Surfaces using Geometric Proximity Graphs. Computers and Graphics, 28(6), 839–850.https://doi.org/10.1016/j.cag.2004.08.012 

Klein, J., &; Zachmann, G. (2004). Proximity Graphs for Defining Surfaces over Point Clouds. In Eurographics Symposium on Point-Based Grahics (SPBG’04) (pp. 131–138).

Klein, J., &; Zachmann, G. (2004). Nice and Fast Implicit Surfaces over Noisy Point Clouds. In SIGGRAPH 2004, Sketches.

Klein, J., &; Zachmann, G. (2004). Point Cloud Collision Detection. In Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004) (pp. 567–576).

Volbert, K. (2004). Experimental analysis of adjustable sectorized topologies for static ad hoc networks. Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing  - DIALM-POMC ’04.https://doi.org/10.1145/1022630.1022646 

Rührup, S., &; Schindelhauer, C. (2004). Traffic and Hop Efficient Position-based Routing using a Cell Structure.

Brinkmann, A., Heidebuer, M., Meyer auf der Heide, F., Rückert, U., Salzwedel, K., &; Vodisek, M. (2004). V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System. In B. Kobler &; P. C. Hariharan (Eds.), 21st IEEE Conference on Mass Storage Systems and Technologies / 12th NASA Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA (pp. 153--157). IEEE.

Sohler, C., &; Damerow, V. (2004). Smoothed Number of Extreme Points under Uniform Noise. In Proceedings of the 20th European Workshop on Computational Geometry (EWCG’04) (pp. 93–96).

Damerow, V., &; Sohler, C. (2004). Extreme Points Under Random Noise. In Proceedings of the 12th European Symposium on Algorithms (ESA’04). Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-30140-0_25 

Sohler, C., Krokowski, J., Räcke, H., &; Westermann, M. (2004). Reducing State Changes with a Pipeline Buffer. In Proceedings of the Vision, Modeling, and Visualization Conference (VMV 2004).

Sohler, C., &; Czumaj, A. (2004). Sublinear-Time Approximation for Clustering via Random Sampling. In Automata, Languages and Programming (ICALP) (pp. 396–407).

Ziegler, M., &; Brattka, V. (2004). Computability in linear algebra. Theoretical Computer Science, 326(1–3), 187–211.https://doi.org/10.1016/j.tcs.2004.06.022 

Ziegler, M. (2004). Computable operators on regular sets. Computability and Complexity in Analysis, 50(4–5), 392–404.https://doi.org/10.1002/malq.200310107 

Nüsken, M., &; Ziegler, M. (2004). Fast Multipoint Evaluation of Bivariate Polynomials. In Proc. 12th Annual Symposium on Algorithms (ESA’04) (Vol. 3221, pp. 544–555). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-540-30140-0_49