Parameterized Algorithms for Graph Partitioning Problems Hadas ShachnaiMeirav Zehavi OriginalPaper 05 September 2016 Pages: 721 - 738
Online Regenerator Placement George B. MertziosMordechai ShalomShmuel Zaks OriginalPaper 28 September 2016 Pages: 739 - 754
On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth Igor Razgon OriginalPaper 17 October 2016 Pages: 755 - 776
Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion Julien BasteLuerbio FariaIgnasi Sau OriginalPaper 27 October 2016 Pages: 777 - 794
Parameterized Complexity of Secluded Connectivity Problems Fedor V. FominPetr A. GolovachAlexander S. Kulikov OriginalPaper 10 November 2016 Pages: 795 - 819
Adversarial Multiple Access Channels with Individual Injection Rates Lakshmi AnantharamuBogdan S. ChlebusMariusz A. Rokicki OriginalPaper 28 November 2016 Pages: 820 - 850
The Parameterized Space Complexity of Embedding Along a Path Hubie ChenMoritz Müller OriginalPaper 03 December 2016 Pages: 851 - 870
A PTAS for the Geometric Connected Facility Location Problem Flávio K. MiyazawaLehilton L. C. PedrosaRenata G. D. de Souza OriginalPaper 02 February 2017 Pages: 871 - 892
The 2-Rainbow Domination of Sierpiński Graphs and Extended Sierpiński Graphs Jia-Jie LiuShun-Chieh ChangChiou-Jiun Lin OriginalPaper 13 March 2017 Pages: 893 - 906
The Complexity of Optimal Design of Temporally Connected Graphs Eleni C. AkridaLeszek GąsieniecPaul G. Spirakis OriginalPaper Open access 03 April 2017 Pages: 907 - 944
