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

Meyer auf der Heide, F., &; Phillips, C. A. (2010). Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10.https://doi.org/10.1145/1810479 

Eikel, B., Jähn, C., &; Fischer, M. (2010). Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware. In Advances in Visual Computing. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-17289-2_60 

Degener, B., Kempkes, B., Kling, P., &; Meyer auf der Heide, F. (2010). A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. In Structural Information and Communication Complexity (pp. 168–182). Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-13284-1_14 

Degener, B., Kempkes, B., &; Meyer auf der Heide, F. (2010). A local O(n2) gathering algorithm. In Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10.https://doi.org/10.1145/1810479.1810523 

Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., &; Spirakis, P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-14162-1 

Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., &; Spirakis, P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-14165-2 

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

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

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

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

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

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

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

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

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

Raptopoulos, C. L., Nikoletseas, S. E., &; Spirakis, P. G. (2009). Colouring Non-sparse Random Intersection Graphs. In 34st International Symposium on Mathematical Foundations of Computer Science (pp. 600--611).https://doi.org/10.1007/978-1-4939-2864-4_597 

Nikoletseas, S. E., Raptopoulos, C. L., &; Spirakis, P. G. (2009). Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions. In https://doi.org/10.1109/IPDPS.2009.5161002__Proceedings of IPDPS - IEEE International Parallel &; Distributed Processing Symposium (pp. 1--11).https://doi.org/10.1109/IPDPS.2009.5161002 

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

Stradner, J., Hamann, H., Schmickl, T., &; Crailsheim, K. (2009). 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.https://doi.org/10.1109/iros.2009.5354056 

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

Hamann, H., Troch, I., &; Breitenecker, F. (2009). 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.

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

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

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

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

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

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

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

Mehler, J., &; Meyer auf der Heide, F. (2009). 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.https://doi.org/10.1145/1583991.1584072 

Meyer auf der Heide, F., &; Bender, M. A. (Eds.). (2009). Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09.https://doi.org/10.1145/1583991 

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

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

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

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

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

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

Ooi, C. C., &; Schindelhauer, C. (2008). 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.https://doi.org/10.1007/978-0-387-84839-6_6 

Ooi, C. C., &; Schindelhauer, C. (2008). 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).https://doi.org/10.1007/978-3-642-00644-9_4 

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

Hamann, H. (2008). Space-Time Continuous Models of Swarm Robotic Systems.https://doi.org/10.1007/978-3-642-13377-0 

Ziegler, M., &; Koolen, W. M. (2008). Kolmogorov Complexity Theory over the Reals. In arXiv:0802.2027.

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

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

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

Meer, K., &; Ziegler, M. (2008). An explicit solution to Post’s Problem over the reals. Journal of Complexity, 3–15.https://doi.org/10.1016/j.jco.2006.09.004 

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

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

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

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

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

Mense, M., &; Scheideler, C. (2008). 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 (pp. 1135--1144). SIAM.

Hamann, H., &; Wörn, H. (2008). 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, pp. 447--456).https://doi.org/10.1007/978-3-540-69134-1_44 

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

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

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

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

Laroque, C., Fischer, M., &; Eikel, B. (2008). Regelung von Animationen in Simulationen von  hochdynamischen Fabrikszenen . Augmented &; Virtual Reality in Der Produktentstehung, 232, 193--206.

Le Roux, S., &; Ziegler, M. (2008). Singular Coverings and Non-Uniform Notions of Closed Set Computability. Electronic Notes in Theoretical Computer Science, 73–88.https://doi.org/10.1016/j.entcs.2008.03.009 

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

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

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

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

Meyer auf der Heide, F., &; Shavit, N. (Eds.). (2008). Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA ’08. ACM.https://doi.org/10.1145/1378533 

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

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

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

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

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

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

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

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

Dynia, M., Korzeniowski, M., &; Kutyowski, J. (2007). 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, pp. 260--271).https://doi.org/10.1007/978-3-540-69507-3_21 

Kutylowski, J. (2007). Using Mobile Relays for Ensuring Connectivity in Sparse Networks.

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

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

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

Hamann, H., &; Wörn, H. (2007). 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) (pp. 23--31).https://doi.org/10.1109/saso.2007.3 

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

Hamann, H., Szymanski, M., Wörn, H., Estana, R., Xie, M., &; Dubowsky, S. (2007). 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 (pp. 15--24).https://doi.org/10.1142/9789812770189_0003 

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

Ziegler, M. (2007). Real Hypercomputation and Continuity. Theory of Computing Systems, 177–206.https://doi.org/10.1007/s00224-006-1343-6 

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

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

Lürwer-Brüggemeier, K., &; Ziegler, M. (2007). On Faster Integer Calculations using Non-Arithmetic Primitives. ArXiv:0709.0624.

Ziegler, M. (2007). Real Computability and Hypercomputation.

Fischer, M., Laroque, C., Huber, D., Krokowski, J., Mueck, B., Kortenjan, M.,   Dangelmaier, W. (2007). 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) (pp. 499--505).

Dangelmaier, W.,  Laroque, C., &; Fischer, M. (2007). Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik. Augmented &; Virtual Reality in Der Produktentstehung, 209, 95–110.

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

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

Sohler, C., &; Lammersen, C. (2007). StrSort Algorithms for Geometric Problems. In Proceedings of the 23rd European Workshop on Computational Geometry (EWCG) (pp. 69–72).

Sohler, C., &; Czumaj, A. (2007). Testing Expansion in Bounded-Degree Graphs. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (pp. 570–578).

Sohler, C., &; Czumaj, A. (2007). 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) (pp. 536–548).

Sohler, C., &; Czumaj, A. (2007). Sublinear-time approximation algorithms for clustering via random sampling. Random Structures &; Algorithms, 30(1–2), 226-- 256.

Sohler, C., Monemizahdeh, M., &; Feldman, D. (2007). A PTAS for k-means clustering based on weak coresets. In Proceedings of the 23rd annual symposium on computational geometry (SoCG’07) (pp. 11–18).

Sohler, C., Czumaj, A., &; Frahling, G. (2007). Efficient kinetic data structures for MaxCut. In Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG) (pp. 157–160).

Brinkmann, A., Effert, S., Meyer auf der Heide, F., &; Scheideler, C. (2007). Dynamic and redundant data placement. IEEE International Conference on Distributed Computing Systems (ICDCS).

Arens, S., Buss, A., Deck, H., Dynia, M., Fischer, M., Hagedorn, H.,  Wachsmuth, H. (2007). Smart Teams: Simulating Large Robotic Swarms in Vast Environments. In Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment (pp. 215–222). Buenos Aires, Argentina: Heinz Nixdorf Institut, University of Paderborn.

Dynia, M., Kutylowski, J., Meyer auf der Heide, F., &; Schrieb, J. (2007). 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.https://doi.org/10.1145/1248377.1248420 

Klein, J. (2006). Efficient Collision Detection for Point and Polygon Based Models (Vol. 186). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.