↓ Skip to main content

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
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
Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs
Published by
arXiv, June 2009
DOI 10.1007/978-3-642-11269-0
ISBNs
978-3-64-211268-3, 978-3-64-211269-0
Authors

G. Gutin, D. Karapetyan, I. Razgon

Editors

Chen, Jianer, Fomin, Fedor V.

X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users who shared this research output. Click here to find out more about how the information was compiled.
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 4. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 19 October 2022.
All research outputs
#6,666,779
of 23,555,482 outputs
Outputs from arXiv
#143,281
of 974,335 outputs
Outputs of similar age
#34,677
of 115,523 outputs
Outputs of similar age from arXiv
#204
of 510 outputs
Altmetric has tracked 23,555,482 research outputs across all sources so far. This one has received more attention than most of these and is in the 70th percentile.
So far Altmetric has tracked 974,335 research outputs from this source. They receive a mean Attention Score of 4.0. This one has done well, scoring higher than 84% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 115,523 tracked outputs that were published within six weeks on either side of this one in any source. This one has gotten more attention than average, scoring higher than 68% of its contemporaries.
We're also able to compare this research output to 510 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 59% of its contemporaries.