Parameterized and Exact Computation

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

Editors:

ISBN: 978-3-319-03897-1 (Print) 978-3-319-03898-8 (Online)

Table of contents (30 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-3

    Exact Complexity and Satisfiability

  3. No Access

    Book Chapter

    Pages 4-15

    The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups

  4. No Access

    Book Chapter

    Pages 16-27

    Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints

  5. No Access

    Book Chapter

    Pages 28-40

    Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem

  6. No Access

    Book Chapter

    Pages 41-53

    The Fine Details of Fast Dynamic Programming over Tree Decompositions

  7. No Access

    Book Chapter

    Pages 54-65

    On Subexponential and FPT-Time Inapproximability

  8. No Access

    Book Chapter

    Pages 66-77

    Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization

  9. No Access

    Book Chapter

    Pages 78-83

    Chain Minors Are FPT

  10. No Access

    Book Chapter

    Pages 84-96

    Incompressibility of H-Free Edge Modification

  11. No Access

    Book Chapter

    Pages 97-109

    Contracting Few Edges to Remove Forbidden Induced Subgraphs

  12. No Access

    Book Chapter

    Pages 110-122

    Fixed-Parameter and Approximation Algorithms: A New Look

  13. No Access

    Book Chapter

    Pages 123-136

    Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs

  14. No Access

    Book Chapter

    Pages 137-149

    Computing Tree-Depth Faster Than 2 n

  15. No Access

    Book Chapter

    Pages 150-162

    Faster Exact Algorithms for Some Terminal Set Problems

  16. No Access

    Book Chapter

    Pages 163-176

    Parameterized Algorithms for Modular-Width

  17. No Access

    Book Chapter

    Pages 177-188

    A Faster FPT Algorithm for Bipartite Contraction

  18. No Access

    Book Chapter

    Pages 189-201

    On the Ordered List Subgraph Embedding Problems

  19. No Access

    Book Chapter

    Pages 202-215

    A Completeness Theory for Polynomial (Turing) Kernelization

  20. No Access

    Book Chapter

    Pages 216-229

    On Sparsification for Computing Treewidth

  21. No Access

    Book Chapter

    Pages 230-242

    The Jump Number Problem: Exact and Parameterized

previous Page of 2