1. Parameterized Algorithms for Graph Partitioning Problems

   • Hadas Shachnai
   • Meirav Zehavi

   OriginalPaper 05 September 2016 Pages: 721 - 738

   

2. Online Regenerator Placement

   • George B. Mertzios
   • Mordechai Shalom
   • Shmuel Zaks

   OriginalPaper 28 September 2016 Pages: 739 - 754

   

3. On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth

   • Igor Razgon

   OriginalPaper 17 October 2016 Pages: 755 - 776

   

4. Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion

   • Julien Baste
   • Luerbio Faria
   • Ignasi Sau

   OriginalPaper 27 October 2016 Pages: 777 - 794

   

5. Parameterized Complexity of Secluded Connectivity Problems

   • Fedor V. Fomin
   • Petr A. Golovach
   • Alexander S. Kulikov

   OriginalPaper 10 November 2016 Pages: 795 - 819

   

6. Adversarial Multiple Access Channels with Individual Injection Rates

   • Lakshmi Anantharamu
   • Bogdan S. Chlebus
   • Mariusz A. Rokicki

   OriginalPaper 28 November 2016 Pages: 820 - 850

7. The Parameterized Space Complexity of Embedding Along a Path

   • Hubie Chen
   • Moritz Müller

   OriginalPaper 03 December 2016 Pages: 851 - 870

   

8. A PTAS for the Geometric Connected Facility Location Problem

   • Flávio K. Miyazawa
   • Lehilton L. C. Pedrosa
   • Renata G. D. de Souza

   OriginalPaper 02 February 2017 Pages: 871 - 892

   

9. The 2-Rainbow Domination of Sierpiński Graphs and Extended Sierpiński Graphs

   • Jia-Jie Liu
   • Shun-Chieh Chang
   • Chiou-Jiun Lin

   OriginalPaper 13 March 2017 Pages: 893 - 906

   

10. The Complexity of Optimal Design of Temporally Connected Graphs

    • Eleni C. Akrida
    • Leszek Gąsieniec
    • Paul G. Spirakis

    OriginalPaper Open access 03 April 2017 Pages: 907 - 944