↓ 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 the Power of the Semi-Separated Pair Decomposition
  3. Altmetric Badge
    Chapter 2 Plane Graphs with Parity Constraints
  4. Altmetric Badge
    Chapter 3 Straight-Line Rectangular Drawings of Clustered Graphs
  5. Altmetric Badge
    Chapter 4 Online Priority Steiner Tree Problems
  6. Altmetric Badge
    Chapter 5 Connect the Dot: Computing Feed-Links with Minimum Dilation
  7. Altmetric Badge
    Chapter 6 Minimal Locked Trees
  8. Altmetric Badge
    Chapter 7 Approximating Transitive Reductions for Directed Networks
  9. Altmetric Badge
    Chapter 8 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2
  10. Altmetric Badge
    Chapter 9 Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
  11. Altmetric Badge
    Chapter 10 A Distribution-Sensitive Dictionary with Low Space Overhead
  12. Altmetric Badge
    Chapter 11 A Comparison of Performance Measures for Online Algorithms
  13. Altmetric Badge
    Chapter 12 Delaunay Triangulation of Imprecise Points Simplified and Extended
  14. Altmetric Badge
    Chapter 13 An Improved SAT Algorithm in Terms of Formula Length
  15. Altmetric Badge
    Chapter 14 Shortest Path Problems on a Polyhedral Surface
  16. Altmetric Badge
    Chapter 15 Approximation Algorithms for Buy-at-Bulk Geometric Network Design
  17. Altmetric Badge
    Chapter 16 Rank-Sensitive Priority Queues
  18. Altmetric Badge
    Chapter 17 Algorithms Meet Art, Puzzles, and Magic
  19. Altmetric Badge
    Chapter 18 Skip-Splay: Toward Achieving the Unified Bound in the BST Model
  20. Altmetric Badge
    Chapter 19 Drawing Graphs with Right Angle Crossings
  21. Altmetric Badge
    Chapter 20 Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
  22. Altmetric Badge
    Chapter 21 Efficient Construction of Near-Optimal Binary and Multiway Search Trees
  23. Altmetric Badge
    Chapter 22 On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
  24. Altmetric Badge
    Chapter 23 On Reconfiguration of Disks in the Plane and Related Problems
  25. Altmetric Badge
    Chapter 24 Orientation-Constrained Rectangular Layouts
  26. Altmetric Badge
    Chapter 25 The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
  27. Altmetric Badge
    Chapter 26 Optimal Embedding into Star Metrics
  28. Altmetric Badge
    Chapter 27 Online Square Packing
  29. Altmetric Badge
    Chapter 28 Worst-Case Optimal Adaptive Prefix Coding
  30. Altmetric Badge
    Chapter 29 New Results on Visibility in Simple Polygons
  31. Altmetric Badge
    Chapter 30 Dynamic Graph Clustering Using Minimum-Cut Trees
  32. Altmetric Badge
    Chapter 31 Rank-Balanced Trees
  33. Altmetric Badge
    Chapter 32 Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments
  34. Altmetric Badge
    Chapter 33 Reconfiguration of List Edge-Colorings in a Graph
  35. Altmetric Badge
    Chapter 34 The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
  36. Altmetric Badge
    Chapter 35 Two for One: Tight Approximation of 2D Bin Packing
  37. Altmetric Badge
    Chapter 36 Fault Tolerant External Memory Algorithms
  38. Altmetric Badge
    Chapter 37 Inspecting a Set of Strips Optimally
  39. Altmetric Badge
    Chapter 38 A Pseudopolynomial Algorithm for Alexandrov’s Theorem
  40. Altmetric Badge
    Chapter 39 A Scheme for Computing Minimum Covers within Simple Regions
  41. Altmetric Badge
    Chapter 40 Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem
  42. Altmetric Badge
    Chapter 41 Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality
  43. Altmetric Badge
    Chapter 42 Streaming Embeddings with Slack
  44. Altmetric Badge
    Chapter 43 Computing the Implicit Voronoi Diagram in Triple Precision
  45. Altmetric Badge
    Chapter 44 Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
  46. Altmetric Badge
    Chapter 45 Integer Programming: Optimization and Evaluation Are Equivalent
  47. Altmetric Badge
    Chapter 46 Resolving Loads with Positive Interior Stresses
  48. Altmetric Badge
    Chapter 47 On Making Directed Graphs Transitive
  49. Altmetric Badge
    Chapter 48 Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
  50. Altmetric Badge
    Chapter 49 Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

blogs
1 blog
twitter
4 X users
wikipedia
11 Wikipedia pages

Readers on

mendeley
6 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
Springer, Berlin, Heidelberg, January 2009
DOI 10.1007/978-3-642-03367-4
ISBNs
978-3-64-203366-7, 978-3-64-203367-4
Editors

Frank Dehne, Marina Gavrilova, Jörg-Rüdiger Sack, Csaba D. Tóth

X Demographics

X Demographics

The data shown below were collected from the profiles of 4 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 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Canada 1 17%
Unknown 5 83%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 3 50%
Student > Master 2 33%
Unknown 1 17%
Readers by discipline Count As %
Computer Science 4 67%
Unknown 2 33%