Kling, P., &; Meyer auf der Heide, F. (2011). Convergence of local communication chain strategies via linear transformations. In Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11.https://doi.org/10.1145/1989493.1989517 

Degener, B., Kempkes, B., &; Meyer auf der Heide, F. (2011). Building Simple Formations in Large Societies of Tiny Mobile Robots. Procedia Computer Science, 153–155.https://doi.org/10.1016/j.procs.2011.09.049 

Degener, B., Kempkes, B., &; Meyer auf der Heide, F. (2011). Energy-Awareness in Self-organising Robotic Exploration Teams. In Organic Computing — A Paradigm Shift for Complex Systems. Basel.https://doi.org/10.1007/978-3-0348-0130-0_35 

Brandes, P., Degener, B., Kempkes, B., &; Meyer auf der Heide, F. (2011). Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally. In Structural Information and Communication Complexity. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-22212-2_13 

Hsu, D. F., Magga, B. M., Ho, H. C. T., Hromkovic, J., Lau, F. C. M., &; Meyer auf der Heide, F. (2011). EDITORIAL. Journal of Interconnection Networks, vii–viii.https://doi.org/10.1142/s0219265911002885 

Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A.,https://doi.org/10.1007/978-3-642-22012-8_52__Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In Automata, Languages and Programming. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-22012-8_52 

Briest, P., &; Röglin, H. (2010). The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers. In Workshop on Approximation and Online Algorithms (WAOA) (Vol. 6534). Springer.https://doi.org/10.1007/978-3-642-18318-8_5 

Degener, B., Pietrzyk, P., &; Kempkes, B. (2010). A local, distributed constant-factor approximation algorithm for the dynamic facility location problem . In International Parallel &; Distributed Processing Symposium (IPDPS).https://doi.org/10.1109/IPDPS.2010.5470349 

Mense, M., &; Schindelhauer, C. (2010). 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 (Vol. 5873, pp. 624--639).https://doi.org/10.1007/978-3-642-05118-0_43 

Janson, T., Mahlmann, P., &; Schindelhauer, C. (2010). 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.https://doi.org/10.1109/icpads.2010.42 

Miao, H., Ooi, C. C., Wu, X., &; Schindelhauer, C. (2010). Coverage-hole trap model in target tracking using distributed relay-robot network. In Proceedings of the 2010 ACM Symposium on Applied Computing - SAC ’10 (pp. 1299–1304).https://doi.org/10.1145/1774088.1774365 

Schomaker, G., Oberthur, S., &; Kortenjan, M. (2010). Distributed and dynamic resource management for self-optimizing mechatronic systems. In 8th IEEE International Conference on Industrial Informatics (INDIN’2010).https://doi.org/10.1109/indin.2010.5549647 

Hamann, H. (2010). Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming. Berlin, Germany: Springer.https://doi.org/10.1007/978-3-642-13377-0 

Hamann, H., Schmickl, T., Stradner, J., &; Crailsheim, K. (2010). 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) (pp. 244--251).https://doi.org/10.1109/CEC.2010.5585994 

Schmickl, T., Hamann, H., Stradner, J., Mayet, R., &; Crailsheim, K. (2010). Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller. In Proc. of the ALife XII Conference (pp. 648--655). MIT Press.

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

Hamann, H., Meyer, B., Schmickl, T., &; Crailsheim, K. (2010). A Model of Symmetry Breaking in Collective Decision-Making. In From Animals to Animats 11 (Vol. 6226, pp. 639–648). Springer.https://doi.org/10.1007/978-3-642-15193-4_60 

Kernbach, S., Hamann, H., Stradner, J., Thenius, R., Schmickl, T., Crailsheim, K.,https://doi.org/10.1109/computationworld.2009.9__Winfield, A. F. T. (2010). On Adaptive Self-Organization in Artificial Robot Organisms. In 2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns.https://doi.org/10.1109/computationworld.2009.9 

Grzablewicz, R., Kutyowski, J., Kutyowski, M., &; Pietkiewicz, W. (2010). Robust Undetectable Interference Watermarks. ICCSA’05: Proceedings of the 2005 International Conference on Computational Science and Its Applications.https://doi.org/10.1007/11424826_55 

Samara, S., &; Schomaker, G. (2010). Real-time Adaptation and Load Balancing Aware OS Services for Distributed Reconfigurable System on Chip. 2010 10th IEEE International Conference on Computer and Information Technology.https://doi.org/10.1109/cit.2010.304 

Fischer, M., Renken, H., Laroque, C., Schaumann, G., &; Dangelmaier, W. (2010). Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations. In Proceedings of the 2010 Winter Simulation Conference.https://doi.org/10.1109/wsc.2010.5678906 

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

Blesa, M. J., Blum, C., de Caro, A., Degener, B., Kempkes, B., Leone, P.,  Mylonas, G. (2010). Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study.

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

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

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

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

Dynia, M. (2010). Collective graph exploration (Vol. 284). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Degener, B., Gehweiler, J., &; Lammersen, C. (2010). Kinetic Facility Location. Algorithmica, 57(3), 562–584.https://doi.org/10.1007/s00453-008-9250-7 

Gehweiler, J., &; Meyerhenke, H. (2010). A distributed diffusive heuristic for clustering a virtual P supercomputer. In Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC).https://doi.org/10.1109/ipdpsw.2010.5470922 

Gehweiler, J., &; Meyerhenke, H. (2010). On Dynamic Graph Partitioning and Graph Clustering using Diffusion. In Dagstuhl Seminar Proceedings 10261: Algorithm Engineering.

Thies, M., &; Gehweiler, J. (2010). Thread Migration and Checkpointing in Java.

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

Briest, P., Chalermsook, P., Khanna, S., Laekhanukit, B., &; Nanongkai, D. (2010). Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. In Workshop on Internet and Network Economics (WINE).https://doi.org/10.1007/978-3-642-17572-5_37 

Meyer auf der Heide, F., &; Scheideler, C. (2010). Algorithmische Grundlagen verteilter Speichersysteme. Informatik Spektrum, (5), 468--474.https://doi.org/10.1007/s00287-010-0470-2 

Briest, P., Chawla, S., Kleinberg, R., &; Weinberg, S. M. (2010). Pricing Randomized Allocations. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms.https://doi.org/10.1137/1.9781611973075.49 

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

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

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

Suess, T., Wiesemann, T., &; Fischer, M. (2010). Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments. 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage, 448–456.https://doi.org/10.1109/nas.2010.52 

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