Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
792 Publications
2011 | Conference Paper | LibreCat-ID: 657
Abshoff, Sebastan, et al. “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks.” Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 2011, pp. 13–27, doi:10.1007/978-3-642-28209-6_3.
LibreCat
| Files available
| DOI
2011 | Mastersthesis | LibreCat-ID: 663
Swierkot, Kamil. Complexity Classes for Local Computation. Universität Paderborn, 2011.
LibreCat
2011 | Conference Paper | LibreCat-ID: 664
Gehweiler, Joachim, et al. “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment.” Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2011, pp. 31--40, doi:10.1007/978-3-642-31500-8_4.
LibreCat
| Files available
| DOI
2011 | Conference (Editor) | LibreCat-ID: 667
Meyer auf der Heide, Friedhelm, and Rajmohan Rajaraman, editors. 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures. 2011, doi:10.1145/1989493.
LibreCat
| DOI
2011 | Conference Paper | LibreCat-ID: 16410
Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.” 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), no. 6543, Springer, 2011, pp. 178–89, doi:10.1007/978-3-642-18381-2_15.
LibreCat
| DOI
2011 | Book Chapter | LibreCat-ID: 16412
Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing - How Do I Get My Stuff into the Boxes.” Algorithms Unplugged, 2011, pp. 367–74, doi:10.1007/978-3-642-15328-0_38.
LibreCat
| DOI
2011 | Conference Paper | LibreCat-ID: 16428
Rajaraman, Rajmohan, and Friedhelm Meyer auf der Heide. Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11. 2011, doi:10.1145/1989493.
LibreCat
| DOI
2011 | Journal Article | LibreCat-ID: 16447
Degener, Bastian, et al. “A Survey on Relay Placement with Runtime and Approximation Guarantees.” Computer Science Review, 2011, pp. 57–68, doi:10.1016/j.cosrev.2010.09.005.
LibreCat
| DOI
2011 | Conference Paper | LibreCat-ID: 16451
Brandes, Philipp, et al. “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.” SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity, 2011, pp. 138–49, doi:10.1016/j.tcs.2012.10.056.
LibreCat
| DOI
2011 | Conference Paper | LibreCat-ID: 16453
Degener, Bastian, et al. “A Tight Runtime Bound for Synchronous Gathering of Autonomous Robots with Limited Visibility.” Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011, doi:10.1145/1989493.1989515.
LibreCat
| DOI