1. Tile Complexity of Approximate Squares

   • Harish Chandran
   • Nikhil Gopalkrishnan
   • John Reif

   OriginalPaper 22 February 2012 Pages: 1 - 17

   

2. Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs

   • Surender Baswana
   • Neelesh Khanna

   OriginalPaper 23 February 2012 Pages: 18 - 50

   

3. Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks

   • Serafino Cicerone
   • Gianlorenzo D’Angelo
   • Vinicio Maurizio

   OriginalPaper 01 March 2012 Pages: 51 - 86

   

4. Maximum Matching in Regular and Almost Regular Graphs

   • Raphael Yuster

   OriginalPaper 24 February 2012 Pages: 87 - 92

5. Isotonic Regression via Partitioning

   • Quentin F. Stout

   OriginalPaper 14 March 2012 Pages: 93 - 112

   

6. Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost

   • Christos Koufogiannakis
   • Neal E. Young

   OriginalPaper 14 March 2012 Pages: 113 - 152

   

7. Negative Interactions in Irreversible Self-assembly

   • David Doty
   • Lila Kari
   • Benoît Masson

   OriginalPaper 07 March 2012 Pages: 153 - 172

   

8. Fast Maximal Cliques Enumeration in Sparse Graphs

   • Lijun Chang
   • Jeffrey Xu Yu
   • Lu Qin

   OriginalPaper 06 March 2012 Pages: 173 - 186

   

9. Donation Center Location Problem

   • Chien-Chung Huang
   • Zoya Svitkina

   OriginalPaper 02 March 2012 Pages: 187 - 210

   

10. A Lower Bound of 1+φ for Truthful Scheduling Mechanisms

    • Elias Koutsoupias
    • Angelina Vidali

    OriginalPaper 06 March 2012 Pages: 211 - 223