Algorithms and Data Structures

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 On the Spanning and Routing Ratios of the Directed $$\varTheta _6$$ Θ 6 -Graph
3. Altmetric Badge
   Chapter 2 The Minimum Moving Spanning Tree Problem
4. Altmetric Badge
   Chapter 3 Scheduling with Testing on Multiple Identical Parallel Machines
5. Altmetric Badge
   Chapter 4 Online Makespan Minimization with Budgeted Uncertainty
6. Altmetric Badge
   Chapter 5 Pattern Matching in Doubling Spaces
7. Altmetric Badge
   Chapter 6 Reachability Problems for Transmission Graphs
8. Altmetric Badge
   Chapter 7 On Minimum Generalized Manhattan Connections
9. Altmetric Badge
   Chapter 8 HalftimeHash: Modern Hashing Without 64-Bit Multipliers or Finite Fields
10. Altmetric Badge
    Chapter 9 Generalized Disk Graphs
11. Altmetric Badge
    Chapter 10 A 4-Approximation of the $$\frac{2\pi }{3}$$ 2 π 3 -MST
12. Altmetric Badge
    Chapter 11 Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations
13. Altmetric Badge
    Chapter 12 The Neighborhood Polynomial of Chordal Graphs
14. Altmetric Badge
    Chapter 13 Incomplete Directed Perfect Phylogeny in Linear Time
15. Altmetric Badge
    Chapter 14 Euclidean Maximum Matchings in the Plane—Local to Global
16. Altmetric Badge
    Chapter 15 Solving Problems on Generalized Convex Graphs via Mim-Width
17. Altmetric Badge
    Chapter 16 Improved Bounds on the Spanning Ratio of the Theta-5-Graph
18. Altmetric Badge
    Chapter 17 Computing Weighted Subset Transversals in H-Free Graphs
19. Altmetric Badge
    Chapter 18 Computing the Fréchet Distance Between Uncertain Curves in One Dimension
20. Altmetric Badge
    Chapter 19 Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
21. Altmetric Badge
    Chapter 20 Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees
22. Altmetric Badge
    Chapter 21 An APTAS for Bin Packing with Clique-Graph Conflicts
23. Altmetric Badge
    Chapter 22 Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs
24. Altmetric Badge
    Chapter 23 ANN for Time Series Under the Fréchet Distance
25. Altmetric Badge
    Chapter 24 Strictly In-Place Algorithms for Permuting and Inverting Permutations
26. Altmetric Badge
    Chapter 25 A Stronger Lower Bound on Parametric Minimum Spanning Trees
27. Altmetric Badge
    Chapter 26 Online Bin Packing of Squares and Cubes
28. Altmetric Badge
    Chapter 27 Exploration of k-Edge-Deficient Temporal Graphs
29. Altmetric Badge
    Chapter 28 Parameterized Complexity of Categorical Clustering with Size Constraints
30. Altmetric Badge
    Chapter 29 Graph Pricing with Limited Supply
31. Altmetric Badge
    Chapter 30 Fair Correlation Clustering with Global and Local Guarantees
32. Altmetric Badge
    Chapter 31 Better Distance Labeling for Unweighted Planar Graphs
33. Altmetric Badge
    Chapter 32 How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths
34. Altmetric Badge
    Chapter 33 Algorithms for Radius-Optimally Augmenting Trees in a Metric Space
35. Altmetric Badge
    Chapter 34 Upper and Lower Bounds for Fully Retroactive Graph Problems
36. Altmetric Badge
    Chapter 35 Characterization of Super-Stable Matchings
37. Altmetric Badge
    Chapter 36 Uniform Embeddings for Robinson Similarity Matrices
38. Altmetric Badge
    Chapter 37 Particle-Based Assembly Using Precise Global Control
39. Altmetric Badge
    Chapter 38 Independent Sets in Semi-random Hypergraphs
40. Altmetric Badge
    Chapter 39 A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs
41. Altmetric Badge
    Chapter 40 Support Optimality and Adaptive Cuckoo Filters
42. Altmetric Badge
    Chapter 41 Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time
43. Altmetric Badge
    Chapter 42 Algorithms for the Line-Constrained Disk Coverage and Related Problems
44. Altmetric Badge
    Chapter 43 A Universal Cycle for Strings with Fixed-Content (Which Are Also Known as Multiset Permutations)
45. Altmetric Badge
    Chapter 44 Routing on Heavy-Path WSPD-Spanners
46. Altmetric Badge
    Chapter 45 Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance
47. Altmetric Badge
    Chapter 46 Diverse Partitions of Colored Points
48. Altmetric Badge
    Chapter 47 Reverse Shortest Path Problem for Unit-Disk Graphs
49. Altmetric Badge
    Chapter 48 Correction to: Algorithms and Data Structures