Parameterized and Exact Computation

8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers

  • Gregory Gutin
  • Stefan Szeider
Conference proceedings IPEC 2013

DOI: 10.1007/978-3-319-03898-8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8246)

Table of contents (30 papers)

  1. Front Matter
  2. Exact Complexity and Satisfiability
    Russell Impagliazzo, Ramamohan Paturi
    Pages 1-3
  3. Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints
    Rémy Belmonte, Petr A. Golovach, Pim van ’t Hof, Daniël Paulusma
    Pages 16-27
  4. Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem
    Bernhard Bliem, Reinhard Pichler, Stefan Woltran
    Pages 28-40
  5. The Fine Details of Fast Dynamic Programming over Tree Decompositions
    Hans L. Bodlaender, Paul Bonsma, Daniel Lokshtanov
    Pages 41-53
  6. On Subexponential and FPT-Time Inapproximability
    Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
    Pages 54-65
  7. Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization
    Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Émeric Tourniaire
    Pages 66-77
  8. Chain Minors Are FPT
    Jarosław Błasiok, M. Kamiński
    Pages 78-83
  9. Incompressibility of H-Free Edge Modification
    Leizhen Cai, Yufei Cai
    Pages 84-96
  10. Contracting Few Edges to Remove Forbidden Induced Subgraphs
    Leizhen Cai, Chengwei Guo
    Pages 97-109
  11. Fixed-Parameter and Approximation Algorithms: A New Look
    Rajesh Chitnis, MohammadTaghi Hajiaghayi, Guy Kortsarz
    Pages 110-122
  12. Computing Tree-Depth Faster Than 2n
    Fedor V. Fomin, Archontia C. Giannopoulou, Michał Pilipczuk
    Pages 137-149
  13. Faster Exact Algorithms for Some Terminal Set Problems
    Rajesh Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
    Pages 150-162
  14. Parameterized Algorithms for Modular-Width
    Jakub Gajarský, Michael Lampis, Sebastian Ordyniak
    Pages 163-176
  15. A Faster FPT Algorithm for Bipartite Contraction
    Sylvain Guillemot, Dániel Marx
    Pages 177-188
  16. On the Ordered List Subgraph Embedding Problems
    Olawale Hassan, Iyad Kanj, Daniel Lokshtanov, Ljubomir Perković
    Pages 189-201
  17. A Completeness Theory for Polynomial (Turing) Kernelization
    Danny Hermelin, Stefan Kratsch, Karolina Sołtys, Magnus Wahlström, Xi Wu
    Pages 202-215
  18. On Sparsification for Computing Treewidth
    Bart M. P. Jansen
    Pages 216-229

About these proceedings


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.


approximation meta-theorems dynamic programming exact algorithms parametrized complexity representative sets

Editors and affiliations

  • Gregory Gutin
    • 1
  • Stefan Szeider
    • 2
  1. 1.Royal Holloway, University of LondonEghamUK
  2. 2.Institute of Information SystemsVienna University of TechnologyViennaAustria

Bibliographic information

  • Copyright Information Springer International Publishing Switzerland 2013
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-03897-1
  • Online ISBN 978-3-319-03898-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349