Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations
M. Fischer, H. Renken, C. Laroque, G. Schaumann, W. Dangelmaier, in: Proceedings of the 2010 Winter Simulation Conference, 2010.

A Large-Scale Distributed Environment for Peer-to-Peer Services
J. Gehweiler, F. Meyer auf der Heide, U.-P. Schroeder, A Large-Scale Distributed Environment for Peer-to-Peer Services, Heinz Nixdorf Institut, Paderborn, 2010.

Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study
M.J. Blesa, C. Blum, A. de Caro, B. Degener, B. Kempkes, P. Leone, G. Persiano, F. Meyer auf der Heide, G. Mylonas, Adapting a Sensor Net to the Dynamic Environment in a Wildlife Scenario - a Case Study, 2010.

Building short chains of mobile robots locally with a bounded stepwidth
P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, (2010).

Bandwidth allocation in cellular networks with multiple interferences
R. Bar-Yehuda, G. Polevoy, D. Rawitz, in: DIALM-PODC, 2010, pp. 33–42.

Hormone-based Control for Multi-modular Robotics
H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, P. Levi, S. Kernbach, in: Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution, Springer, 2010, pp. 240--263.

Page migration in dynamic networks
M. Bienkowski, Page Migration in Dynamic Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.

Collective graph exploration
M. Dynia, Collective Graph Exploration, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.

Kinetic Facility Location
B. Degener, J. Gehweiler, C. Lammersen, Algorithmica 57 (2010) 562–584.

A distributed diffusive heuristic for clustering a virtual P supercomputer
J. Gehweiler, H. Meyerhenke, in: Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC), 2010.

On Dynamic Graph Partitioning and Graph Clustering using Diffusion
J. Gehweiler, H. Meyerhenke, in: Dagstuhl Seminar Proceedings 10261: Algorithm Engineering, 2010.

Thread Migration and Checkpointing in Java
M. Thies, J. Gehweiler, Thread Migration and Checkpointing in Java, 2010.

Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics
S. Kernbach, T. Schmickl, H. Hamann, J. Stradner, F. Schlachter, C. s. F. Schwarzer, A.F.T. Winfield, R. Matthias, in: Artificial Life XII (ALife XII), MIT Press, 2010, pp. 781–788.

Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, D. Nanongkai, in: Workshop on Internet and Network Economics (WINE), 2010.

Algorithmische Grundlagen verteilter Speichersysteme
F. Meyer auf der Heide, C. Scheideler, Informatik Spektrum (2010) 468--474.

Pricing Randomized Allocations
P. Briest, S. Chawla, R. Kleinberg, S.M. Weinberg, in: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010.

Peer-to-peer networks based on random graphs
P. Mahlmann, Peer-to-Peer Networks Based on Random Graphs, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.

Local, distributed approximation algorithms for geometric assignment problems
B. Degener, Local, Distributed Approximation Algorithms for Geometric Assignment Problems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.

Asynchronous Parallel Reliefboard Computation for Scene Object Approximation
M. Fischer, C. Jähn, T. Suess, in: Eurographics Symposium on Parallel Graphics and Visualization (EGPGV), The Eurographics Association, 2010, pp. 43–51.

Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments
T. Suess, T. Wiesemann, M. Fischer, in: 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage, 2010, pp. 448–456.

Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems
T. Suess, T. Wiesemann, M. Fischer, in: Augmented &; Virtual Reality in Der Produktentstehung, 2010, pp. 39–52.

Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA 
F. Meyer auf der Heide, C.A. Phillips, in: 2010.

Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware
B. Eikel, C. Jähn, M. Fischer, in: Advances in Visual Computing, Berlin, Heidelberg, 2010.

A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots
B. Degener, B. Kempkes, P. Kling, F. Meyer auf der Heide, in: Structural Information and Communication Complexity, Berlin, Heidelberg, 2010, pp. 168–182.

A local O(n2) gathering algorithm
B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10, 2010.

Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.
S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis, eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II., Berlin, Heidelberg, 2010.

Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.
S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis, eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I., Berlin, Heidelberg, 2010.

Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division
K. Lürwer-Brüggemeier, Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.

On Fault-Tolerant Data Placement in Storage Networks
M. Mense, On Fault-Tolerant Data Placement in Storage Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.

Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes
M. Kortenjan, Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.

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

Complexity and approximation of a geometric local robot assignment problem
O. Bonorden, B. Degener, P. Pietrzyk, B. Kempkes, Complexity and Approximation of a Geometric Local Robot Assignment Problem, 2009.

Complexity and Approximation of a Geometric Local Robot Assignment Problem
O. Bonorden, B. Degener, B. Kempkes, P. Pietrzyk, in: Algorithmic Aspects of Wireless Sensor Networks, Springer, Berlin, Heidelberg, 2009, pp. 252–262.

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

Minimal Energy Path Planning for Wireless Robots
C.C. Ooi, C. Schindelhauer, Mobile Networks and Applications (MONET) (2009) 309–321.

Utilizing detours for energy conservation in mobile wireless networks
C.C. Ooi, C. Schindelhauer, Telecommunication Systems 43 (2009) 25–37.

Colouring Non-sparse Random Intersection Graphs
C.L. Raptopoulos, S.E. Nikoletseas, P.G. Spirakis, in: 34st International Symposium on Mathematical Foundations of Computer Science, 2009, pp. 600--611.

Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions
S.E. Nikoletseas, C.L. Raptopoulos, P.G. Spirakis, in:  Proceedings of IPDPS - IEEE International Parallel &; Distributed Processing Symposium, 2009, pp. 1--11.

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

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

Two different approaches to a macroscopic model of a bio-inspired robotic swarm
T. Schmickl, H. Hamann, H. Wörn, K. Crailsheim, Robotics and Autonomous Systems 6 (2009) 913–921.

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

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

Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems)
P. Briest, It - Information Technology 51 (2009) 62–65.

On Stackelberg Pricing with Computationally Bounded Consumers
P. Briest, M. Hoefer, L. Gualà, C. Ventre, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.

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

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

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

Optimal strategies for maintaining a chain of relays between an explorer and a base camp
J. Kutyowski, F. Meyer auf der Heide, Theoretical Computer Science (2009) 3391–3405.

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

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA 
F. Meyer auf der Heide, M.A. Bender, eds., Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009.

Optimal algorithms for page migration in dynamic networks
M. Bienkowski, J. Byrka, M. Korzeniowski, F. Meyer auf der Heide, Journal of Discrete Algorithms (2009) 545–569.

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

Uniform Budgets and the Envy-Free Pricing Problem
P. Briest, in: Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008.

On the Approximability of Combinatorial Exchange Problems
P. Briest, P. Krysta, M. Babaioff, in: Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT), Cham, 2008.

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

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

Detours Save Energy in Mobile Wireless Networks
C.C. Ooi, C. Schindelhauer, in: MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008), Springer, 2008.

Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots
C.C. Ooi, C. Schindelhauer, in: ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008), 2008.

Lokale Strategien zur Optimierung von Kommunikationsketten
P. Pietrzyk, Lokale Strategien Zur Optimierung von Kommunikationsketten, 2008.

Space-Time Continuous Models of Swarm Robotic Systems
H. Hamann, Space-Time Continuous Models of Swarm Robotic Systems, 2008.

Kolmogorov Complexity Theory over the Reals
M. Ziegler, W.M. Koolen, ArXiv:0802.2027 (2008).

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

Physically-Relativized Church-Turing Hypotheses
M. Ziegler, Applied Mathematics and Computation (2008).

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

An explicit solution to Post's Problem over the reals
K. Meer, M. Ziegler, Journal of Complexity (2008) 3–15.

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

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

Aggregated 3D-visualization of a distributed simulation experiment of a queuing system
W. Dangelmaier, M. Fischer, D. Huber, C. Laroque, T. Suess, in: 2008 Winter Simulation Conference, Miami, FL., USA, 2008, pp. 2012–2020.

The Kinetic Facility Location Problem
B. Degener, J. Gehweiler, C. Lammersen, in: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–389.

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

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

Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem
H. Hamann, H. Wörn, in: The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08), 2008, pp. 447--456.

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

A framework of space–time continuous models for algorithm design in swarm robotics
H. Hamann, H. Wörn, Swarm Intelligence 2 (2008) 209–239.

On Faster Integer Calculations Using Non-arithmetic Primitives
K. Lürwer-Brüggemeier, M. Ziegler, in: Unconventional Computing, Berlin, Heidelberg, 2008.

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

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

Singular Coverings and Non-Uniform Notions of Closed Set Computability
S. Le Roux, M. Ziegler, Electronic Notes in Theoretical Computer Science (2008) 73–88.

Who Should Pay for Forwarding Packets?
H. Ackermann, P. Briest, A. Fanghänel, B. Vöcking, Internet Mathematics 5 (2008) 459–475.

Local Strategies for Connecting Stations by Small Robotic Networks
F. Meyer auf der Heide, B. Schneider, in: Biologically-Inspired Collaborative Computing, Boston, MA, 2008.

Bin Packing oder eWie bekomme ich die Klamotten in die Kisten?c
J. Gehweiler, F. Meyer auf der Heide, in: Taschenbuch Der Algorithmen, Berlin, Heidelberg, 2008.

Planar Visibility Counting
M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, M. Ziegler, ArXiv:0810.0052 (2008).

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA 
F. Meyer auf der Heide, N. Shavit, eds., Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’08, ACM, 2008.

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

Load Balancing in the Bulk-Synchronous-Parallel Setting using Process Migrations
O. Bonorden, in: 2007 IEEE International Parallel and Distributed Processing Symposium, 2007.

Minimal Energy Path Planning for Wireless Robots
C.C. Ooi, C. Schindelhauer, in: ROBOCOMM’07: Proc. of the 1st International Conference on Robot Communication and Coordination, 2007, pp. 309–321.

DHHT-RAID: A Distributed Heterogeneous Scalable Architecture for Dynamic Storage Environments
G. Schomaker, in: Advanced Information Networking and Applications (AINA-07), 2007, pp. 331–339.

The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces
M. Bienkowski, J. Kutyowski, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.

Peer-to-Peer-Netzwerke
P. Mahlmann, C. Schindelhauer, Peer-to-Peer-Netzwerke, Springer, Berlin, 2007.

Guarding our digital society's well-being
S. Leonardi, P. Mahlmann, F. Meyer auf der Heide, P.G. Spirakis, G. Weikum, E-Strategies, Www.Britishpublishers.Com 3-10–2007 (2007).

Why Robots Need Maps
M. Dynia, J. opuszaski, C. Schindelhauer, in: Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO), 2007, pp. 37-- 46.

Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
M. Dynia, M. Korzeniowski, J. Kutyowski, in: Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07), 2007, pp. 260--271.

Using Mobile Relays for Ensuring Connectivity in Sparse Networks
J. Kutylowski, Using Mobile Relays for Ensuring Connectivity in Sparse Networks, Universität Paderborn, 2007.

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

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

An analytical and spatial model of foraging in a swarm of robots
H. Hamann, H. Wörn, E. Sahin, W. Spears, W. Winfield, in: Swarm Robotics - Second SAB 2006 International Workshop, 2007, pp. 43--55.

A Space- and Time-Continuous Model of Self-Organizing Robot Swarms for Design Support
H. Hamann, H. Wörn, in: First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007), 2007, pp. 23--31.

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

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