Abshoff, S., Cord-Landwehr, A., Degener, B., Kempkes, B., &; Pietrzyk, P. (2011). 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) (pp. 13–27).https://doi.org/10.1007/978-3-642-28209-6_3 

Swierkot, K. (2011). Complexity Classes for Local Computation. Universität Paderborn.

Gehweiler, J., Kling, P., &; Meyer auf der Heide, F. (2011). 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) (pp. 31--40).https://doi.org/10.1007/978-3-642-31500-8_4 

Meyer auf der Heide, F., &; Rajaraman, R. (Eds.). (2011). 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures.https://doi.org/10.1145/1989493 

Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A.,https://doi.org/10.1007/978-3-642-18381-2_15__Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011) (pp. 178–189). Springer.https://doi.org/10.1007/978-3-642-18381-2_15 

Gehweiler, J., &; Meyer auf der Heide, F. (2011). Bin Packing - How Do I Get My Stuff into the Boxes. In Algorithms Unplugged (pp. 367–374). Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-15328-0_38 

Rajaraman, R., &; Meyer auf der Heide, F. (2011). Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11.https://doi.org/10.1145/1989493 

Degener, B., Fekete, S. P., Kempkes, B., &; Meyer auf der Heide, F. (2011). A survey on relay placement with runtime and approximation guarantees. Computer Science Review, 57–68.https://doi.org/10.1016/j.cosrev.2010.09.005 

Brandes, P., Degener, B., Kempkes, B., &; Meyer auf der Heide, F. (2011). 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 (pp. 138–149).https://doi.org/10.1016/j.tcs.2012.10.056 

Degener, B., Kempkes, B., Langner, T., Meyer auf der Heide, F., Pietrzyk, P., &; Wattenhofer, R. (2011). 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.https://doi.org/10.1145/1989493.1989515