Guest Editorial: Special Issue on Parameterized and Exact Computation

Abstract

This issue is dedicated to a selection of papers from the the 8th International Symposium on Parameterized and Exact Computation (IPEC 2013), held during September 4–6, 2013, in Sophia Antipolis, France, as part of the annual ALGO meeting. Nine papers were submitted to this special issue and went through the standard refereeing process of Algorithmica. The paper “On Subexponential and FPT-time Inapproximability” by Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, and Vangelis Th. Paschos provides new insights into the question of whether the Independent Set problem would be better approximable once endowed with subexponential-time or FPT-time. The paper “Multiparameter analysis for local graph partitioning problems: using greediness for parameterization” by Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, and Emeric Tourniaire develops the new algorithmic technique of “greediness for parameterization”which applies to local graph partitioning problems. The paper “Incompressibility of H -Free Edge Modification Problems” by Leizhen Cai and Yufei Cai studies the kernel complexity of problems that ask whether one can add or delete k edges from a given graph so that the graph does not contain a fixed graph H as an induced subgraph. The paper “On the Space and Circuit Complexity of Parameterized Problems: Classes and Completeness” by Michael Elberfeld, Christoph Johannes Stockhusen, and Till Tantau shows that various natural problems lie in and may even be complete for different parameterized space classes which leads to new insights into the complexity of the considered problems. The paper “Speeding Up Dynamic Programming with Representative Sets—An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions” by Stefan Fafianie, Hans L. Bodlaender, and Jesper Nederlof provides an experimental evaluation of the technique of representative sets for the