Algorithms and Data Structures

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Contact Graphs of Circular Arcs
3. Altmetric Badge
   Chapter 2 Contact Representations of Graphs in 3D
4. Altmetric Badge
   Chapter 3 Minimizing the Aggregate Movements for Interval Coverage
5. Altmetric Badge
   Chapter 4 Online Bin Packing with Advice of Small Size
6. Altmetric Badge
   Chapter 5 On the Approximability of Orthogonal Order Preserving Layout Adjustment
7. Altmetric Badge
   Chapter 6 An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs
8. Altmetric Badge
   Chapter 7 Generation of Colourings and Distinguishing Colourings of Graphs
9. Altmetric Badge
   Chapter 8 Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time
10. Altmetric Badge
    Chapter 9 On Conflict-Free Multi-coloring
11. Altmetric Badge
    Chapter 10 Semi-dynamic Connectivity in the Plane
12. Altmetric Badge
    Chapter 11 Interval Selection in the Streaming Model
13. Altmetric Badge
    Chapter 12 On the Bounded-Hop Range Assignment Problem
14. Altmetric Badge
    Chapter 13 Greedy Is an Almost Optimal Deque
15. Altmetric Badge
    Chapter 14 A New Approach for Contact Graph Representations and Its Applications
16. Altmetric Badge
    Chapter 15 Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm
17. Altmetric Badge
    Chapter 16 Select with Groups of 3 or 4
18. Altmetric Badge
    Chapter 17 Approximating Nearest Neighbor Distances
19. Altmetric Badge
    Chapter 18 Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs
20. Altmetric Badge
    Chapter 19 On the Complexity of an Unregulated Traffic Crossing
21. Altmetric Badge
    Chapter 20 Finding Pairwise Intersections Inside a Query Range
22. Altmetric Badge
    Chapter 21 Cache-Oblivious Iterated Predecessor Queries via Range Coalescing
23. Altmetric Badge
    Chapter 22 Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing
24. Altmetric Badge
    Chapter 23 On the Minimum Eccentricity Shortest Path Problem
25. Altmetric Badge
    Chapter 24 Convex Polygons in Geometric Triangulations
26. Altmetric Badge
    Chapter 25 Straight-Line Drawability of a Planar Graph Plus an Edge
27. Altmetric Badge
    Chapter 26 Solving Problems on Graphs of High Rank-Width
28. Altmetric Badge
    Chapter 27 The Parametric Closure Problem
29. Altmetric Badge
    Chapter 28 Rooted Cycle Bases
30. Altmetric Badge
    Chapter 29 On the Chain Pair Simplification Problem
31. Altmetric Badge
    Chapter 30 Finding Articulation Points of Large Graphs in Linear Time
32. Altmetric Badge
    Chapter 31 LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design
33. Altmetric Badge
    Chapter 32 Universal Reconstruction of a String
34. Altmetric Badge
    Chapter 33 The Complexity of Dominating Set Reconfiguration
35. Altmetric Badge
    Chapter 34 Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes
36. Altmetric Badge
    Chapter 35 Competitive Diffusion on Weighted Graphs
37. Altmetric Badge
    Chapter 36 Sorting and Selection with Equality Comparisons
38. Altmetric Badge
    Chapter 37 Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
39. Altmetric Badge
    Chapter 38 Fast and Simple Connectivity in Graph Timelines
40. Altmetric Badge
    Chapter 39 Dynamic Set Intersection
41. Altmetric Badge
    Chapter 40 Time-Space Trade-offs for Triangulations and Voronoi Diagrams
42. Altmetric Badge
    Chapter 41 A 2k-vertex Kernel for Maximum Internal Spanning Tree
43. Altmetric Badge
    Chapter 42 Reconfiguration on Sparse Graphs
44. Altmetric Badge
    Chapter 43 Smoothed Analysis of Local Search Algorithms
45. Altmetric Badge
    Chapter 44 Optimal Shuffle Code with Permutation Instructions
46. Altmetric Badge
    Chapter 45 Non-preemptive Scheduling on Machines with Setup Times
47. Altmetric Badge
    Chapter 46 A Moderately Exponential Time Algorithm for k -IBDD Satisfiability
48. Altmetric Badge
    Chapter 47 On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids
49. Altmetric Badge
    Chapter 48 Elastic Geometric Shape Matching for Point Sets under Translations
50. Altmetric Badge
    Chapter 49 Constant Time Enumeration by Amortization
51. Altmetric Badge
    Chapter 50 Computing the Center of Uncertain Points on Tree Networks
52. Altmetric Badge
    Chapter 51 Swapping Colored Tokens on Graphs
53. Altmetric Badge
    Chapter 52 Positive Semidefinite Zero Forcing: Complexity and Lower Bounds