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

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

Overview of attention for book
Cover of 'Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Balanced Hashing, Color Coding and Approximate Counting
  3. Altmetric Badge
    Chapter 2 Kernelization: New Upper and Lower Bound Techniques
  4. Altmetric Badge
    Chapter 3 A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
  5. Altmetric Badge
    Chapter 4 Planar Capacitated Dominating Set Is W [1]-Hard
  6. Altmetric Badge
    Chapter 5 Boolean-Width of Graphs
  7. Altmetric Badge
    Chapter 6 The Complexity of Satisfiability of Small Depth Circuits
  8. Altmetric Badge
    Chapter 7 On Finding Directed Trees with Many Leaves
  9. Altmetric Badge
    Chapter 8 Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
  10. Altmetric Badge
    Chapter 9 Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover
  11. Altmetric Badge
    Chapter 10 What Makes Equitable Connected Partition Easy
  12. Altmetric Badge
    Chapter 11 Improved Induced Matchings in Sparse Graphs
  13. Altmetric Badge
    Chapter 12 Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs
  14. Altmetric Badge
    Chapter 13 An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
  15. Altmetric Badge
    Chapter 14 An Exponential Time 2-Approximation Algorithm for Bandwidth
  16. Altmetric Badge
    Chapter 15 On Digraph Width Measures in Parameterized Algorithmics
  17. Altmetric Badge
    Chapter 16 The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension
  18. Altmetric Badge
    Chapter 17 Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms
  19. Altmetric Badge
    Chapter 18 Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs
  20. Altmetric Badge
    Chapter 19 A Probabilistic Approach to Problems Parameterized above or below Tight Bounds
  21. Altmetric Badge
    Chapter 20 Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor
  22. Altmetric Badge
    Chapter 21 Partitioning into Sets of Bounded Cardinality
  23. Altmetric Badge
    Chapter 22 Two Edge Modification Problems without Polynomial Kernels
  24. Altmetric Badge
    Chapter 23 On the Directed Degree-Preserving Spanning Tree Problem
  25. Altmetric Badge
    Chapter 24 Even Faster Algorithm for Set Splitting !
  26. Altmetric Badge
    Chapter 25 Stable Assignment with Couples: Parameterized Complexity and Local Search
  27. Altmetric Badge
    Chapter 26 Improved Parameterized Algorithms for the Kemeny Aggregation Problem
  28. Altmetric Badge
    Chapter 27 Computing Pathwidth Faster Than 2 n
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • Good Attention Score compared to outputs of the same age (68th percentile)
  • Above-average Attention Score compared to outputs of the same age and source (59th percentile)

Mentioned by

twitter
2 X users
wikipedia
1 Wikipedia page

Citations

dimensions_citation
4 Dimensions
Summary X Wikipedia Dimensions citations

This page is provided by Altmetric.