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

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

Fischer M, Hilbig M, Jähn C, Meyer auf der Heide F, Ziegler M. Planar Visibility Counting. arXiv:08100052. 2008.

Meyer auf der Heide F, Shavit N, eds. Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’08. ACM; 2008. doi:10.1145/1378533

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

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

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

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

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

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

Leonardi S, Mahlmann P, Meyer auf der Heide F, Spirakis PG, Weikum G. Guarding our digital society’s well-being. e-Strategies, www.britishpublishers.com. 2007;3-10-2007.

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

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

Kutylowski J. Using Mobile Relays for Ensuring Connectivity in Sparse Networks.; 2007.

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

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

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

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

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

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

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

Ziegler M. Real Hypercomputation and Continuity. Theory of Computing Systems. 2007:177-206. doi:10.1007/s00224-006-1343-6

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

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

Lürwer-Brüggemeier K, Ziegler M. On Faster Integer Calculations using Non-Arithmetic Primitives. arXiv:07090624. 2007.

Ziegler M. Real Computability and Hypercomputation.; 2007.

Fischer M, Laroque C, Huber D, et al. 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). ; 2007:499--505.

Dangelmaier W,  Laroque C, Fischer M. Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik. In: Augmented &; Virtual Reality in Der Produktentstehung. Vol 209. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2007:95-110.

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

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

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

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

Sohler C, Czumaj A. 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). ; 2007:536-548.

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

Sohler C, Monemizahdeh M, Feldman D. A PTAS for k-means clustering based on weak coresets. In: Proceedings of the 23rd Annual Symposium on Computational Geometry (SoCG’07). ; 2007:11-18.

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

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

Arens S, Buss A, Deck H, et al. Smart Teams: Simulating Large Robotic Swarms in Vast Environments. In: Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment. Buenos Aires, Argentina: Heinz Nixdorf Institut, University of Paderborn; 2007:215-222.

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

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

Rührup S. Position-Based Routing Strategies. Vol 203. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006.

Briest P, Krysta P. Single-Minded Unlimited Supply Pricing on Sparse Instances. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA). ; 2006.

Briest P, Gunia C. Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels. In: Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC). ; 2006.

Degener B. Die Analyse von Estimation-of-Distribution-Algorithmen Auf Ausgewählten Funktionen.; 2006.

Mahlmann P, Schindelhauer C. Distributed random digraph transformations for peer-to-peer networks. In: Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’06. ; 2006:308--317. doi:10.1145/1148109.1148162

Rührup S, Schindelhauer C. Online Multi-path Routing in a Maze. In: Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006). ; 2006. doi:10.1007/11940128_65

Schindelhauer C, Schomaker G. SAN Optimal Multi Parameter Access Scheme. In: 5th International Conference on Networking (ICN). ; 2006. doi:10.1109/icniconsmcl.2006.190

Rührup S, Schindelhauer C. Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks. Universität Paderborn; 2006.

Schomaker G, Loeser C, Schubert M. Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks. In: 5th International Conference on Networking (ICN). ; 2006.

Brinkmann A, Effert S, Heidebuer M, Vodisek M. Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments. In: 5th International Conference on Networking (ICN). ; 2006. doi:10.1109/icniconsmcl.2006.182