Parameterized and Exact Computation

4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers

Editors:

ISBN: 978-3-642-11268-3 (Print) 978-3-642-11269-0 (Online)

Table of contents (27 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-16

    Balanced Hashing, Color Coding and Approximate Counting

  3. No Access

    Book Chapter

    Pages 17-37

    Kernelization: New Upper and Lower Bound Techniques

  4. No Access

    Book Chapter

    Pages 38-49

    A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams

  5. No Access

    Book Chapter

    Pages 50-60

    Planar Capacitated Dominating Set Is W[1]-Hard

  6. No Access

    Book Chapter

    Pages 61-74

    Boolean-Width of Graphs

  7. No Access

    Book Chapter

    Pages 75-85

    The Complexity of Satisfiability of Small Depth Circuits

  8. No Access

    Book Chapter

    Pages 86-97

    On Finding Directed Trees with Many Leaves

  9. No Access

    Book Chapter

    Pages 98-109

    Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms

  10. No Access

    Book Chapter

    Pages 110-121

    Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover

  11. No Access

    Book Chapter

    Pages 122-133

    What Makes Equitable Connected Partition Easy

  12. No Access

    Book Chapter

    Pages 134-148

    Improved Induced Matchings in Sparse Graphs

  13. No Access

    Book Chapter

    Pages 149-160

    Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs

  14. No Access

    Book Chapter

    Pages 161-172

    An Exact Algorithm for the Maximum Leaf Spanning Tree Problem

  15. No Access

    Book Chapter

    Pages 173-184

    An Exponential Time 2-Approximation Algorithm for Bandwidth

  16. No Access

    Book Chapter

    Pages 185-197

    On Digraph Width Measures in Parameterized Algorithmics

  17. No Access

    Book Chapter

    Pages 198-209

    The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension

  18. No Access

    Book Chapter

    Pages 210-221

    Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms

  19. No Access

    Book Chapter

    Pages 222-233

    Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs

  20. No Access

    Book Chapter

    Pages 234-245

    A Probabilistic Approach to Problems Parameterized above or below Tight Bounds

  21. No Access

    Book Chapter

    Pages 246-257

    Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor

previous Page of 2