↓ Skip to main content

Algorithms and Data Structures

Overview of attention for book
Cover of 'Algorithms and Data Structures'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 On Maximum Weight Objects Decomposable into Based Rectilinear Convex Objects
  3. Altmetric Badge
    Chapter 2 Bundling Three Convex Polygons to Minimize Area or Perimeter
  4. Altmetric Badge
    Chapter 3 Smart-Grid Electricity Allocation via Strip Packing with Slicing
  5. Altmetric Badge
    Chapter 4 On (Dynamic) Range Minimum Queries in External Memory
  6. Altmetric Badge
    Chapter 5 Distance-Sensitive Planar Point Location
  7. Altmetric Badge
    Chapter 6 Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems
  8. Altmetric Badge
    Chapter 7 Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles
  9. Altmetric Badge
    Chapter 8 Socially Stable Matchings in the Hospitals/Residents Problem
  10. Altmetric Badge
    Chapter 9 Parameterized Complexity of 1-Planarity
  11. Altmetric Badge
    Chapter 10 On the Stretch Factor of the Theta-4 Graph
  12. Altmetric Badge
    Chapter 11 Better Space Bounds for Parameterized Range Majority and Minority
  13. Altmetric Badge
    Chapter 12 Online Control Message Aggregation in Chain Networks
  14. Altmetric Badge
    Chapter 13 Fingerprints in Compressed Strings
  15. Altmetric Badge
    Chapter 14 Beacon-Based Algorithms for Geometric Routing
  16. Altmetric Badge
    Chapter 15 Interval Selection with Machine-Dependent Intervals
  17. Altmetric Badge
    Chapter 16 On the Spanning Ratio of Theta-Graphs
  18. Altmetric Badge
    Chapter 17 Relative Interval Analysis of Paging Algorithms on Access Graphs
  19. Altmetric Badge
    Chapter 18 On Explaining Integer Vectors by Few Homogenous Segments
  20. Altmetric Badge
    Chapter 19 Trajectory Grouping Structure
  21. Altmetric Badge
    Chapter 20 The Art of Shaving Logs
  22. Altmetric Badge
    Chapter 21 Treewidth and Pathwidth Parameterized by the Vertex Cover Number
  23. Altmetric Badge
    Chapter 22 Visibility and Ray Shooting Queries in Polygonal Domains
  24. Altmetric Badge
    Chapter 23 Lift-and-Project Methods for Set Cover and Knapsack
  25. Altmetric Badge
    Chapter 24 Optimal Time-Convex Hull under the L p Metrics
  26. Altmetric Badge
    Chapter 25 Blame Trees
  27. Altmetric Badge
    Chapter 26 Plane 3-trees: Embeddability and Approximation
  28. Altmetric Badge
    Chapter 27 A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs
  29. Altmetric Badge
    Chapter 28 Combinatorial Pair Testing: Distinguishing Workers from Slackers
  30. Altmetric Badge
    Chapter 29 Approximation Algorithms for B 1-EPG Graphs
  31. Altmetric Badge
    Chapter 30 Universal Point Sets for Planar Three-Trees
  32. Altmetric Badge
    Chapter 31 Planar Packing of Binary Trees
  33. Altmetric Badge
    Chapter 32 Hierarchies of Predominantly Connected Communities
  34. Altmetric Badge
    Chapter 33 Joint Cache Partition and Job Assignment on Multi-core Processors
  35. Altmetric Badge
    Chapter 34 Finding the Minimum-Weight k-Path
  36. Altmetric Badge
    Chapter 35 Compressed Persistent Index for Efficient Rank/Select Queries
  37. Altmetric Badge
    Chapter 36 Tight Bounds for Low Dimensional Star Stencils in the External Memory Model
  38. Altmetric Badge
    Chapter 37 Neighborhood-Preserving Mapping between Trees
  39. Altmetric Badge
    Chapter 38 Bounding the Running Time of Algorithms for Scheduling and Packing Problems
  40. Altmetric Badge
    Chapter 39 When Is Weighted Satisfiability FPT?
  41. Altmetric Badge
    Chapter 40 Two-Sided Boundary Labeling with Adjacent Sides
  42. Altmetric Badge
    Chapter 41 Optimal Batch Schedules for Parallel Machines
  43. Altmetric Badge
    Chapter 42 Unions of Onions: Preprocessing Imprecise Points for Fast Onion Layer Decomposition
  44. Altmetric Badge
    Chapter 43 Dynamic Planar Point Location with Sub-logarithmic Local Updates
  45. Altmetric Badge
    Chapter 44 Parameterized Enumeration of (Locally-) Optimal Aggregations
  46. Altmetric Badge
    Chapter 45 MapReduce Algorithmics
  47. Altmetric Badge
    Chapter 46 The Greedy Gray Code Algorithm
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • Good Attention Score compared to outputs of the same age (69th percentile)
  • Good Attention Score compared to outputs of the same age and source (69th percentile)

Mentioned by

twitter
1 X user
wikipedia
4 Wikipedia pages

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
1 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.
Title
Algorithms and Data Structures
Published by
Lecture notes in computer science, January 2013
DOI 10.1007/978-3-642-40104-6
ISBNs
978-3-64-240103-9, 978-3-64-240104-6
Editors

Frank Dehne, Roberto Solis-Oba, Jörg-Rüdiger Sack

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 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 1 100%
Student > Ph. D. Student 1 100%
Readers by discipline Count As %
Computer Science 1 100%
Engineering 1 100%
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 11 March 2024.
All research outputs
#8,463,388
of 25,837,817 outputs
Outputs from Lecture notes in computer science
#2,484
of 8,201 outputs
Outputs of similar age
#87,291
of 292,453 outputs
Outputs of similar age from Lecture notes in computer science
#97
of 317 outputs
Altmetric has tracked 25,837,817 research outputs across all sources so far. This one has received more attention than most of these and is in the 66th percentile.
So far Altmetric has tracked 8,201 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.2. This one has gotten more attention than average, scoring higher than 69% 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 292,453 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 69% of its contemporaries.
We're also able to compare this research output to 317 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 69% of its contemporaries.