↓ Skip to main content

Parameterized and Exact Computation

Overview of attention for book
Cover of 'Parameterized and Exact Computation'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Path Taken for k -Path
  3. Altmetric Badge
    Chapter 2 Randomized Techniques for Parameterized Algorithms
  4. Altmetric Badge
    Chapter 3 Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n
  5. Altmetric Badge
    Chapter 4 The Exponential Time Hypothesis and the Parameterized Clique Problem
  6. Altmetric Badge
    Chapter 5 New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set
  7. Altmetric Badge
    Chapter 6 A New Algorithm for Parameterized MAX-SAT
  8. Altmetric Badge
    Chapter 7 Restricted and Swap Common Superstring: A Parameterized View
  9. Altmetric Badge
    Chapter 8 Nonblocker in H -Minor Free Graphs: Kernelization Meets Discharging
  10. Altmetric Badge
    Chapter 9 Parameterized and Exact Computation
  11. Altmetric Badge
    Chapter 10 An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs
  12. Altmetric Badge
    Chapter 11 Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help?
  13. Altmetric Badge
    Chapter 12 A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs
  14. Altmetric Badge
    Chapter 13 Instance Compression for the Polynomial Hierarchy and beyond
  15. Altmetric Badge
    Chapter 14 Polynomial Time and Parameterized Approximation Algorithms for Boxicity
  16. Altmetric Badge
    Chapter 15 Homomorphic Hashing for Sparse Coefficient Extraction
  17. Altmetric Badge
    Chapter 16 Fast Monotone Summation over Disjoint Sets
  18. Altmetric Badge
    Chapter 17 Weighted Counting of k -Matchings Is #W[1]-Hard
  19. Altmetric Badge
    Chapter 18 Computing Directed Pathwidth in O (1.89 n ) Time
  20. Altmetric Badge
    Chapter 19 MSOL Restricted Contractibility to Planar Graphs
  21. Altmetric Badge
    Chapter 20 On the Space Complexity of Parameterized Problems
  22. Altmetric Badge
    Chapter 21 Parameterized and Exact Computation
  23. Altmetric Badge
    Chapter 22 Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
  24. Altmetric Badge
    Chapter 23 Finding Dense Subgraphs of Sparse Graphs
  25. Altmetric Badge
    Chapter 24 Enumerating Neighbour and Closest Strings
  26. Altmetric Badge
    Chapter 25 An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Readers on

mendeley
2 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Parameterized and Exact Computation
Published by
Springer Berlin Heidelberg, August 2012
DOI 10.1007/978-3-642-33293-7
ISBNs
978-3-64-233292-0, 978-3-64-233293-7
Editors

Thilikos, Dimitrios M., Woeginger, Gerhard J.

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 50%
Student > Ph. D. Student 1 50%
Readers by discipline Count As %
Mathematics 1 50%
Computer Science 1 50%