| 1 | -- | 26 | Sebastian Ordyniak, Alexandru Popa. A Parameterized Study of Maximum Generalized Pattern Matching Problems |
| 27 | -- | 52 | Danny Z. Chen, Jian Li, Hongyu Liang, Haitao Wang. Matroid and Knapsack Center Problems |
| 53 | -- | 83 | Babak Behsaz, Mohammad R. Salavatipour, Zoya Svitkina. New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem |
| 84 | -- | 117 | Marie-Louise Bruner, Martin Lackner. A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs |
| 118 | -- | 137 | Yixin Cao, Dániel Marx. Chordal Editing is Fixed-Parameter Tractable |
| 138 | -- | 157 | Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano. n) Time |
| 158 | -- | 185 | Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou. Two-Page Book Embeddings of 4-Planar Graphs |
| 186 | -- | 0 | Dieter Kratsch, Ioan Todinca. Guest Editorial: Selected Papers from WG 2014 |
| 187 | -- | 204 | Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad. Separation Dimension of Graphs and Hypergraphs |
| 205 | -- | 217 | Eglantine Camby, Oliver Schaudt. k-Free Graphs |
| 218 | -- | 253 | Sigve Hortemo Sæther, Jan Arne Telle. Between Treewidth and Clique-Width |