1. The Parameterized Complexity of the Shared Center Problem

   • Zhi-Zhong Chen
   • Wenji Ma
   • Lusheng Wang

   OriginalPaper 20 December 2012 Pages: 269 - 293

   

2. Necklaces, Convolutions, and X+Y

   • David Bremner
   • Timothy M. Chan
   • Perouz Taslakian

   OriginalPaper 28 December 2012 Pages: 294 - 314

   

3. Opaque Sets

   • Adrian Dumitrescu
   • Minghui Jiang
   • János Pach

   OriginalPaper 28 December 2012 Pages: 315 - 334

   

4. On the Complexity of Strongly Connected Components in Directed Hypergraphs

   • Xavier Allamigeon

   OriginalPaper 04 January 2013 Pages: 335 - 369

   

5. New Algorithms for Facility Location Problems on the Real Line

   • Danny Z. Chen
   • Haitao Wang

   OriginalPaper 08 January 2013 Pages: 370 - 383

   

6. Substring Range Reporting

   • Philip Bille
   • Inge Li Gørtz

   OriginalPaper 09 January 2013 Pages: 384 - 396

   

7. Switching to Directional Antennas with Constant Increase in Radius and Hop Distance

   • Prosenjit Bose
   • Paz Carmi
   • Anil Maheshwari

   OriginalPaper 10 January 2013 Pages: 397 - 409

   

8. Outlier Respecting Points Approximation

   • Danny Z. Chen
   • Haitao Wang

   OriginalPaper 10 January 2013 Pages: 410 - 430

   

9. On Minimum Witnesses for Boolean Matrix Multiplication

   • Keren Cohen
   • Raphael Yuster

   OriginalPaper 12 January 2013 Pages: 431 - 442

10. Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems

    • M. Reza Khani
    • Mohammad R. Salavatipour

    OriginalPaper 19 January 2013 Pages: 443 - 460

    

11. Limitations of Incremental Dynamic Programming

    • Stasys Jukna

    OriginalPaper 22 January 2013 Pages: 461 - 492