1. Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon

   • A. García
   • P. Jodrá
   • J. Tejel

   OriginalPaper 06 December 2011 Pages: 481 - 497

   

2. Improved Approximation Algorithms for the Spanning Star Forest Problem

   • Ning Chen
   • Roee Engelberg
   • Gyanit Singh

   OriginalPaper 21 December 2011 Pages: 498 - 516

   

3. The Parameterized Complexity of Unique Coverage and Its Variants

   • Neeldhara Misra
   • Hannes Moser
   • Somnath Sikdar

   OriginalPaper 28 December 2011 Pages: 517 - 544

   

4. Approximation Algorithms for the Directed k-Tour and k-Stroll Problems

   • MohammadHossein Bateni
   • Julia Chuzhoy

   OriginalPaper 29 December 2011 Pages: 545 - 561

5. Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots

   • Paola Flocchini
   • David Ilcinkas
   • Nicola Santoro

   OriginalPaper 07 January 2012 Pages: 562 - 583

   

6. Computing Optimal Steiner Trees in Polynomial Space

   • Fedor V. Fomin
   • Fabrizio Grandoni
   • Saket Saurabh

   OriginalPaper 19 January 2012 Pages: 584 - 604

   

7. Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy

   • Tak-Wah Lam
   • Lap-Kei Lee
   • Prudence W. H. Wong

   OriginalPaper 27 January 2012 Pages: 605 - 633

   

8. Stochastic Budget Optimization in Internet Advertising

   • Bhaskar DasGupta
   • S. Muthukrishnan

   OriginalPaper 08 February 2012 Pages: 634 - 661

   

9. Succinct 2D Dictionary Matching

   • Shoshana Neuburger
   • Dina Sokol

   OriginalPaper Open access 02 February 2012 Pages: 662 - 684

   

10. Sublinear Algorithms for Approximating String Compressibility

    • Sofya Raskhodnikova
    • Dana Ron
    • Adam Smith

    OriginalPaper 22 February 2012 Pages: 685 - 709