Algorithms and Data Structures

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Towards a Theory of Algorithms
3. Altmetric Badge
   Chapter 2 k-Restricted Rotation with an Application to Search Tree Rebalancing
4. Altmetric Badge
   Chapter 3 Heap Building Bounds
5. Altmetric Badge
   Chapter 4 The Multi-radius Cover Problem
6. Altmetric Badge
   Chapter 5 Parameterized Complexity of Generalized Vertex Cover Problems
7. Altmetric Badge
   Chapter 6 The Complexity of Implicit and Space Efficient Priority Queues
8. Altmetric Badge
   Chapter 7 Analysis of a Class of Tries with Adaptive Multi-digit Branching
9. Altmetric Badge
   Chapter 8 Balanced Aspect Ratio Trees Revisited
10. Altmetric Badge
    Chapter 9 Improved Combinatorial Group Testing for Real-World Problem Sizes
11. Altmetric Badge
    Chapter 10 Parameterized Counting Algorithms for General Graph Covering Problems
12. Altmetric Badge
    Chapter 11 Approximating the Online Set Multicover Problems via Randomized Winnowing
13. Altmetric Badge
    Chapter 12 Max-stretch Reduction for Tree Spanners
14. Altmetric Badge
    Chapter 13 Succinct Representation of Triangulations with a Boundary
15. Altmetric Badge
    Chapter 14 Line-Segment Intersection Made In-Place
16. Altmetric Badge
    Chapter 15 Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
17. Altmetric Badge
    Chapter 16 Communication-Aware Processor Allocation for Supercomputers
18. Altmetric Badge
    Chapter 17 Dynamic Hotlinks
19. Altmetric Badge
    Chapter 18 The Minimum-Area Spanning Tree Problem
20. Altmetric Badge
    Chapter 19 Hinged Dissection of Polypolyhedra
21. Altmetric Badge
    Chapter 20 Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms
22. Altmetric Badge
    Chapter 21 Linear Time Algorithms for Generalized Edge Dominating Set Problems
23. Altmetric Badge
    Chapter 22 On Geometric Dilation and Halving Chords
24. Altmetric Badge
    Chapter 23 Orthogonal Subdivisions with Low Stabbing Numbers
25. Altmetric Badge
    Chapter 24 Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes
26. Altmetric Badge
    Chapter 25 Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length
27. Altmetric Badge
    Chapter 26 A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs
28. Altmetric Badge
    Chapter 27 The On-line Asymmetric Traveling Salesman Problem
29. Altmetric Badge
    Chapter 28 All-Pairs Shortest Paths with Real Weights in O ( n 3 /log n ) Time
30. Altmetric Badge
    Chapter 29 k -Link Shortest Paths in Weighted Subdivisions
31. Altmetric Badge
    Chapter 30 Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices
32. Altmetric Badge
    Chapter 31 Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems
33. Altmetric Badge
    Chapter 32 On the Vehicle Routing Problem
34. Altmetric Badge
    Chapter 33 The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case
35. Altmetric Badge
    Chapter 34 Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms
36. Altmetric Badge
    Chapter 35 Derandomization of Dimensionality Reduction and SDP Based Algorithms
37. Altmetric Badge
    Chapter 36 Subquadratic Algorithms for 3SUM
38. Altmetric Badge
    Chapter 37 Near-Optimal Pricing in Near-Linear Time
39. Altmetric Badge
    Chapter 38 Improved Approximation Bounds for Planar Point Pattern Matching