↓ 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 Geometric Spanning Trees Minimizing the Wiener Index
  3. Altmetric Badge
    Chapter 2 The Mutual Visibility Problem for Fat Robots
  4. Altmetric Badge
    Chapter 3 Faster Algorithms for Cycle Hitting Problems on Disk Graphs
  5. Altmetric Badge
    Chapter 4 Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride
  6. Altmetric Badge
    Chapter 5 Online TSP with Known Locations
  7. Altmetric Badge
    Chapter 6 Socially Fair Matching: Exact and Approximation Algorithms
  8. Altmetric Badge
    Chapter 7 A Parameterized Approximation Scheme for Generalized Partial Vertex Cover
  9. Altmetric Badge
    Chapter 8 Dominator Coloring and CD Coloring in Almost Cluster Graphs
  10. Altmetric Badge
    Chapter 9 Tight Approximation Algorithms for Ordered Covering
  11. Altmetric Badge
    Chapter 10 Online Minimum Spanning Trees with Weight Predictions
  12. Altmetric Badge
    Chapter 11 Compact Distance Oracles with Large Sensitivity and Low Stretch
  13. Altmetric Badge
    Chapter 12 Finding Diameter-Reducing Shortcuts in Trees
  14. Altmetric Badge
    Chapter 13 Approximating the Smallest k -Enclosing Geodesic Disc in a Simple Polygon
  15. Altmetric Badge
    Chapter 14 Online Interval Scheduling with Predictions
  16. Altmetric Badge
    Chapter 15 On Length-Sensitive Fréchet Similarity
  17. Altmetric Badge
    Chapter 16 Hardness of Graph-Structured Algebraic and Symbolic Problems
  18. Altmetric Badge
    Chapter 17 Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs
  19. Altmetric Badge
    Chapter 18 Efficient k -Center Algorithms for Planar Points in Convex Position
  20. Altmetric Badge
    Chapter 19 Classification via Two-Way Comparisons (Extended Abstract)
  21. Altmetric Badge
    Chapter 20 Improved Bounds for Discrete Voronoi Games
  22. Altmetric Badge
    Chapter 21 General Space-Time Tradeoffs via Relational Queries
  23. Altmetric Badge
    Chapter 22 Approximate Minimum Sum Colorings and Maximum k -Colorable Subgraphs of Chordal Graphs
  24. Altmetric Badge
    Chapter 23 Differentially Private Range Query on Shortest Paths
  25. Altmetric Badge
    Chapter 24 Revisiting Graph Persistence for Updates and Efficiency
  26. Altmetric Badge
    Chapter 25 Block Crossings in One-Sided Tanglegrams
  27. Altmetric Badge
    Chapter 26 Observation Routes and External Watchman Routes
  28. Altmetric Badge
    Chapter 27 Lower Bounds for Non-adaptive Shortest Path Relaxation
  29. Altmetric Badge
    Chapter 28 Shortest Coordinated Motion for Square Robots
  30. Altmetric Badge
    Chapter 29 Linear Layouts of Bipartite Planar Graphs
  31. Altmetric Badge
    Chapter 30 Adaptive Data Structures for 2D Dominance Colored Range Counting
  32. Altmetric Badge
    Chapter 31 Zip-Zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent
  33. Altmetric Badge
    Chapter 32 External-Memory Sorting with Comparison Errors
  34. Altmetric Badge
    Chapter 33 Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs
  35. Altmetric Badge
    Chapter 34 Reconfiguration of Time-Respecting Arborescences
  36. Altmetric Badge
    Chapter 35 Algorithmic Theory of Qubit Routing
  37. Altmetric Badge
    Chapter 36 3-Coloring $$C_4$$ C 4 or  $$C_3$$ C 3 -Free Diameter Two Graphs
  38. Altmetric Badge
    Chapter 37 Colored Constrained Spanning Tree on Directed Graphs
  39. Altmetric Badge
    Chapter 38 Geometric Hitting Set for Line-Constrained Disks
  40. Altmetric Badge
    Chapter 39 An ETH-Tight Algorithm for Bidirected Steiner Connectivity
  41. Altmetric Badge
    Chapter 40 From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy
  42. Altmetric Badge
    Chapter 41 Fully Dynamic Clustering and Diversity Maximization in Doubling Metrics
  43. Altmetric Badge
    Chapter 42 Quick Minimization of Tardy Processing Time on a Single Machine
  44. Altmetric Badge
    Chapter 43 Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location
  45. Altmetric Badge
    Chapter 44 Approximating the Discrete Center Line Segment in Linear Time
  46. Altmetric Badge
    Chapter 45 Density Approximation for Moving Groups
  47. Altmetric Badge
    Chapter 46 Dynamic Convex Hulls Under Window-Sliding Updates
  48. Altmetric Badge
    Chapter 47 Realizability Makes A Difference: A Complexity Gap For Sink-Finding in USOs
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page
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 Nature Switzerland, August 2023
DOI 10.1007/978-3-031-38906-1
ISBNs
978-3-03-138905-4, 978-3-03-138906-1
Editors

Morin, Pat, Suri, Subhash