T. Suess, A. Schoenrock, S. Meisner, and C. Plessl, “Parallel Macro Pipelining on the Intel SCC Many-Core Computer,”10.1109/IPDPSW.2013.136__in Proc. Int. Symp. on Parallel and Distributed Processing Workshops (IPDPSW), 2013, pp. 64–73, doi:10.1109/IPDPSW.2013.136 .

H. Hamann, J. Stradner, N. Bredeche, and L. Cazenille, “Impact of Neuron Models and Network Structure on Evolving Modular Robot Neural Network Controllers,” in 14th Annual Genetic and Evolutionary Computation Conference, GECCO 2012, 2012, pp. 89–96.

H. Hamann, T. Schmickl, and J. Stradner, “Towards Morphological Flexibility: Modular Robotics and Bio-inspired Control,” in Austrian Robotics Workshop (Operational Programme Slovenia-Austria), 2012.

H. Hamann et al., “On-line, On-board Evolution of Reaction-Diffusion Control for Self-Adaptation,” in Alife XIII, 2012, pp. 597–598.

H. Hamann, T. Schmickl, and K. Crailsheim, “Self-organized pattern formation in a swarm system as a transient phenomenon of non-linear dynamics,” Mathematical and Computer Modelling of Dynamical Systems, vol. 18, no. 1, pp. 39–50, 2012.

H. Hamann, T. Schmickl, and K. Crailsheim, “A Hormone-Based Controller for Evaluation-Minimal Evolution in Decentrally Controlled Systems,” Artificial Life, vol. 18, no. 2, pp. 165–198, 2012.

H. Hamann, T. Schmickl, H. Wörn, and K. Crailsheim, “Analysis of emergent symmetry breaking in collective decision making,” Neural Computing and Applications, vol. 21, no. 2, pp. 207–218, 2012.

H. Hamann et al., “Towards Swarm Calculus: Universal Properties of Swarm Performance and Collective Decisions,” in Swarm Intelligence: 8th International Conference, ANTS 2012, 2012, vol. 7461, pp. 168–179.

R. Cohen, I. Nudelman, and G. Polevoy, “On the Admission of Dependent Flows in Powerful Sensor Networks,” in Infocom’2012, Orlando, Florida, 2012.

V. Damerow et al., “Smoothed analysis of left-to-right maxima with applications,” Transactions on Algorithms, no. 3, p. 30, 2012.

A. Cord-Landwehr, P. Kling, and F. Mallmann Trenn, “Slow Down &; Sleep for Profit in Online Deadline Scheduling,” in Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg), 2012, pp. 218–231.

M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, and C. Scheideler, “Self-Organizing Particle Systems,” in Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.

B. Kempkes, Local strategies for robot formation problems, vol. 302. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.

P. Brandes and F. Meyer auf der Heide, “Distributed Computing in Fault-Prone Dynamic Networks,” in Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14.

A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, and A. Setzer, “Basic Network Creation Games with Communication Interests,” in Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 72--83.

F. Meyer auf der Heide, P. Pietrzyk, and P. Kling, “An Algorithm for Facility Leasing,” in Proceedings of the 19th International Colloquium on Structural Information &; Communication Complexity (SIROCCO), 2012, pp. 61–72.

F. Eidens, Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken. Universität Paderborn, 2012.

B. Kempkes and F. Meyer auf der Heide, “Continuous Local Strategies for Robotic Formation Problems,” in Experimental Algorithms, Berlin, Heidelberg, 2012.

B. Kempkes, P. Kling, and F. Meyer auf der Heide, “Optimal and competitive runtime bounds for continuous, local gathering of mobile robots,” in Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and architectures - SPAA ’12, 2012.

B. Kempkes and F. Meyer auf der Heide, “Local, Self-organizing Strategies for Robotic Formation Problems,” in Algorithms for Sensor Systems, Berlin, Heidelberg, 2012.

T. Suess, C. Koch, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes,”10.1007/978-3-642-33179-4_48__in Advances in Visual Computing, 2012, vol. 7431, pp. 502–512, doi:10.1007/978-3-642-33179-4_48 .

M. Korzeniowski, Dynamic Load Balancing in Peer-to-Peer Networks, vol. 289. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.

P. Briest, P. Krysta, and M. Hoefer, “Stackelberg Network Pricing Games,” Algorithmica, vol. 62, pp. 733–753, 2011.

C. Jähn, R. Petring, and B. Eikel, “PADrend: Platform for Algorithm Development and Rendering,” in Augmented &; Virtual Reality in der Produktentstehung, 2011, vol. 295, pp. 159--170.

H. Hamann, T. Schmickl, K. Crailsheim, N. Krasnogor, and P. Luca Lanzi, “Coupled inverted pendulums: A benchmark for evolving decentral controllers in modular robotics,” in Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, GECCO 2011, 2011, pp. 195--202.

H. Hamann, T. Schmickl, and K. Crailsheim, “Thermodynamics of Emergence: Langton’s Ant Meets Boltzmann,” in IEEE Symposium on Artificial Life (IEEE ALIFE 2011), 2011, pp. 62--69.

H. Hamann, T. Schmickl, and K. Crailsheim, “Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System,” in 10th European Conference on Artificial Life (ECAL’09), 2011, vol. 5777, pp. 442--449.

H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, R. Thenius, and R. Fitch, “Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples for Adaptive Reaction-Diffusion Controllers,” in Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples, 2011.

H. Hamann and T. Schmickl, “BEECLUST: A Swarm Algorithm Derived from Honeybees,” in Bio-inspired Computing and Communication Networks, Y. Xiao, Ed. Boca Raton, FL, USA: CRC Press, 2011.

H. Hamann et al., “Evolving a novel bio-inspired controller in reconfigurable robots,” in Advances in Artificial Life, 10th European Conference, ECAL 2009, 2011, pp. 132--139.

H. Hamann, T. Schmickl, K. Crailsheim, R. Thenius, and D. Kengyel, “Embodiment of Honeybee’s Thermotaxis in a Mobile Robot Swarm,” in 10th European Conference on Artificial Life (ECAL’09), 2011.

H. Hamann, T. Schmickl, and K. Crailsheim, “Explaining Emergent Behavior in a Swarm System Based on an Inversion of the Fluctuation Theorem,” in Advances in Artificial Life, ECAL 2011: Proceedings of the 11th European Conference on the Synthesis and Simulation of Living Systems, T. Lenaerts, M. Giacobini, H. Bersini, P. Bourgine, M. Dorigo, and R. Doursat, Eds. MIT Press, 2011, pp. 302--309.

H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, and L. Winkler, “Major Feedback Loops Supporting Artificial Evolution in Multi-modular Robotics,” in New Horizons in Evolutionary Robotics, Berlin, Heidelberg: Springer, 2011.

T. Schmickl, H. Hamann, and K. Crailsheim, “Modelling a hormone-inspired controller for individual- and multi-modular robotic systems,” Mathematical and Computer Modelling of Dynamical Systems, vol. 17, no. 3, pp. 221–242, 2011.

T. Suess, C. Koch, C. Jähn, and M. Fischer, “Approximative occlusion culling using the hull tree,” in Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada, 2011, pp. 79--86.

A. Klaas, C. Laroque, W. Dangelmaier, and M. Fischer, “Simulation aided, knowledge based routing for AGVs in a distribution warehouse,” in Proceedings of the 2011 Winter Simulation Conference (WSC), 2011.

T. Suess, C. Jähn, M. Fischer, F. Meyer auf der Heide, and C. Koch, “Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze,” in Augmented &; Virtual Reality in der Produktentstehung, 2011, vol. 295, pp. 185--197.

T. Suess, Parallel Real-Time Rendering using Heterogeneous PC Clusters. Universität Paderborn, 2011.

G. Frahling, Algorithms for Dynamic Geometric Data Streams, vol. 290. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.

J. Mehler, Power-Aware Online File Allocation in Dynamic Networks, vol. 287. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.

J. Gehweiler, Peer-to-Peer Based Parallel Web Computing, vol. 298. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.

P. Briest and C. Raupach, “The car sharing problem,” in Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11, 2011.

S. Effert, Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen. Universität Paderborn, 2011.

P. Briest, P. Krysta, and B. Vöcking, “Approximation Techniques for Utilitarian Mechanism Design,” SIAM Journal on Computing, pp. 1587–1622, 2011.

P. Briest and P. Krysta, “Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems,” SIAM Journal on Computing, pp. 1554–1586, 2011.

A. Cord-Landwehr et al., “Collisionless Gathering of Robots with an Extent,” in SOFSEM 2011: Theory and Practice of Computer Science, Berlin, Heidelberg, 2011.

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

H. Renken, C. Laroque, and M. Fischer, “An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization,” in Proceedings of The 25th European Simulation and Modelling Conference - ESM2011, 2011.

T. Suess, C. Koch, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Parallel Out-of-Core Occlusion Culling.” 2011.

B. Vöcking, M. Hoefer, A. Skopalik, M. Penn, and M. Polukarov, “Considerate Equilibrium,” in IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, 2011, pp. 234--239.

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 .