↓ Skip to main content

Combinatorial Algorithms

Overview of attention for book
Cover of 'Combinatorial Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 On the Complexity of Computing Treebreadth
  3. Altmetric Badge
    Chapter 2 Online Chromatic Number is PSPACE-Complete
  4. Altmetric Badge
    Chapter 3 Bounded Embeddings of Graphs in the Plane
  5. Altmetric Badge
    Chapter 4 Crushing Disks Efficiently
  6. Altmetric Badge
    Chapter 5 Essential Constraints of Edge-Constrained Proximity Graphs
  7. Altmetric Badge
    Chapter 6 Plane Bichromatic Trees of Low Degree
  8. Altmetric Badge
    Chapter 7 Directing Road Networks by Listing Strong Orientations
  9. Altmetric Badge
    Chapter 8 Evangelism in Social Networks
  10. Altmetric Badge
    Chapter 9 Distance Queries in Large-Scale Fully Dynamic Complex Networks
  11. Altmetric Badge
    Chapter 10 Minimax Regret 1-Median Problem in Dynamic Path Networks
  12. Altmetric Badge
    Chapter 11 On Maximal Chain Subgraphs and Covers of Bipartite Graphs
  13. Altmetric Badge
    Chapter 12 Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations
  14. Altmetric Badge
    Chapter 13 Reconfiguration of Steiner Trees in an Unweighted Graph
  15. Altmetric Badge
    Chapter 14 Weighted Online Problems with Advice
  16. Altmetric Badge
    Chapter 15 Finding Gapped Palindromes Online
  17. Altmetric Badge
    Chapter 16 Advice Complexity of the Online Search Problem
  18. Altmetric Badge
    Chapter 17 Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
  19. Altmetric Badge
    Chapter 18 A Boundary Property for Upper Domination
  20. Altmetric Badge
    Chapter 19 Upper Domination: Complexity and Approximation
  21. Altmetric Badge
    Chapter 20 Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes
  22. Altmetric Badge
    Chapter 21 Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles
  23. Altmetric Badge
    Chapter 22 Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
  24. Altmetric Badge
    Chapter 23 Speeding up Dynamic Programming in the Line-Constrained k-median
  25. Altmetric Badge
    Chapter 24 SOBRA - Shielding Optimization for BRAchytherapy
  26. Altmetric Badge
    Chapter 25 A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints
  27. Altmetric Badge
    Chapter 26 Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem
  28. Altmetric Badge
    Chapter 27 Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs
  29. Altmetric Badge
    Chapter 28 Finding Cactus Roots in Polynomial Time
  30. Altmetric Badge
    Chapter 29 Computing Giant Graph Diameters
  31. Altmetric Badge
    Chapter 30 Faster Computation of Path-Width
  32. Altmetric Badge
    Chapter 31 The Solution Space of Sorting with Recurring Comparison Faults
  33. Altmetric Badge
    Chapter 32 Monotone Paths in Geometric Triangulations
  34. Altmetric Badge
    Chapter 33 On Computing the Total Displacement Number via Weighted Motzkin Paths
  35. Altmetric Badge
    Chapter 34 Partial Covering Arrays: Algorithms and Asymptotics
  36. Altmetric Badge
    Chapter 35 Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently
Attention for Chapter 35: Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently
Altmetric Badge

About this Attention Score

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

Mentioned by

twitter
2 X users

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
Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently
Chapter number 35
Book title
Combinatorial Algorithms
Published in
Lecture notes in computer science, August 2016
DOI 10.1007/978-3-319-44543-4_35
Book ISBNs
978-3-31-944542-7, 978-3-31-944543-4
Authors

Moritz von Looz, Henning Meyerhenke

Editors

Veli Mäkinen, Simon J. Puglisi, Leena Salmela

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.
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 %
United States 1 25%
Unknown 3 75%

Demographic breakdown

Readers by professional status Count As %
Researcher 3 75%
Student > Master 1 25%
Readers by discipline Count As %
Computer Science 3 75%
Unknown 1 25%
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 12 September 2016.
All research outputs
#17,772,019
of 22,826,360 outputs
Outputs from Lecture notes in computer science
#5,933
of 8,126 outputs
Outputs of similar age
#264,350
of 361,623 outputs
Outputs of similar age from Lecture notes in computer science
#311
of 461 outputs
Altmetric has tracked 22,826,360 research outputs across all sources so far. This one is in the 19th percentile – i.e., 19% 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 26th percentile – i.e., 26% 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 361,623 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 22nd percentile – i.e., 22% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 461 others from the same source and published within six weeks on either side of this one. This one is in the 31st percentile – i.e., 31% of its contemporaries scored the same or lower than it.