Volume 75, Issue 2

June 2016

Special Issue: Parameterized and Exact Computation

Issue Editors:

10 articles in this issue

Foreword: Special Issue on IPEC 2014
Marek Cygan
Pinar Heggernes
EditorialNotes Open access 22 April 2016 Pages: 255 - 256
Erratum to: Foreword: Special Issue on IPEC 2014
Marek Cygan
Pinar Heggernes
Erratum 10 May 2016 Pages: 257 - 257
The Parameterized Complexity of Geometric Graph Isomorphism
V. Arvind
Gaurav Rattan
OriginalPaper 07 July 2015 Pages: 258 - 276
On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth
Igor Razgon
OriginalPaper 03 September 2015 Pages: 277 - 294
Finding Shortest Paths Between Graph Colourings
Matthew Johnson
Dieter Kratsch
Daniël Paulusma
OriginalPaper 12 May 2015 Pages: 295 - 321
Solving Linear Equations Parameterized by Hamming Weight
V. Arvind
Johannes Köbler
Jacobo Torán
OriginalPaper 14 December 2015 Pages: 322 - 338
The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments
Patrick Traxler
OriginalPaper 16 February 2016 Pages: 339 - 362
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
Jannis Bulian
Anuj Dawar
OriginalPaper Open access 11 August 2015 Pages: 363 - 382
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem
Gregory Gutin
Stefan Kratsch
Magnus Wahlström
OriginalPaper 18 March 2015 Pages: 383 - 402
AND-Compression of NP-Complete Problems: Streamlined Proof and Minor Observations
Holger Dell
OriginalPaper 27 January 2016 Pages: 403 - 423

Search