↓ 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 Parameterized and Exact Computation
  3. Altmetric Badge
    Chapter 2 Protrusions in Graphs and Their Applications
  4. Altmetric Badge
    Chapter 3 Parameterized Complexity Results in Symmetry Breaking
  5. Altmetric Badge
    Chapter 4 On the Kernelization Complexity of Colorful Motifs
  6. Altmetric Badge
    Chapter 5 Partial Kernelization for Rank Aggregation: Theory and Experiments
  7. Altmetric Badge
    Chapter 6 Enumerate and Measure: Improving Parameter Budget Management
  8. Altmetric Badge
    Chapter 7 On the Exact Complexity of Evaluating Quantified k-CNF
  9. Altmetric Badge
    Chapter 8 Cluster Editing: Kernelization Based on Edge Cuts
  10. Altmetric Badge
    Chapter 9 Computing the Deficiency of Housing Markets with Duplicate Houses
  11. Altmetric Badge
    Chapter 10 A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application
  12. Altmetric Badge
    Chapter 11 An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion
  13. Altmetric Badge
    Chapter 12 Multivariate Complexity Analysis of Swap Bribery
  14. Altmetric Badge
    Chapter 13 Parameterizing by the Number of Numbers
  15. Altmetric Badge
    Chapter 14 Are there any good digraph width measures?
  16. Altmetric Badge
    Chapter 15 On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems
  17. Altmetric Badge
    Chapter 16 Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming
  18. Altmetric Badge
    Chapter 17 On the Grundy Number of a Graph
  19. Altmetric Badge
    Chapter 18 Exponential Time Complexity of Weighted Counting of Independent Sets
  20. Altmetric Badge
    Chapter 19 The Exponential Time Complexity of Computing the Probability That a Graph Is Connected
  21. Altmetric Badge
    Chapter 20 Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
  22. Altmetric Badge
    Chapter 21 Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier
  23. Altmetric Badge
    Chapter 22 Proper Interval Vertex Deletion
Attention for Chapter 12: Multivariate Complexity Analysis of Swap Bribery
Altmetric Badge

Citations

dimensions_citation
4 Dimensions
Summary Dimensions citations
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
Multivariate Complexity Analysis of Swap Bribery
Chapter number 12
Book title
Parameterized and Exact Computation
Published in
arXiv, December 2010
DOI 10.1007/978-3-642-17493-3_12
Book ISBNs
978-3-64-217492-6, 978-3-64-217493-3
Authors

Britta Dorn, Ildikó Schlotter

View on publisher site

This page is provided by Altmetric.