S. Abshoff, A. Cord-Landwehr, B. Degener, B. Kempkes, and P. Pietrzyk, “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks,” in Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 2011, pp. 13–27.

K. Swierkot, Complexity Classes for Local Computation. Universität Paderborn, 2011.

J. Gehweiler, P. Kling, and F. Meyer auf der Heide, “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment,” in Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2011, pp. 31--40.

F. Meyer auf der Heide and R. Rajaraman, Eds., 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures. 2011.

A. Cord-Landwehr et al., “Collisionless Gathering of Robots with an Extent,” in 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), 2011, no. 6543, pp. 178–189.

J. Gehweiler and F. Meyer auf der Heide, “Bin Packing - How Do I Get My Stuff into the Boxes,” in Algorithms Unplugged, Berlin, Heidelberg, 2011, pp. 367–374.

R. Rajaraman and F. Meyer auf der Heide, “Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11,” 2011.

B. Degener, S. P. Fekete, B. Kempkes, and F. Meyer auf der Heide, “A survey on relay placement with runtime and approximation guarantees,” Computer Science Review, pp. 57–68, 2011.

P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-efficient strategies for building short chains of mobile robots locally,” in SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity, 2011, pp. 138–149.

B. Degener, B. Kempkes, T. Langner, F. Meyer auf der Heide, P. Pietrzyk, and R. Wattenhofer, “A tight runtime bound for synchronous gathering of autonomous robots with limited visibility,” in Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11, 2011.

P. Kling and F. Meyer auf der Heide, “Convergence of local communication chain strategies via linear transformations,” in Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11, 2011.

B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Building Simple Formations in Large Societies of Tiny Mobile Robots,” Procedia Computer Science, pp. 153–155, 2011.

B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-Awareness in Self-organising Robotic Exploration Teams,” in Organic Computing — A Paradigm Shift for Complex Systems, Basel, 2011.

P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally,” in Structural Information and Communication Complexity, Berlin, Heidelberg, 2011.

D. F. Hsu, B. M. Magga, H. C. T. Ho, J. Hromkovic, F. C. M. Lau, and F. Meyer auf der Heide, “EDITORIAL,” Journal of Interconnection Networks, pp. vii–viii, 2011.

A. Cord-Landwehr et al., “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in Automata, Languages and Programming, Berlin, Heidelberg, 2011.

P. Briest and H. Röglin, “The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers,” in Workshop on Approximation and Online Algorithms (WAOA), 2010, vol. 6534.

B. Degener, P. Pietrzyk, and B. Kempkes, “A local, distributed constant-factor approximation algorithm for the dynamic facility location problem ,” in International Parallel &; Distributed Processing Symposium (IPDPS), 2010.

M. Mense and C. Schindelhauer, “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks,” in Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2010, vol. 5873, pp. 624--639.

T. Janson, P. Mahlmann, and C. Schindelhauer, “A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs,” in Proceedings of the 16th International Conference on Parallel and Distributed Systems, 2010.

H. Miao, C. C. Ooi, X. Wu, and C. Schindelhauer, “Coverage-hole trap model in target tracking using distributed relay-robot network,” in Proceedings of the 2010 ACM Symposium on Applied Computing - SAC ’10, 2010, pp. 1299–1304.

G. Schomaker, S. Oberthur, and M. Kortenjan, “Distributed and dynamic resource management for self-optimizing mechatronic systems,” in 8th IEEE International Conference on Industrial Informatics (INDIN’2010), 2010.

H. Hamann, Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming. Berlin, Germany: Springer, 2010.

H. Hamann, T. Schmickl, J. Stradner, and K. Crailsheim, “A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait Learning,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10), 2010, pp. 244--251.

T. Schmickl, H. Hamann, J. Stradner, R. Mayet, and K. Crailsheim, “Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller,” in Proc. of the ALife XII Conference, 2010, pp. 648--655.

H. Hamann, J. Stradner, T. Schmickl, and K. Crailsheim, “Artificial Hormone Reaction Networks: Towards Higher Evolvability in  Evolutionary Multi-Modular Robotics,” in Artificial Life XII (ALife XII), Odense, Denmark, 2010, pp. 773–780.

H. Hamann, B. Meyer, T. Schmickl, and K. Crailsheim, “A Model of Symmetry Breaking in Collective Decision-Making,” in From Animals to Animats 11, 2010, vol. 6226, pp. 639–648.

S. Kernbach et al., “On Adaptive Self-Organization in Artificial Robot Organisms,” in 2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns, 2010.

R. Grzablewicz, J. Kutyowski, M. Kutyowski, and W. Pietkiewicz, “Robust Undetectable Interference Watermarks,”10.1007/11424826_55__ICCSA’05: Proceedings of the 2005 international conference on Computational Science and Its Applications, 2010, doi:10.1007/11424826_55 .

S. Samara and G. Schomaker, “Real-time Adaptation and Load Balancing Aware OS Services for Distributed Reconfigurable System on Chip,”10.1109/cit.2010.304__2010, doi:10.1109/cit.2010.304 .

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

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

M. J. Blesa et al., Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study. 2010.

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

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

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

M. Bienkowski, Page migration in dynamic networks, vol. 282. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.

M. Dynia, Collective graph exploration, vol. 284. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.

B. Degener, J. Gehweiler, and C. Lammersen, “Kinetic Facility Location,” Algorithmica, vol. 57, no. 3, pp. 562–584, 2010.

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

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

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

S. Kernbach et al., “Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics,” in Artificial Life XII (ALife XII), 2010, pp. 781–788.

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

F. Meyer auf der Heide and C. Scheideler, “Algorithmische Grundlagen verteilter Speichersysteme,” Informatik Spektrum, no. 5, pp. 468--474, 2010.

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

P. Mahlmann, Peer-to-peer networks based on random graphs, vol. 283. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.

B. Degener, Local, distributed approximation algorithms for geometric assignment problems, vol. 278. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.

M. Fischer, C. Jähn, and T. Suess, “Asynchronous Parallel Reliefboard Computation for Scene Object Approximation,”10.2312/EGPGV/EGPGV10/043-051__in Eurographics Symposium on Parallel Graphics and Visualization (EGPGV), 2010, pp. 43–51, doi:10.2312/EGPGV/EGPGV10/043-051 .

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

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

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

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

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

B. Degener, B. Kempkes, and F. Meyer auf der Heide, “A local O(n2) gathering algorithm,” in Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10, 2010.

S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and 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.

S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and 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.

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

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

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

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

O. Bonorden, B. Degener, P. Pietrzyk, and B. Kempkes, Complexity and approximation of a geometric local robot assignment problem. 2009.

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

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

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

C. C. Ooi and C. Schindelhauer, “Utilizing detours for energy conservation in mobile wireless networks,” Telecommunication Systems, vol. 43, pp. 25–37, 2009.

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

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

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

J. Stradner, H. Hamann, T. Schmickl, and K. Crailsheim, “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.

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

H. Hamann, I. Troch, and F. Breitenecker, “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.

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

P. Briest, “Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems),” it - Information Technology, vol. 51, no. 1, pp. 62–65, 2009.

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

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

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

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

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

J. Mehler and F. Meyer auf der Heide, “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.

F. Meyer auf der Heide and M. A. Bender, Eds., Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09. 2009.

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

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

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

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

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

C. Schindelhauer and P. Mahlmann, “Random Graphs for Peer-to-Peer Overlays,” in The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop, 2008, no. 222, pp. 1–22.

C. C. Ooi and C. Schindelhauer, “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), 2008.

C. C. Ooi and C. Schindelhauer, “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.

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

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

M. Ziegler and W. M. Koolen, “Kolmogorov Complexity Theory over the Reals,” arXiv:0802.2027. 2008.

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

M. Ziegler, “Physically-Relativized Church-Turing Hypotheses,” Applied Mathematics and Computation, 2008.

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

K. Meer and M. Ziegler, “An explicit solution to Post’s Problem over the reals,”10.1016/j.jco.2006.09.004__Journal of Complexity, pp. 3–15, 2008, doi:10.1016/j.jco.2006.09.004 .

T. Suess, D. Huber, M. Fischer, C. Laroque, and W. Dangelmaier, “A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations,”10.1109/ispa.2008.30__2008, doi:10.1109/ispa.2008.30 .

F. Meyer auf der Heide, 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.

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

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