↓ Skip to main content

Algorithms and Complexity

Overview of attention for book
Cover of 'Algorithms and Complexity'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost
  3. Altmetric Badge
    Chapter 2 Parameterized Complexity and Kernel Bounds for Hard Planning Problems
  4. Altmetric Badge
    Chapter 3 Selfish Resource Allocation in Optical Networks
  5. Altmetric Badge
    Chapter 4 Average Optimal String Matching in Packed Strings
  6. Altmetric Badge
    Chapter 5 Parameterized Complexity of DAG Partitioning
  7. Altmetric Badge
    Chapter 6 Four Measures of Nonlinearity
  8. Altmetric Badge
    Chapter 7 On the Characterization of Plane Bus Graphs
  9. Altmetric Badge
    Chapter 8 Online Multi-dimensional Dynamic Bin Packing of Unit-Fraction Items
  10. Altmetric Badge
    Chapter 9 A Greedy Approximation Algorithm for Minimum-Gap Scheduling
  11. Altmetric Badge
    Chapter 10 Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas
  12. Altmetric Badge
    Chapter 11 Linear Time Distributed Swap Edge Algorithms
  13. Altmetric Badge
    Chapter 12 Decentralized Throughput Scheduling
  14. Altmetric Badge
    Chapter 13 New results on stabbing segments with a polygon
  15. Altmetric Badge
    Chapter 14 Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games
  16. Altmetric Badge
    Chapter 15 Complexity of Barrier Coverage with Relocatable Sensors in the Plane
  17. Altmetric Badge
    Chapter 16 Succinct Permanent Is NEXP-Hard with Many Hard Instances
  18. Altmetric Badge
    Chapter 17 Money-Based Coordination of Network Packets
  19. Altmetric Badge
    Chapter 18 Truthful Many-to-Many Assignment with Private Weights
  20. Altmetric Badge
    Chapter 19 Competitive Online Clique Clustering
  21. Altmetric Badge
    Chapter 20 Optimal Network Decontamination with Threshold Immunity
  22. Altmetric Badge
    Chapter 21 Finding All Convex Cuts of a Plane Graph in Cubic Time
  23. Altmetric Badge
    Chapter 22 Shortest Paths with Bundles and Non-additive Weights Is Hard
  24. Altmetric Badge
    Chapter 23 Cliques and Clubs
  25. Altmetric Badge
    Chapter 24 List Coloring in the Absence of Two Subgraphs
  26. Altmetric Badge
    Chapter 25 Query Complexity of Matroids
  27. Altmetric Badge
    Chapter 26 A New Dynamic Graph Structure for Large-Scale Transportation Networks
  28. Altmetric Badge
    Chapter 27 Capacitated Rank-Maximal Matchings
  29. Altmetric Badge
    Chapter 28 A Faster CREW PRAM Algorithm for Computing Cartesian Trees
  30. Altmetric Badge
    Chapter 29 Advice Complexity of the Online Coloring Problem
  31. Altmetric Badge
    Chapter 30 Sparse Linear Complementarity Problems
  32. Altmetric Badge
    Chapter 31 LP-Rounding Algorithms for the Fault-Tolerant Facility Placement Problem
Attention for Chapter 13: New results on stabbing segments with a polygon
Altmetric Badge

Mentioned by

twitter
1 X user

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
4 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
New results on stabbing segments with a polygon
Chapter number 13
Book title
Algorithms and Complexity
Published in
Lecture notes in computer science, December 2013
DOI 10.1007/978-3-642-38233-8_13
Book ISBNs
978-3-64-238232-1, 978-3-64-238233-8
Authors

Díaz Bañez, José Miguel, José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Alexander Pilz, Carlos Seara, Rodrigo I. Silveira

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 4 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 1 25%
Other 1 25%
Unknown 2 50%
Readers by discipline Count As %
Computer Science 2 50%
Unknown 2 50%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 1. 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 05 December 2013.
All research outputs
#20,211,690
of 22,733,113 outputs
Outputs from Lecture notes in computer science
#6,983
of 8,126 outputs
Outputs of similar age
#267,140
of 306,767 outputs
Outputs of similar age from Lecture notes in computer science
#251
of 294 outputs
Altmetric has tracked 22,733,113 research outputs across all sources so far. This one is in the 1st percentile – i.e., 1% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,126 research outputs from this source. They receive a mean Attention Score of 5.0. This one is in the 1st percentile – i.e., 1% of its peers scored the same or lower than it.
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 306,767 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 1st percentile – i.e., 1% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 294 others from the same source and published within six weeks on either side of this one. This one is in the 1st percentile – i.e., 1% of its contemporaries scored the same or lower than it.