↓ Skip to main content

Algorithms - ESA 2009

Overview of attention for book
Cover of 'Algorithms - ESA 2009'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Some Open Questions Related to Cuckoo Hashing
  3. Altmetric Badge
    Chapter 2 Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks
  4. Altmetric Badge
    Chapter 3 Improved Approximation Algorithms for Label Cover Problems
  5. Altmetric Badge
    Chapter 4 A Linear Time Algorithm for L (2,1)-Labeling of Trees
  6. Altmetric Badge
    Chapter 5 On Inducing Polygons and Related Problems
  7. Altmetric Badge
    Chapter 6 Computing 3D Periodic Triangulations
  8. Altmetric Badge
    Chapter 7 Cauchy’s Theorem for Orthogonal Polyhedra of Genus 0
  9. Altmetric Badge
    Chapter 8 Approximability of Sparse Integer Programs
  10. Altmetric Badge
    Chapter 9 Iterative Rounding for Multi-Objective Optimization Problems
  11. Altmetric Badge
    Chapter 10 A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
  12. Altmetric Badge
    Chapter 11 Constructing Delaunay Triangulations along Space-Filling Curves
  13. Altmetric Badge
    Chapter 12 Piercing Translates and Homothets of a Convex Body
  14. Altmetric Badge
    Chapter 13 Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
  15. Altmetric Badge
    Chapter 14 On Revenue Maximization in Second-Price Ad Auctions
  16. Altmetric Badge
    Chapter 15 Clustering-Based Bidding Languages for Sponsored Search
  17. Altmetric Badge
    Chapter 16 Altruism in Atomic Congestion Games
  18. Altmetric Badge
    Chapter 17 Geometric Spanners for Weighted Point Sets
  19. Altmetric Badge
    Chapter 18 k -Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees
  20. Altmetric Badge
    Chapter 19 Narrow-Shallow-Low-Light Trees with and without Steiner Points
  21. Altmetric Badge
    Chapter 20 Bounded Budget Betweenness Centrality Game for Strategic Network Formations
  22. Altmetric Badge
    Chapter 21 Exact and Approximate Equilibria for Optimal Group Network Formation
  23. Altmetric Badge
    Chapter 22 On the Performance of Approximate Equilibria in Congestion Games
  24. Altmetric Badge
    Chapter 23 Optimality and Competitiveness of Exploring Polygons by Mobile Robots
  25. Altmetric Badge
    Chapter 24 Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links
  26. Altmetric Badge
    Chapter 25 Dynamic vs. Oblivious Routing in Network Design
  27. Altmetric Badge
    Chapter 26 Algorithms Meet Art, Puzzles, and Magic
  28. Altmetric Badge
    Chapter 27 Polynomial-Time Algorithm for the Leafage of Chordal Graphs
  29. Altmetric Badge
    Chapter 28 Breaking the O ( m 2 n ) Barrier for Minimum Cycle Bases
  30. Altmetric Badge
    Chapter 29 Shape Fitting on Point Sets with Probability Distributions
  31. Altmetric Badge
    Chapter 30 An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants (Extended Abstract)
  32. Altmetric Badge
    Chapter 31 Complete Parsimony Haplotype Inference Problem and Algorithms
  33. Altmetric Badge
    Chapter 32 Linear-Time Recognition of Probe Interval Graphs
  34. Altmetric Badge
    Chapter 33 Wireless Scheduling with Power Control
  35. Altmetric Badge
    Chapter 34 On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources
  36. Altmetric Badge
    Chapter 35 Approximability of OFDMA Scheduling
  37. Altmetric Badge
    Chapter 36 Maximum Flow in Directed Planar Graphs with Vertex Capacities
  38. Altmetric Badge
    Chapter 37 A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
  39. Altmetric Badge
    Chapter 38 On Optimally Partitioning a Text to Improve Its Compression
  40. Altmetric Badge
    Chapter 39 An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
  41. Altmetric Badge
    Chapter 40 Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling
  42. Altmetric Badge
    Chapter 41 Preemptive Online Scheduling with Reordering
  43. Altmetric Badge
    Chapter 42 d -Dimensional Knapsack in the Streaming Model
  44. Altmetric Badge
    Chapter 43 Sparse Cut Projections in Graph Streams
  45. Altmetric Badge
    Chapter 44 Bipartite Graph Matchings in the Semi-streaming Model
  46. Altmetric Badge
    Chapter 45 The Oil Searching Problem
  47. Altmetric Badge
    Chapter 46 Hyperbolic Dovetailing
  48. Altmetric Badge
    Chapter 47 On the Expansion and Diameter of Bluetooth-Like Topologies
  49. Altmetric Badge
    Chapter 48 Minimum Makespan Multi-vehicle Dial-a-Ride
  50. Altmetric Badge
    Chapter 49 Google’s Auction for TV Ads
  51. Altmetric Badge
    Chapter 50 Inclusion/Exclusion Meets Measure and Conquer
  52. Altmetric Badge
    Chapter 51 Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
  53. Altmetric Badge
    Chapter 52 Counting Paths and Packings in Halves
  54. Altmetric Badge
    Chapter 53 Accelerating Multi-modal Route Planning by Access-Nodes
  55. Altmetric Badge
    Chapter 54 Parallel Algorithms for Mean-Payoff Games: An Experimental Evaluation
  56. Altmetric Badge
    Chapter 55 Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem
  57. Altmetric Badge
    Chapter 56 Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
  58. Altmetric Badge
    Chapter 57 Kernel Bounds for Disjoint Cycles and Disjoint Paths
  59. Altmetric Badge
    Chapter 58 Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem
  60. Altmetric Badge
    Chapter 59 Rank-Pairing Heaps
  61. Altmetric Badge
    Chapter 60 3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit
  62. Altmetric Badge
    Chapter 61 Hash, Displace, and Compress
  63. Altmetric Badge
    Chapter 62 Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
  64. Altmetric Badge
    Chapter 63 Contraction Bidimensionality: The Accurate Picture
  65. Altmetric Badge
    Chapter 64 Minimizing Movement: Fixed-Parameter Tractability
  66. Altmetric Badge
    Chapter 65 Storing a Compressed Function with Constant Time Access
  67. Altmetric Badge
    Chapter 66 Experimental Variations of a Theoretically Good Retrieval Data Structure
  68. Altmetric Badge
    Chapter 67 Short Labels for Lowest Common Ancestors in Trees
  69. Altmetric Badge
    Chapter 68 Disproof of the Neighborhood Conjecture with Implications to SAT
  70. Altmetric Badge
    Chapter 69 Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
Attention for Chapter 52: Counting Paths and Packings in Halves
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age and source

Mentioned by

q&a
1 Q&A thread

Readers on

mendeley
13 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.
Chapter title
Counting Paths and Packings in Halves
Chapter number 52
Book title
Algorithms - ESA 2009
Published in
Lecture notes in computer science, January 2009
DOI 10.1007/978-3-642-04128-0_52
Book ISBNs
978-3-64-204127-3, 978-3-64-204128-0
Authors

Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto, Björklund, Andreas, Husfeldt, Thore, Kaski, Petteri, Koivisto, Mikko

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Spain 1 8%
United States 1 8%
Unknown 11 85%

Demographic breakdown

Readers by professional status Count As %
Researcher 3 23%
Professor > Associate Professor 2 15%
Student > Master 2 15%
Student > Ph. D. Student 2 15%
Lecturer 1 8%
Other 2 15%
Unknown 1 8%
Readers by discipline Count As %
Computer Science 10 77%
Mathematics 1 8%
Agricultural and Biological Sciences 1 8%
Unknown 1 8%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. 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 03 February 2012.
All research outputs
#12,853,296
of 22,663,150 outputs
Outputs from Lecture notes in computer science
#3,773
of 8,123 outputs
Outputs of similar age
#135,938
of 168,711 outputs
Outputs of similar age from Lecture notes in computer science
#90
of 177 outputs
Altmetric has tracked 22,663,150 research outputs across all sources so far. This one is in the 42nd percentile – i.e., 42% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,123 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 51% 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 168,711 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 19th percentile – i.e., 19% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 177 others from the same source and published within six weeks on either side of this one. This one is in the 46th percentile – i.e., 46% of its contemporaries scored the same or lower than it.