Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon A. GarcíaP. JodráJ. Tejel OriginalPaper 06 December 2011 Pages: 481 - 497
Improved Approximation Algorithms for the Spanning Star Forest Problem Ning ChenRoee EngelbergGyanit Singh OriginalPaper 21 December 2011 Pages: 498 - 516
The Parameterized Complexity of Unique Coverage and Its Variants Neeldhara MisraHannes MoserSomnath Sikdar OriginalPaper 28 December 2011 Pages: 517 - 544
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems MohammadHossein BateniJulia Chuzhoy OriginalPaper 29 December 2011 Pages: 545 - 561
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots Paola FlocchiniDavid IlcinkasNicola Santoro OriginalPaper 07 January 2012 Pages: 562 - 583
Computing Optimal Steiner Trees in Polynomial Space Fedor V. FominFabrizio GrandoniSaket Saurabh OriginalPaper 19 January 2012 Pages: 584 - 604
Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy Tak-Wah LamLap-Kei LeePrudence W. H. Wong OriginalPaper 27 January 2012 Pages: 605 - 633
Stochastic Budget Optimization in Internet Advertising Bhaskar DasGuptaS. Muthukrishnan OriginalPaper 08 February 2012 Pages: 634 - 661
Succinct 2D Dictionary Matching Shoshana NeuburgerDina Sokol OriginalPaper Open access 02 February 2012 Pages: 662 - 684
Sublinear Algorithms for Approximating String Compressibility Sofya RaskhodnikovaDana RonAdam Smith OriginalPaper 22 February 2012 Pages: 685 - 709