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.