Algorithms - ESA 2000

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Web Information Retrieval - an Algorithmic Perspective
3. Altmetric Badge
   Chapter 2 Computational Biology — Algorithms and More
4. Altmetric Badge
   Chapter 3 Algorithms - ESA 2000
5. Altmetric Badge
   Chapter 4 An Approximation Algorithm for Hypergraph Max k -Cut with Given Sizes of Parts
6. Altmetric Badge
   Chapter 5 Offline List Update is NP-hard
7. Altmetric Badge
   Chapter 6 Computing Largest Common Point Sets under Approximate Congruence
8. Altmetric Badge
   Chapter 7 Online Algorithms for Caching Multimedia Streams
9. Altmetric Badge
   Chapter 8 On Recognizing Cayley Graphs
10. Altmetric Badge
    Chapter 9 Fast Algorithms for Even/Odd Minimum Cuts and Generalizations
11. Altmetric Badge
    Chapter 10 Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
12. Altmetric Badge
    Chapter 11 Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset
13. Altmetric Badge
    Chapter 12 Range Searching over Tree Cross Products
14. Altmetric Badge
    Chapter 13 A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem
15. Altmetric Badge
    Chapter 14 The Minimum Range Assignment Problem on Linear Radio Networks
16. Altmetric Badge
    Chapter 15 Property Testing in Computational Geometry
17. Altmetric Badge
    Chapter 16 On R-Trees with Low Stabbing Number
18. Altmetric Badge
    Chapter 17 K-D Trees Are Better when Cut on the Longest Side
19. Altmetric Badge
    Chapter 18 On Multicriteria Online Problems
20. Altmetric Badge
    Chapter 19 Online Scheduling Revisited
21. Altmetric Badge
    Chapter 20 Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
22. Altmetric Badge
    Chapter 21 I/O-Efficient Well-Separated Pair Decomposition and Its Applications
23. Altmetric Badge
    Chapter 22 Higher Order Delaunay Triangulations
24. Altmetric Badge
    Chapter 23 On Representations of Algebraic-Geometric Codes for List Decoding
25. Altmetric Badge
    Chapter 24 Minimizing a Convex Cost Closure Set
26. Altmetric Badge
    Chapter 25 Preemptive Scheduling with Rejection
27. Altmetric Badge
    Chapter 26 Simpler and Faster Vertex-Connectivity Augmentation Algorithms
28. Altmetric Badge
    Chapter 27 Scheduling Broadcasts in Wireless Networks
29. Altmetric Badge
    Chapter 28 Jitter Regulation in an Internet Router with Delay Consideration
30. Altmetric Badge
    Chapter 29 Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points
31. Altmetric Badge
    Chapter 30 Resource Constrained Shortest Paths
32. Altmetric Badge
    Chapter 31 On the Competitiveness of Linear Search
33. Altmetric Badge
    Chapter 32 Maintaining a Minimum Spanning Tree under Transient Node Failures
34. Altmetric Badge
    Chapter 33 Minimum Depth Graph Embedding
35. Altmetric Badge
    Chapter 34 New Algorithms for Two-Label Point Labeling
36. Altmetric Badge
    Chapter 35 Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms
37. Altmetric Badge
    Chapter 36 How Helpers Hasten h -Relations
38. Altmetric Badge
    Chapter 37 Computing Optimal Linear Layouts of Trees in Linear Time
39. Altmetric Badge
    Chapter 38 Coloring Sparse Random Graphs in Polynomial Average Time
40. Altmetric Badge
    Chapter 39 Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine
41. Altmetric Badge
    Chapter 40 Collision Detection Using Bounding Boxes: Convexity Helps