1. On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties

   • Pinar Heggernes
   • Pim van ’t Hof
   • Yngve Villanger

   OriginalPaper 16 January 2014 Pages: 687 - 713

   

2. An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem

   • Bundit Laekhanukit

   OriginalPaper 14 January 2014 Pages: 714 - 733

   

3. Max-Cut Parameterized Above the Edwards-Erdős Bound

   • Robert Crowston
   • Mark Jones
   • Matthias Mnich

   OriginalPaper 24 January 2014 Pages: 734 - 757

   

4. k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth

   • A. Kosowski
   • B. Li
   • K. Suchan

   OriginalPaper 23 January 2014 Pages: 758 - 777

   

5. A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization

   • Yasuaki Kobayashi
   • Hisao Tamaki

   OriginalPaper Open access 30 January 2014 Pages: 778 - 790

6. Improved Space-Time Tradeoffs for Approximate Full-Text Indexing with One Edit Error

   • Djamal Belazzougui

   OriginalPaper 29 January 2014 Pages: 791 - 817

   

7. Parameterized Algorithms for the 2-Clustering Problem with Minimum Sum and Minimum Sum of Squares Objective Functions

   • Bang Ye Wu
   • Li-Hsuan Chen

   OriginalPaper 07 February 2014 Pages: 818 - 835

   

8. An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets

   • Petr A. Golovach
   • Pinar Heggernes
   • Yngve Villanger

   OriginalPaper 08 April 2014 Pages: 836 - 859

   

9. \(D^2\)-Tree: A New Overlay with Deterministic Bounds

   • Gerth Stølting Brodal
   • Spyros Sioutas
   • Christos Zaroliagis

   OriginalPaper 08 April 2014 Pages: 860 - 883

   

10. Program Size and Temperature in Self-Assembly

    • Ho-Lin Chen
    • David Doty
    • Shinnosuke Seki

    OriginalPaper 04 April 2014 Pages: 884 - 899