| 1 | -- | 17 | Harish Chandran, Nikhil Gopalkrishnan, John H. Reif. Tile Complexity of Approximate Squares |
| 18 | -- | 50 | Surender Baswana, Neelesh Khanna. Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs |
| 51 | -- | 86 | Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio. Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks |
| 87 | -- | 92 | Raphael Yuster. Maximum Matching in Regular and Almost Regular Graphs |
| 93 | -- | 112 | Quentin F. Stout. Isotonic Regression via Partitioning |
| 113 | -- | 152 | Christos Koufogiannakis, Neal E. Young. Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost |
| 153 | -- | 172 | David Doty, Lila Kari, Benoît Masson. Negative Interactions in Irreversible Self-assembly |
| 173 | -- | 186 | Lijun Chang, Jeffrey Xu Yu, Lu Qin. Fast Maximal Cliques Enumeration in Sparse Graphs |
| 187 | -- | 210 | Chien-Chung Huang, Zoya Svitkina. Donation Center Location Problem |
| 211 | -- | 223 | Elias Koutsoupias, Angelina Vidali. φ for Truthful Scheduling Mechanisms |