1. A Parameterized Study of Maximum Generalized Pattern Matching Problems

   • Sebastian Ordyniak
   • Alexandru Popa

   OriginalPaper 17 June 2015 Pages: 1 - 26

2. Matroid and Knapsack Center Problems

   • Danny Z. Chen
   • Jian Li
   • Haitao Wang

   OriginalPaper 12 August 2015 Pages: 27 - 52

   

3. New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem

   • Babak Behsaz
   • Mohammad R. Salavatipour
   • Zoya Svitkina

   OriginalPaper 05 June 2015 Pages: 53 - 83

   

4. A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs

   • Marie-Louise Bruner
   • Martin Lackner

   OriginalPaper 16 June 2015 Pages: 84 - 117

   

5. Chordal Editing is Fixed-Parameter Tractable

   • Yixin Cao
   • Dániel Marx

   OriginalPaper 27 June 2015 Pages: 118 - 137

   

6. Computing Directed Pathwidth in \(O(1.89^{n})\) Time

   • Kenta Kitsunai
   • Yasuaki Kobayashi
   • Toshihiro Tano

   OriginalPaper 10 June 2015 Pages: 138 - 157

7. Two-Page Book Embeddings of 4-Planar Graphs

   • Michael A. Bekos
   • Martin Gronemann
   • Chrysanthi N. Raftopoulou

   OriginalPaper 16 June 2015 Pages: 158 - 185

   

8. Guest Editorial: Selected Papers from WG 2014

   • Dieter Kratsch
   • Ioan Todinca

   EditorialNotes 18 February 2016 Pages: 186 - 186

9. Separation Dimension of Graphs and Hypergraphs

   • Manu Basavaraju
   • L. Sunil Chandran
   • Deepak Rajendraprasad

   OriginalPaper 18 August 2015 Pages: 187 - 204

   

10. A New Characterization of \(P_k\)-Free Graphs

    • Eglantine Camby
    • Oliver Schaudt

    OriginalPaper 24 March 2015 Pages: 205 - 217

    

11. Between Treewidth and Clique-Width

    • Sigve Hortemo Sæther
    • Jan Arne Telle

    OriginalPaper 21 July 2015 Pages: 218 - 253