S. Abshoff, A. Cord-Landwehr, B. Degener, B. Kempkes, and P. Pietrzyk, “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks,” in Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 2011, pp. 13–27.
LibreCat: /record/657
DOI: 10.1007/978-3-642-28209-6_3

K. Swierkot, Complexity Classes for Local Computation. Universität Paderborn, 2011.
LibreCat: /record/663

J. Gehweiler, P. Kling, and F. Meyer auf der Heide, “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment,” in Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2011, pp. 31--40.
LibreCat: /record/664
DOI: 10.1007/978-3-642-31500-8_4

F. Meyer auf der Heide and R. Rajaraman, Eds., 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures. 2011.
LibreCat: /record/667
DOI: 10.1145/1989493

A. Cord-Landwehr et al., “Collisionless Gathering of Robots with an Extent,” in 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), 2011, no. 6543, pp. 178–189.
LibreCat: /record/16410
DOI: 10.1007/978-3-642-18381-2_15

J. Gehweiler and F. Meyer auf der Heide, “Bin Packing - How Do I Get My Stuff into the Boxes,” in Algorithms Unplugged, Berlin, Heidelberg, 2011, pp. 367–374.
LibreCat: /record/16412
DOI: 10.1007/978-3-642-15328-0_38

R. Rajaraman and F. Meyer auf der Heide, “Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11,” 2011.
LibreCat: /record/16428
DOI: 10.1145/1989493

B. Degener, S. P. Fekete, B. Kempkes, and F. Meyer auf der Heide, “A survey on relay placement with runtime and approximation guarantees,” Computer Science Review, pp. 57–68, 2011.
LibreCat: /record/16447
DOI: 10.1016/j.cosrev.2010.09.005

P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-efficient strategies for building short chains of mobile robots locally,” in SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity, 2011, pp. 138–149.
LibreCat: /record/16451
DOI: 10.1016/j.tcs.2012.10.056

B. Degener, B. Kempkes, T. Langner, F. Meyer auf der Heide, P. Pietrzyk, and R. Wattenhofer, “A tight runtime bound for synchronous gathering of autonomous robots with limited visibility,” in Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11, 2011.
LibreCat: /record/16453
DOI: 10.1145/1989493.1989515

P. Kling and F. Meyer auf der Heide, “Convergence of local communication chain strategies via linear transformations,” in Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11, 2011.
LibreCat: /record/16454
DOI: 10.1145/1989493.1989517

B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Building Simple Formations in Large Societies of Tiny Mobile Robots,” Procedia Computer Science, pp. 153–155, 2011.
LibreCat: /record/16455
DOI: 10.1016/j.procs.2011.09.049

B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-Awareness in Self-organising Robotic Exploration Teams,” in Organic Computing — A Paradigm Shift for Complex Systems, Basel, 2011.
LibreCat: /record/16456
DOI: 10.1007/978-3-0348-0130-0_35

P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally,” in Structural Information and Communication Complexity, Berlin, Heidelberg, 2011.
LibreCat: /record/16459
DOI: 10.1007/978-3-642-22212-2_13

D. F. Hsu, B. M. Magga, H. C. T. Ho, J. Hromkovic, F. C. M. Lau, and F. Meyer auf der Heide, “EDITORIAL,” Journal of Interconnection Networks, pp. vii–viii, 2011.
LibreCat: /record/17009
DOI: 10.1142/s0219265911002885

A. Cord-Landwehr et al., “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in Automata, Languages and Programming, Berlin, Heidelberg, 2011.
LibreCat: /record/16409
DOI: 10.1007/978-3-642-22012-8_52

P. Briest and H. Röglin, “The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers,” in Workshop on Approximation and Online Algorithms (WAOA), 2010, vol. 6534.
LibreCat: /record/19678
DOI: 10.1007/978-3-642-18318-8_5

B. Degener, P. Pietrzyk, and B. Kempkes, “A local, distributed constant-factor approximation algorithm for the dynamic facility location problem ,” in International Parallel &; Distributed Processing Symposium (IPDPS), 2010.
LibreCat: /record/19711
DOI: 10.1109/IPDPS.2010.5470349

M. Mense and C. Schindelhauer, “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, 2010, vol. 5873, pp. 624--639.
LibreCat: /record/19796
DOI: 10.1007/978-3-642-05118-0_43

T. Janson, P. Mahlmann, and C. Schindelhauer, “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, 2010.
LibreCat: /record/19824
DOI: 10.1109/icpads.2010.42