Algorithms and Data Structures

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Multi-party Pseudo-Telepathy
3. Altmetric Badge
   Chapter 2 Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips
4. Altmetric Badge
   Chapter 3 Shape Segmentation and Matching with Flow Discretization
5. Altmetric Badge
   Chapter 4 Phylogenetic Reconstruction from Gene-Rearrangement Data with Unequal Gene Content
6. Altmetric Badge
   Chapter 5 Toward Optimal Motif Enumeration
7. Altmetric Badge
   Chapter 6 Common-Deadline Lazy Bureaucrat Scheduling Problems
8. Altmetric Badge
   Chapter 7 Bandwidth-Constrained Allocation in Grid Computing
9. Altmetric Badge
   Chapter 8 Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection
10. Altmetric Badge
    Chapter 9 Fast Algorithms for a Class of Temporal Range Queries
11. Altmetric Badge
    Chapter 10 Distribution-Sensitive Binomial Queues
12. Altmetric Badge
    Chapter 11 Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees
13. Altmetric Badge
    Chapter 12 Extremal Configurations and Levels in Pseudoline Arrangements
14. Altmetric Badge
    Chapter 13 Fast Relative Approximation of Potential Fields
15. Altmetric Badge
    Chapter 14 The One-Round Voronoi Game Replayed
16. Altmetric Badge
    Chapter 15 Integrated Prefetching and Caching with Read and Write Requests
17. Altmetric Badge
    Chapter 16 Online Seat Reservations via Offline Seating Arrangements
18. Altmetric Badge
    Chapter 17 Routing and Call Control Algorithms for Ring Networks
19. Altmetric Badge
    Chapter 18 Algorithms and Models for Railway Optimization
20. Altmetric Badge
    Chapter 19 Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles
21. Altmetric Badge
    Chapter 20 Multi-way Space Partitioning Trees
22. Altmetric Badge
    Chapter 21 Cropping-Resilient Segmented Multiple Watermarking
23. Altmetric Badge
    Chapter 22 On Simultaneous Planar Graph Embeddings
24. Altmetric Badge
    Chapter 23 Smoothed Analysis
25. Altmetric Badge
    Chapter 24 Approximation Algorithm for Hotlink Assignments in Web Directories
26. Altmetric Badge
    Chapter 25 Drawing Graphs with Large Vertices and Thick Edges
27. Altmetric Badge
    Chapter 26 Semi-matchings for Bipartite Graphs and Load Balancing
28. Altmetric Badge
    Chapter 27 The Traveling Salesman Problem for Cubic Graphs
29. Altmetric Badge
    Chapter 28 Sorting Circular Permutations by Reversal
30. Altmetric Badge
    Chapter 29 An Improved Bound on Boolean Matrix Multiplication for Highly Clustered Data
31. Altmetric Badge
    Chapter 30 Dynamic Text and Static Pattern Matching
32. Altmetric Badge
    Chapter 31 Real Two Dimensional Scaled Matching
33. Altmetric Badge
    Chapter 32 Proximity Structures for Geometric Graphs
34. Altmetric Badge
    Chapter 33 The Zigzag Path of a Pseudo-Triangulation
35. Altmetric Badge
    Chapter 34 Alternating Paths along Orthogonal Segments
36. Altmetric Badge
    Chapter 35 Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem
37. Altmetric Badge
    Chapter 36 Chips on Wafers
38. Altmetric Badge
    Chapter 37 A Model for Analyzing Black-Box Optimization
39. Altmetric Badge
    Chapter 38 On the Hausdorff Voronoi Diagram of Point Clusters in the Plane
40. Altmetric Badge
    Chapter 39 Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries
41. Altmetric Badge
    Chapter 40 Significant-Presence Range Queries in Categorical Data
42. Altmetric Badge
    Chapter 41 Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms — the Case of k-Internal Spanning Tree
43. Altmetric Badge
    Chapter 42 Parameterized Complexity of Directed Feedback Set Problems in Tournaments
44. Altmetric Badge
    Chapter 43 Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs
45. Altmetric Badge
    Chapter 44 New Directions and New Challenges in Algorithm Design and Complexity, Parameterized