Algorithms and Data Structures

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Succinct Data Structures for Families of Interval Graphs
3. Altmetric Badge
   Chapter 2 On Polynomial-Time Combinatorial Algorithms for Maximum L -Bounded Flow
4. Altmetric Badge
   Chapter 3 Efficient Nearest-Neighbor Query and Clustering of Planar Curves
5. Altmetric Badge
   Chapter 4 Positive-Instance Driven Dynamic Programming for Graph Searching
6. Altmetric Badge
   Chapter 5 How to Morph a Tree on a Small Grid
7. Altmetric Badge
   Chapter 6 Approximating Robust Bin Packing with Budgeted Uncertainty
8. Altmetric Badge
   Chapter 7 Rank-Select Indices Without Tears
9. Altmetric Badge
   Chapter 8 A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs
10. Altmetric Badge
    Chapter 9 A Framework for Vehicle Routing Approximation Schemes in Trees
11. Altmetric Badge
    Chapter 10 Avoidable Vertices and Edges in Graphs
12. Altmetric Badge
    Chapter 11 Plane Hop Spanners for Unit Disk Graphs
13. Altmetric Badge
    Chapter 12 On the Minimum Consistent Subset Problem
14. Altmetric Badge
    Chapter 13 Parameterized Complexity of Conflict-Free Graph Coloring
15. Altmetric Badge
    Chapter 14 Graph Isomorphism for $$(H_1,H_2)$$ ( H 1 , H 2 ) -Free Graphs: An Almost Complete Dichotomy
16. Altmetric Badge
    Chapter 15 Hamiltonicity for Convex Shape Delaunay and Gabriel Graphs
17. Altmetric Badge
    Chapter 16 Computing Maximum Independent Set on Outerstring Graphs and Their Relatives
18. Altmetric Badge
    Chapter 17 Online Bin Covering with Advice
19. Altmetric Badge
    Chapter 18 Stackelberg Packing Games
20. Altmetric Badge
    Chapter 19 FRESH: Fréchet Similarity with Hashing
21. Altmetric Badge
    Chapter 20 Range Closest-Pair Search in Higher Dimensions
22. Altmetric Badge
    Chapter 21 Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles
23. Altmetric Badge
    Chapter 22 Kernelization of Graph Hamiltonicity: Proper H -Graphs
24. Altmetric Badge
    Chapter 23 Weighted Throughput Maximization with Calibrations
25. Altmetric Badge
    Chapter 24 Maximizing Dominance in the Plane and Its Applications
26. Altmetric Badge
    Chapter 25 Extending Upward Planar Graph Drawings
27. Altmetric Badge
    Chapter 26 Reconfiguring Undirected Paths
28. Altmetric Badge
    Chapter 27 Online Circle Packing
29. Altmetric Badge
    Chapter 28 Guess Free Maximization of Submodular and Linear Sums
30. Altmetric Badge
    Chapter 29 Efficient Second-Order Shape-Constrained Function Fitting
31. Altmetric Badge
    Chapter 30 Dynamic Dictionary Matching in the Online Model
32. Altmetric Badge
    Chapter 31 Balanced Stable Marriage: How Close Is Close Enough?
33. Altmetric Badge
    Chapter 32 Improved Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint
34. Altmetric Badge
    Chapter 33 Inventory Routing Problem with Facility Location
35. Altmetric Badge
    Chapter 34 A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space
36. Altmetric Badge
    Chapter 35 Geometric Firefighting in the Half-Plane
37. Altmetric Badge
    Chapter 36 Most Vital Segment Barriers
38. Altmetric Badge
    Chapter 37 Splaying Preorders and Postorders
39. Altmetric Badge
    Chapter 38 Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS
40. Altmetric Badge
    Chapter 39 Discrete Morse Theory for Computing Zigzag Persistence
41. Altmetric Badge
    Chapter 40 Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity
42. Altmetric Badge
    Chapter 41 Zip Trees
43. Altmetric Badge
    Chapter 42 Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points