Gregory Gutin

Parameterized and Exact Computation: 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers - Lecture Notes in Computer Science Gregory Gutin 2013 edition

Jacket Description/Back: This book constitutes the thoroughly refereed post-conference proceedings of the 8th International Symposium on Parameterized and Exact Computation, IPEC 2013, in Sophia Antipolis, France, in September 2013. The 29 revised full papers presented were carefully reviewed and selected from 58 submissions. The topics addressed cover research in all aspects of parameterized/exact algorithms and complexity including but are not limited to new techniques for the design and analysis of parameterized and exact algorithms, fixed-parameter tractability results, parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications, applications of parameterized and exact computation, and implementation issues of parameterized and exact algorithms. Table of Contents: Exact Complexity and Satisfiability.-The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups.-Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.-Declarative Dynamic Programming as an Alternative Realization of Courcelle s Theorem.- The Fine Details of Fast Dynamic Programming over Tree Decompositions.-On Subexponential and FPT-Time Inapproximability.-Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization.-Chain Minors Are FPT.-Incompressibility of "H"-Free Edge Modification.-Contracting Few Edges to Remove Forbidden Induced Subgraphs.-Fixed-Parameter and Approximation Algorithms: A New Look.-Subgraphs Satisfying MSO Properties on "z"-Topologically Orderable Digraphs.-Computing Tree-Depth Faster Than 2"n.-"Faster Exact Algorithms for Some Terminal Set Problems.-Parameterized Algorithms for Modular-Width.-A Faster FPT Algorithm for Bipartite Contraction.-On the Ordered List Subgraph Embedding Problems.-A Completeness Theory for Polynomial (Turing) Kernelization.-On Sparsification for Computing Treewidth.-The Jump Number Problem: Exact and Parameterized.-On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.-Hardness of "r"-dominating set on Graphs of Diameter ("r "+ 1).-Amalgam Width of Matroids.-On the Parameterized Complexity of Reconfiguration Problems.-FPT Algorithms for Consecutive Ones Submatrix Problems.-Upper Bounds on Boolean-Width with Applications to Exact Algorithms.-Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions.-Completeness Results for Parameterized Space Classes.-Treewidth and Pure Nash Equilibria.- Algorithms for "k"-Internal Out-Branching."