Abstract is missing.
- Min-Sum 2-Paths ProblemsTrevor I. Fenner, Oded Lachish, Alexandru Popa. 1-11 [doi]
- Low Dimensional Embeddings of Doubling MetricsOfer Neiman. 12-23 [doi]
- Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum ViolationYuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono. 24-36 [doi]
- On the max min vertex cover ProblemNicolas Boria, Federico Della Croce, Vangelis Th. Paschos. 37-48 [doi]
- On Fixed Cost k-Flow ProblemsMohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov. 49-60 [doi]
- Approximating the Quadratic Knapsack Problem on Special Graph ClassesUlrich Pferschy, Joachim Schauer. 61-72 [doi]
- Approximating the Sparsest k-Subgraph in Chordal GraphsRémi Watrigant, Marin Bougeret, Rodolphe Giroudeau. 73-84 [doi]
- Improved Approximation Algorithm for k-Level UFL with Penalties, a Simplistic View on Randomizing the Scaling ParameterJaroslaw Byrka, Shanfei Li, Bartosz Rybicki. 85-96 [doi]
- Inapproximability Results for Graph Convexity ParametersErika M. M. Coelho, Mitre Costa Dourado, Rudini M. Sampaio. 97-107 [doi]
- Continuum Armed Bandit Problem of Few Variables in High DimensionsHemant Tyagi, Bernd Gärtner. 108-119 [doi]
- Approximability of Connected FactorsKamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul. 120-131 [doi]
- Reordering Buffer Management with AdviceAnna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee. 132-143 [doi]
- Online Knapsack RevisitedMarek Cygan, Lukasz Jez. 144-155 [doi]
- Counting Approximately-Shortest Paths in Directed Acyclic GraphsMatús Mihalák, Rastislav Srámek, Peter Widmayer. 156-167 [doi]