| 2014 | Approximation and Online Algorithms - 11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers Christos Kaklamanis, Kirk Pruhs |
| 2013 | Approximability of Connected Factors. Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul |
| 2013 | Approximating the Quadratic Knapsack Problem on Special Graph Classes. Ulrich Pferschy, Joachim Schauer |
| 2013 | Approximating the Sparsest k-Subgraph in Chordal Graphs. Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau |
| 2013 | Continuum Armed Bandit Problem of Few Variables in High Dimensions. Hemant Tyagi, Bernd Gärtner |
| 2013 | Counting Approximately-Shortest Paths in Directed Acyclic Graphs. Matús Mihalák, Rastislav Srámek, Peter Widmayer |
| 2013 | Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono |
| 2013 | Improved Approximation Algorithm for k-Level UFL with Penalties, a Simplistic View on Randomizing the Scaling Parameter. Jaroslaw Byrka, Shanfei Li, Bartosz Rybicki |
| 2013 | Inapproximability Results for Graph Convexity Parameters. Erika M. M. Coelho, Mitre Costa Dourado, Rudini M. Sampaio |
| 2013 | Low Dimensional Embeddings of Doubling Metrics. Ofer Neiman |
| 2013 | Min-Sum 2-Paths Problems. Trevor I. Fenner, Oded Lachish, Alexandru Popa |
| 2013 | On Fixed Cost k-Flow Problems. MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
| 2013 | On the max min vertex cover Problem. Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos |
| 2013 | Online Knapsack Revisited. Marek Cygan, Lukasz Jez |
| 2013 | Reordering Buffer Management with Advice. Anna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee |