Tile Complexity of Approximate Squares Harish ChandranNikhil GopalkrishnanJohn Reif OriginalPaper 22 February 2012 Pages: 1 - 17
Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs Surender BaswanaNeelesh Khanna OriginalPaper 23 February 2012 Pages: 18 - 50
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks Serafino CiceroneGianlorenzo D’AngeloVinicio Maurizio OriginalPaper 01 March 2012 Pages: 51 - 86
Maximum Matching in Regular and Almost Regular Graphs Raphael Yuster OriginalPaper 24 February 2012 Pages: 87 - 92
Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost Christos KoufogiannakisNeal E. Young OriginalPaper 14 March 2012 Pages: 113 - 152
Negative Interactions in Irreversible Self-assembly David DotyLila KariBenoît Masson OriginalPaper 07 March 2012 Pages: 153 - 172
Fast Maximal Cliques Enumeration in Sparse Graphs Lijun ChangJeffrey Xu YuLu Qin OriginalPaper 06 March 2012 Pages: 173 - 186
Donation Center Location Problem Chien-Chung HuangZoya Svitkina OriginalPaper 02 March 2012 Pages: 187 - 210
A Lower Bound of 1+φ for Truthful Scheduling Mechanisms Elias KoutsoupiasAngelina Vidali OriginalPaper 06 March 2012 Pages: 211 - 223