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

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

Blesa MJ, Blum C, de Caro A, et al. Adapting a Sensor Net to the Dynamic Environment in a Wildlife Scenario - a Case Study.; 2010.

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

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

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

Bienkowski M. Page Migration in Dynamic Networks. Vol 282. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010.

Dynia M. Collective Graph Exploration. Vol 284. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010.

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

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

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

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

Kernbach S, Schmickl T, Hamann H, et al. Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics. In: Artificial Life XII (ALife XII). MIT Press; 2010:781-788.

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

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

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

Gavoille C, Patt-Shamir B, Scheideler C. Foreword. Theory of Computing Systems. 2010;(4):809--810. doi:10.1007/s00224-010-9284-5

Mahlmann P. Peer-to-Peer Networks Based on Random Graphs. Vol 283. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010.

Degener B. Local, Distributed Approximation Algorithms for Geometric Assignment Problems. Vol 278. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010.

Gall D, Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. In: LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings. Vol 6034. Lecture Notes in Computer Science. Springer; 2010:294--305. doi:10.1007/978-3-642-12200-2_27