| 1 | -- | 3 | Christos Kaklamanis, Kirk Pruhs. Foreword of the Special Issue Dedicated to the 2013 Workshop on Approximation and Online Algorithms |
| 4 | -- | 18 | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov. On Fixed Cost k-Flow Problems |
| 19 | -- | 44 | Jaroslaw Byrka, Shanfei Li, Bartosz Rybicki. Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties) |
| 45 | -- | 59 | Matús Mihalák, Rastislav Srámek, Peter Widmayer. Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs |
| 60 | -- | 93 | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono. Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation |
| 94 | -- | 110 | Trevor I. Fenner, Oded Lachish, Alexandru Popa. Min-Sum 2-Paths Problems |
| 111 | -- | 132 | Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau. Approximating the Sparsest k-Subgraph in Chordal Graphs |
| 133 | -- | 152 | Ofer Neiman. Low Dimensional Embeddings of Doubling Metrics |
| 153 | -- | 190 | Marek Cygan, Lukasz Jez, Jirí Sgall. Online Knapsack Revisited |
| 191 | -- | 222 | Hemant Tyagi, Sebastian U. Stich, Bernd Gärtner. On Two Continuum Armed Bandit Problems in High Dimensions |