↓ Skip to main content
What is this page? Embed badge

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 Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters
  3. Altmetric Badge
    Chapter 2 Algorithmic Graph Minors and Bidimensionality
  4. Altmetric Badge
    Chapter 3 Algorithmic Meta-theorems
  5. Altmetric Badge
    Chapter 4 Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
  6. Altmetric Badge
    Chapter 5 Fixed Structure Complexity
  7. Altmetric Badge
    Chapter 6 An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees
  8. Altmetric Badge
    Chapter 7 An  O * (1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs
  9. Altmetric Badge
    Chapter 8 New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
  10. Altmetric Badge
    Chapter 9 Capacitated Domination and Covering: A Parameterized Perspective
  11. Altmetric Badge
    Chapter 10 Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
  12. Altmetric Badge
    Chapter 11 A Purely Democratic Characterization of W[1]
  13. Altmetric Badge
    Chapter 12 Parameterized Complexity and Approximability of the SLCS Problem
  14. Altmetric Badge
    Chapter 13 FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs
  15. Altmetric Badge
    Chapter 14 Wheel-Free Deletion Is W [2]-Hard
  16. Altmetric Badge
    Chapter 15 Parameterized Derandomization
  17. Altmetric Badge
    Chapter 16 A Linear Kernel for Planar Feedback Vertex Set
  18. Altmetric Badge
    Chapter 17 Parameterized Chess
  19. Altmetric Badge
    Chapter 18 The Time Complexity of Constraint Satisfaction
  20. Altmetric Badge
    Chapter 19 A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
  21. Altmetric Badge
    Chapter 20 Exact Algorithms for Edge Domination
Attention for Chapter 19: A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
Altmetric Badge

Mentioned by

wikipedia
2 Wikipedia pages

Readers on

mendeley
5 Mendeley
Summary Wikipedia
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.
Chapter title
A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
Chapter number 19
Book title
Parameterized and Exact Computation
Published by
Springer, Berlin, Heidelberg, May 2008
DOI 10.1007/978-3-540-79723-4_19
Book ISBNs
978-3-54-079722-7, 978-3-54-079723-4
Authors

Magnus Wahlström, Wahlström, Magnus

View on publisher site
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 5 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 40%
Student > Bachelor 2 40%
Student > Master 1 20%
Readers by discipline Count As %
Computer Science 4 80%
Mathematics 1 20%

This page is provided by Altmetric.