Bonorden O. Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip. Vol 257. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009.

Bonorden O, Degener B, Pietrzyk P, Kempkes B. Complexity and Approximation of a Geometric Local Robot Assignment Problem.; 2009.

Bonorden O, Degener B, Kempkes B, Pietrzyk P. Complexity and Approximation of a Geometric Local Robot Assignment Problem. In: Algorithmic Aspects of Wireless Sensor Networks. Berlin, Heidelberg: Springer; 2009:252-262. doi:10.1007/978-3-642-05434-1_25

Schindelhauer C, Mahlmann P, Janson T. 3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. Paderborn, Germany; 2009.

Ooi CC, Schindelhauer C. Minimal Energy Path Planning for Wireless Robots. Mobile Networks and Applications (MONET). 2009:309-321. doi:10.1007/s11036-008-0150-5

Ooi CC, Schindelhauer C. Utilizing detours for energy conservation in mobile wireless networks. Telecommunication Systems. 2009;43:25-37. doi:10.1007/s11235-009-9188-3

Raptopoulos CL, Nikoletseas SE, Spirakis PG. Colouring Non-sparse Random Intersection Graphs. In: 34st International Symposium on Mathematical Foundations of Computer Science. ; 2009:600--611. doi:10.1007/978-1-4939-2864-4_597

Nikoletseas SE, Raptopoulos CL, Spirakis PG. Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions. In: 10.1109/IPDPS.2009.5161002__Proceedings of IPDPS - IEEE International Parallel &; Distributed Processing Symposium. ; 2009:1--11. doi:10.1109/IPDPS.2009.5161002

Deveci D, Kortenjan M, Schomaker G. Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions. In:  Parallel and Distributed Computing and Systems, Nr. 21. ; 2009.

Stradner J, Hamann H, Schmickl T, Crailsheim K. Analysis and implementation of an Artificial Homeostatic Hormone System: A first case study in robotic hardware. In: 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems. ; 2009. doi:10.1109/iros.2009.5354056

Schmickl T, Hamann H, Wörn H, Crailsheim K. Two different approaches to a macroscopic model of a bio-inspired robotic swarm. Robotics and Autonomous Systems. 2009;6(9):913-921. doi:10.1016/j.robot.2009.06.002

Hamann H, Troch I, Breitenecker F. Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System. In: MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling. ; 2009.

Meyer auf der Heide F, Rammig F-J. Self-Organisation and Self-Optimization. Public Service Review: Science and Technology. 2009;04.

Briest P. Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems). it - Information Technology. 2009;51(1):62-65. doi:10.1524/itit.2009.0524

Briest P, Hoefer M, Gualà L, Ventre C. On Stackelberg Pricing with Computationally Bounded Consumers. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 2009. doi:10.1007/978-3-642-10841-9_6

Laroque C, Fischer M, Dangelmaier W. Concepts for Model Verification and Validation during Simulation Runtime. In: European Simulation and Modelling Conference (ESM 2009). EUROSIS-ETI; 2009.

Suess T, Fischer M, Huber D, Laroque C, Dangelmaier W. Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen. In: Augmented &; Virtual Reality in Der Produktentstehung. Vol 252. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009:111--126.

Fischer M, Hilbig M, Jähn C, Meyer auf der Heide F, Ziegler M. Planar Visibility Counting. In: Proc. 25th European Workshop on Computational Geometry. ; 2009:203-206.

Kutyowski J, Meyer auf der Heide F. Optimal strategies for maintaining a chain of relays between an explorer and a base camp. Theoretical Computer Science. 2009:3391-3405. doi:10.1016/j.tcs.2008.04.010

Mehler J, Meyer auf der Heide F. Power-aware online file allocation in mobile ad hoc networks. In: Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09. ; 2009. doi:10.1145/1583991.1584072

Meyer auf der Heide F, Bender MA, eds. Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09.; 2009. doi:10.1145/1583991

Bienkowski M, Byrka J, Korzeniowski M, Meyer auf der Heide F. Optimal algorithms for page migration in dynamic networks. Journal of Discrete Algorithms. 2009:545-569. doi:10.1016/j.jda.2008.07.006

Schomaker G. Distributed Resource Allocation and Management in Heterogeneous Networks. Vol 259. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2008.

Briest P. Uniform Budgets and the Envy-Free Pricing Problem. In: Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP). ; 2008. doi:10.1007/978-3-540-70575-8_66

Briest P, Krysta P, Babaioff M. On the Approximability of Combinatorial Exchange Problems. In: Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT). Cham; 2008. doi:https://doi.org/10.1007/978-3-540-79309-0_9

Briest P, Goldberg PW, Roeglin H. Approximate Equilibria in Games with Few Players.; 2008.

Schindelhauer C, Mahlmann P. Random Graphs for Peer-to-Peer Overlays. In: The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2008:1-22.

Ooi CC, Schindelhauer C. Detours Save Energy in Mobile Wireless Networks. In: MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008). Springer; 2008. doi:10.1007/978-0-387-84839-6_6

Ooi CC, Schindelhauer C. Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots. In: ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008). ; 2008. doi:10.1007/978-3-642-00644-9_4

Pietrzyk P. Lokale Strategien Zur Optimierung von Kommunikationsketten.; 2008.

Hamann H. Space-Time Continuous Models of Swarm Robotic Systems.; 2008. doi:10.1007/978-3-642-13377-0

Ziegler M, Koolen WM. Kolmogorov Complexity Theory over the Reals. arXiv:08022027. Published online 2008.

Köhler S, Ziegler M. On the Stability of Fast Polynomial Arithmetic. In: Proc. 8th Conference on Real Numbers and Computers. ; 2008:147-156.

Ziegler M. Physically-Relativized Church-Turing Hypotheses. Applied Mathematics and Computation. Published online 2008.

Ziegler M. A Meta-Theory of Physics and Computation. In: Verhandlungen Der Deutschen Physikalischen Gesellschaft. Deutsche Physikalische Gesellschaft (DPG); 2008:145.

Meer K, Ziegler M. An explicit solution to Post’s Problem over the reals. Journal of Complexity. Published online 2008:3-15. doi:10.1016/j.jco.2006.09.004

Suess T, Huber D, Fischer M, Laroque C, Dangelmaier W. A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations. In: IEEE International Symposium on Parallel and Distributed Processing with Applications. ; 2008. doi:10.1109/ispa.2008.30

Meyer auf der Heide F. The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS). Vol 222. Paderborn: Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn; 2008.

Dangelmaier W, Fischer M, Huber D, Laroque C, Suess T. Aggregated 3D-visualization of a distributed simulation experiment of a queuing system. In: 2008 Winter Simulation Conference. ; 2008:2012-2020. doi:10.1109/wsc.2008.4736296

Degener B, Gehweiler J, Lammersen C. The Kinetic Facility Location Problem. In: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT). ; 2008:378-389. doi:10.1007/978-3-540-69903-3_34

Gehweiler J, Lammersen C, Degener B. The Kinetic Facility Location Problem. In: Proceedings of the 24th European Workshop on Computational Geometry. ; 2008:251-254.

Mense M, Scheideler C. SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008. SIAM; 2008:1135--1144.

Hamann H, Wörn H. Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem. In: The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08). Vol 5040. ; 2008:447--456. doi:10.1007/978-3-540-69134-1_44

Hamann H, Schmickl T, Wörn H, Crailsheim K. Spatial Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm. In: IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS’08). IEEE Press; 2008:1415--1420. doi:10.1109/IROS.2008.4651038

Hamann H, Wörn H. A framework of space–time continuous models for algorithm design in swarm robotics. Swarm Intelligence. 2008;2(2-4):209-239. doi:10.1007/s11721-008-0015-3

Lürwer-Brüggemeier K, Ziegler M. On Faster Integer Calculations Using Non-arithmetic Primitives. In: Unconventional Computing. Berlin, Heidelberg; 2008. doi:10.1007/978-3-540-85194-3_11

Laroque C, Fischer M, Dangelmaier W, Eikel B. Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations. In: Industrial Simulation Conference (ISC 2008). EUROSIS-ETI; 2008:306-310.

Laroque C, Fischer M, Eikel B. Regelung von Animationen in Simulationen von  hochdynamischen Fabrikszenen . In: Augmented &; Virtual Reality in Der Produktentstehung. Vol 232. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2008:193--206.

Le Roux S, Ziegler M. Singular Coverings and Non-Uniform Notions of Closed Set Computability. Electronic Notes in Theoretical Computer Science. Published online 2008:73-88. doi:10.1016/j.entcs.2008.03.009

Ackermann H, Briest P, Fanghänel A, Vöcking B. Who Should Pay for Forwarding Packets? Internet Mathematics. 2008;5(4):459-475. doi:10.1007/978-3-540-77105-0_21

Meyer auf der Heide F, Schneider B. Local Strategies for Connecting Stations by Small Robotic Networks. In: Biologically-Inspired Collaborative Computing. Boston, MA; 2008. doi:10.1007/978-0-387-09655-1_9

Gehweiler J, Meyer auf der Heide F. Bin Packing oder eWie bekomme ich die Klamotten in die Kisten?“. In: Taschenbuch Der Algorithmen. Berlin, Heidelberg; 2008. doi:10.1007/978-3-540-76394-9_40

Fischer M, Hilbig M, Jähn C, Meyer auf der Heide F, Ziegler M. Planar Visibility Counting. arXiv:08100052. 2008.

Meyer auf der Heide F, Shavit N, eds. Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’08. ACM; 2008. doi:10.1145/1378533

Briest P, Krysta P. Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA). ; 2007.

Bonorden O. Load Balancing in the Bulk-Synchronous-Parallel Setting using Process Migrations. In: 2007 IEEE International Parallel and Distributed Processing Symposium. ; 2007. doi:10.1109/ipdps.2007.370330

Ooi CC, Schindelhauer C. Minimal Energy Path Planning for Wireless Robots. In: ROBOCOMM’07: Proc. of the 1st International Conference on Robot Communication and Coordination. ; 2007:309-321. doi:10.1007/s11036-008-0150-5

Schomaker G. DHHT-RAID: A Distributed Heterogeneous Scalable Architecture for Dynamic Storage Environments. In: Advanced Information Networking and Applications (AINA-07). Vol 21. ; 2007:331-339. doi:10.1109/aina.2007.59

Bienkowski M, Kutyowski J. The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces. In: Lecture Notes in Computer Science. ; 2007. doi:10.1007/978-3-540-73951-7_30

Mahlmann P, Schindelhauer C. Peer-to-Peer-Netzwerke. Springer; 2007. doi:10.1007/978-3-540-33992-2

Leonardi S, Mahlmann P, Meyer auf der Heide F, Spirakis PG, Weikum G. Guarding our digital society’s well-being. e-Strategies, www.britishpublishers.com. 2007;3-10-2007.

Dynia M, opuszaski J, Schindelhauer C. Why Robots Need Maps. In: Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO). ; 2007:37-- 46. doi:10.1007/978-3-540-72951-8_5

Dynia M, Korzeniowski M, Kutyowski J. Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs. In: Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07). Vol 4362. ; 2007:260--271. doi:10.1007/978-3-540-69507-3_21

Kutylowski J. Using Mobile Relays for Ensuring Connectivity in Sparse Networks.; 2007.

Kutylowski J. Competitive Maintenance of Minimum Spanning Trees under Stochastic Adversaries. 2007.

Dorigo M, Hamann H, Szymanski M, Wörn H, Shi Y. Orientation in a Trail Network by Exploiting its Geometry for Swarm Robotics. In: IEEE Swarm Intelligence Symposium, Honolulu, USA, April 1-5. IEEE Press; 2007:310--315. doi:10.1109/SIS.2007.367953

Hamann H, Wörn H, Sahin E, Spears W, Winfield W. An analytical and spatial model of foraging in a swarm of robots. In: Swarm Robotics - Second SAB 2006 International Workshop. Vol 4433. ; 2007:43--55. doi:10.1007/978-3-540-71541-2_4

Hamann H, Wörn H. A Space- and Time-Continuous Model of Self-Organizing Robot Swarms for Design Support. In: First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007). ; 2007:23--31. doi:10.1109/saso.2007.3

Hamann H, Wörn H, Nagy M, Nagy N. Embodied Computation. Parallel Processing Letters. 2007;17(3):287--298.

Hamann H, Szymanski M, Wörn H, Estana R, Xie M, Dubowsky S. From Micro to Nano and Swarm Robotics. In: Advances in Climbing and Walking Robots. Proceedings of 10th International Conference (CLAWAR’07), Singapore, July 16-18. ; 2007:15--24. doi:10.1142/9789812770189_0003

Ziegler M. Revising Type-2 Computation and Degrees of Discontinuity. Electronic Notes in Theoretical Computer Science. 2007:255-274. doi:10.1016/j.entcs.2006.08.015

Ziegler M. Real Hypercomputation and Continuity. Theory of Computing Systems. 2007:177-206. doi:10.1007/s00224-006-1343-6

Ziegler M. (Short) Survey of Real Hypercomputation. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 2007. doi:10.1007/978-3-540-73001-9_86

Meer K, Ziegler M. Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. In: Mathematical Foundations of Computer Science 2007. Berlin, Heidelberg; 2007. doi:10.1007/978-3-540-74456-6_64

Lürwer-Brüggemeier K, Ziegler M. On Faster Integer Calculations using Non-Arithmetic Primitives. arXiv:07090624. 2007.

Ziegler M. Real Computability and Hypercomputation.; 2007.

Fischer M, Laroque C, Huber D, et al. Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment. In: European Simulation and Modelling Conference (ESM 2007). ; 2007:499--505.

Dangelmaier W,  Laroque C, Fischer M. Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik. In: Augmented &; Virtual Reality in Der Produktentstehung. Vol 209. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2007:95-110.

Buriol LS, Frahling G, Leonardi S, Sohler C. Estimating Clustering Indexes in Data Streams. In: Proceedings of the 15th European Symposium on Algorithms (ESA). Vol 4698. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2007:618-632. doi:10.1007/978-3-540-75520-3_55

Sohler C, Czumaj A. On Testable Properties in Bounded Degree Graphs. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07). ; 2007:494-501.

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