Algorithm Theory — SWAT '94

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Computing depth orders and related problems
3. Altmetric Badge
   Chapter 2 Selection in monotone matrices and computing k th nearest neighbors
4. Altmetric Badge
   Chapter 3 New on-line algorithms for the page replication problem
5. Altmetric Badge
   Chapter 4 Serving requests with on-line routing
6. Altmetric Badge
   Chapter 5 A new algorithm for the construction of optimal B-trees
7. Altmetric Badge
   Chapter 6 New results on binary space partitions in the plane (extended abstract)
8. Altmetric Badge
   Chapter 7 A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
9. Altmetric Badge
   Chapter 8 On triangulating planar graphs under the four-connectivity constraint
10. Altmetric Badge
    Chapter 9 Parallel and sequential approximation of shortest superstrings
11. Altmetric Badge
    Chapter 10 Separating translates in the plane: Combinatorial bounds and an algorithm
12. Altmetric Badge
    Chapter 11 Finding all weakly-visible chords of a polygon in linear time
13. Altmetric Badge
    Chapter 12 A tight lower bound for on-line monotonic list labeling
14. Altmetric Badge
    Chapter 13 Trapezoid graphs and generalizations, geometry and algorithms
15. Altmetric Badge
    Chapter 14 Optimal parametric search on graphs of bounded tree-width
16. Altmetric Badge
    Chapter 15 Lower bounds for dynamic algorithms
17. Altmetric Badge
    Chapter 16 Sequential and parallel algorithms for embedding problems on classes of partial k -trees
18. Altmetric Badge
    Chapter 17 On intersection searching problems involving curved objects
19. Altmetric Badge
    Chapter 18 Improved approximations of independent sets in bounded-degree graphs
20. Altmetric Badge
    Chapter 19 Asymptotically optimal election on weighted rings
21. Altmetric Badge
    Chapter 20 Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
22. Altmetric Badge
    Chapter 21 Recent results in hardness of approximation
23. Altmetric Badge
    Chapter 22 The parallel hierarchical memory model
24. Altmetric Badge
    Chapter 23 Randomized geometric algorithms (abstract)
25. Altmetric Badge
    Chapter 24 Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments
26. Altmetric Badge
    Chapter 25 On self-stabilizing wait-free clock synchronization
27. Altmetric Badge
    Chapter 26 Hard graphs for randomized subgraph exclusion algorithms
28. Altmetric Badge
    Chapter 27 Task scheduling in networks
29. Altmetric Badge
    Chapter 28 Parallel dynamic lowest common ancestors
30. Altmetric Badge
    Chapter 29 An O (log log n ) algorithm to compute the kernel of a polygon
31. Altmetric Badge
    Chapter 30 Computing the L 1 -diameter and center of a simple rectilinear polygon in parallel
32. Altmetric Badge
    Chapter 31 Exploiting locality in LT-RAM computations
33. Altmetric Badge
    Chapter 32 Efficient preprocessing of simple binary pattern forests
34. Altmetric Badge
    Chapter 33 A parallel algorithm for edge-coloring partial k -trees
35. Altmetric Badge
    Chapter 34 Dominating cliques in distance-hereditary graphs