Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 D 2 -Tree: A New Overlay with Deterministic Bounds
3. Altmetric Badge
   Chapter 2 Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets
4. Altmetric Badge
   Chapter 3 Dynamic Range Reporting in External Memory
5. Altmetric Badge
   Chapter 4 A Cache-Oblivious Implicit Dictionary with the Working Set Property
6. Altmetric Badge
   Chapter 5 The ( p , q )-total Labeling Problem for Trees
7. Altmetric Badge
   Chapter 6 Drawing a Tree as a Minimum Spanning Tree Approximation
8. Altmetric Badge
   Chapter 7 k -cyclic Orientations of Graphs
9. Altmetric Badge
   Chapter 8 Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size
10. Altmetric Badge
    Chapter 9 Maximum Overlap of Convex Polytopes under Translation
11. Altmetric Badge
    Chapter 10 Approximate Shortest Homotopic Paths in Weighted Regions
12. Altmetric Badge
    Chapter 11 Spanning Ratio and Maximum Detour of Rectilinear Paths in the L 1 Plane
13. Altmetric Badge
    Chapter 12 Approximation and Hardness Results for the Maximum Edge q-coloring Problem
14. Altmetric Badge
    Chapter 13 3-Colouring AT-Free Graphs in Polynomial Time
15. Altmetric Badge
    Chapter 14 On Coloring Graphs without Induced Forests
16. Altmetric Badge
    Chapter 15 On the Approximability of the Maximum Interval Constrained Coloring Problem
17. Altmetric Badge
    Chapter 16 Approximability of Constrained LCS
18. Altmetric Badge
    Chapter 17 Approximation Algorithms for the Multi-Vehicle Scheduling Problem
19. Altmetric Badge
    Chapter 18 On Greedy Algorithms for Decision Trees
20. Altmetric Badge
    Chapter 19 Single and Multiple Device DSA Problem, Complexities and Online Algorithms
21. Altmetric Badge
    Chapter 20 The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications
22. Altmetric Badge
    Chapter 21 Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
23. Altmetric Badge
    Chapter 22 On the Continuous CNN Problem
24. Altmetric Badge
    Chapter 23 Policies for Periodic Packet Routing
25. Altmetric Badge
    Chapter 24 Increasing Speed Scheduling and Flow Scheduling
26. Altmetric Badge
    Chapter 25 A Tighter Analysis of Work Stealing
27. Altmetric Badge
    Chapter 26 Approximating the Traveling Tournament Problem with Maximum Tour Length 2
28. Altmetric Badge
    Chapter 27 Alphabet Partitioning for Compressed Rank/Select and Applications
29. Altmetric Badge
    Chapter 28 Entropy-Bounded Representation of Point Grids
30. Altmetric Badge
    Chapter 29 Identifying Approximate Palindromes in Run-Length Encoded Strings
31. Altmetric Badge
    Chapter 30 Minimum Cost Partitions of Trees with Supply and Demand
32. Altmetric Badge
    Chapter 31 Computing the ( t , k )-Diagnosability of Component-Composition Graphs and Its Application
33. Altmetric Badge
    Chapter 32 Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs
34. Altmetric Badge
    Chapter 33 Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization
35. Altmetric Badge
    Chapter 34 Induced Subgraph Isomorphism on Interval and Proper Interval Graphs
36. Altmetric Badge
    Chapter 35 Testing Simultaneous Planarity When the Common Graph Is 2-Connected
37. Altmetric Badge
    Chapter 36 Computing the Discrete Fréchet Distance with Imprecise Input
38. Altmetric Badge
    Chapter 37 Connectivity Graphs of Uncertainty Regions
39. Altmetric Badge
    Chapter 38 π /2-Angle Yao Graphs Are Spanners
40. Altmetric Badge
    Chapter 39 Identifying Shapes Using Self-assembly