Gehweiler, J. (2011). Peer-to-Peer Based Parallel Web Computing (Vol. 298). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/18976

Briest, P., &; Raupach, C. (2011). The car sharing problem. In Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11.https://doi.org/10.1145/1989493.1989518 
LibreCat: /record/19026
DOI: 10.1145/1989493.1989518

Effert, S. (2011). Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen. Universität Paderborn.
LibreCat: /record/19040

Briest, P., Krysta, P., &; Vöcking, B. (2011). Approximation Techniques for Utilitarian Mechanism Design. SIAM Journal on Computing, 1587–1622.https://doi.org/10.1137/090772988 
LibreCat: /record/23739
DOI: 10.1137/090772988

Briest, P., &; Krysta, P. (2011). Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. SIAM Journal on Computing, 1554–1586.https://doi.org/10.1137/090752353 
LibreCat: /record/23740
DOI: 10.1137/090752353

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 SOFSEM 2011: Theory and Practice of Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-18381-2_15 
LibreCat: /record/20709
DOI: 10.1007/978-3-642-18381-2_15

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 
LibreCat: /record/20710
DOI: 10.1007/978-3-642-22012-8_52

Renken, H., Laroque, C., &; Fischer, M. (2011). An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization. In Proceedings of The 25th European Simulation and Modelling Conference - ESM2011.
LibreCat: /record/18193

Suess, T., Koch, C., Jähn, C., Fischer, M., &; Meyer auf der Heide, F. (2011). Parallel Out-of-Core Occlusion Culling.
LibreCat: /record/18194

Vöcking, B., Hoefer, M., Skopalik, A., Penn, M., &; Polukarov, M. (2011). Considerate Equilibrium. In IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, (pp. 234--239).
LibreCat: /record/18568

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 
LibreCat: /record/657
DOI: 10.1007/978-3-642-28209-6_3

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

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 
LibreCat: /record/664
DOI: 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 
LibreCat: /record/667
DOI: 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 
LibreCat: /record/16410
DOI: 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 
LibreCat: /record/16412
DOI: 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 
LibreCat: /record/16428
DOI: 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 
LibreCat: /record/16447
DOI: 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 
LibreCat: /record/16451
DOI: 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 
LibreCat: /record/16453
DOI: 10.1145/1989493.1989515