SWAT 90

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 73 Structural complexity theory: Recent surprises
3. Altmetric Badge
   Chapter 74 Approximating maximum independent sets by excluding subgraphs
4. Altmetric Badge
   Chapter 75 Generating sparse spanners for weighted graphs
5. Altmetric Badge
   Chapter 76 Finding the k smallest spanning trees
6. Altmetric Badge
   Chapter 77 The file distribution problem for processor networks
7. Altmetric Badge
   Chapter 78 Translating polygons with applications to hidden surface removal
8. Altmetric Badge
   Chapter 79 Output-sensitive generation of the perspective view of isothetic parallelepipeds
9. Altmetric Badge
   Chapter 80 Graphics in flatland revisited
10. Altmetric Badge
    Chapter 81 The visibility diagram: A data structure for visibility problems and motion planning
11. Altmetric Badge
    Chapter 82 Fast updating of well-balanced trees
12. Altmetric Badge
    Chapter 83 How to update a balanced binary tree with a constant number of rotations
13. Altmetric Badge
    Chapter 84 Ranking trees generated by rotations
14. Altmetric Badge
    Chapter 85 Expected behaviour analysis of AVL trees
15. Altmetric Badge
    Chapter 86 Analysis of the expected search cost in skip lists
16. Altmetric Badge
    Chapter 87 Lower bounds for monotonic list labeling
17. Altmetric Badge
    Chapter 88 Sorting shuffled monotone sequences
18. Altmetric Badge
    Chapter 89 A faster parallel algorithm for a matrix searching problem
19. Altmetric Badge
    Chapter 90 A rectilinear steiner minimal tree algorithm for convex point sets
20. Altmetric Badge
    Chapter 91 Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
21. Altmetric Badge
    Chapter 92 Input-sensitive compliant motion in the plane
22. Altmetric Badge
    Chapter 93 Fast algorithms for greedy triangulation
23. Altmetric Badge
    Chapter 94 Star unfolding of a polytope with applications
24. Altmetric Badge
    Chapter 95 Space-sweep algorithms for parametric optimization
25. Altmetric Badge
    Chapter 96 Approximating finite weighted point sets by hyperplanes
26. Altmetric Badge
    Chapter 97 Data structures for Traveling Salesmen
27. Altmetric Badge
    Chapter 98 Efficient parallel algorithms for shortest paths in planar graphs
28. Altmetric Badge
    Chapter 99 The pathwidth and treewidth of cographs
29. Altmetric Badge
    Chapter 100 Canonical representations of partial 2-and 3-trees
30. Altmetric Badge
    Chapter 101 On matroids and hierarchical graphs
31. Altmetric Badge
    Chapter 102 Fast algorithms for two dimensional and multiple pattern matching
32. Altmetric Badge
    Chapter 103 Boyer-Moore approach to approximate string matching
33. Altmetric Badge
    Chapter 104 Complete problems with L-samplable distributions
34. Altmetric Badge
    Chapter 105 Upper envelope onion peeling
35. Altmetric Badge
    Chapter 106 Applications of a semi-dynamic convex hull algorithm
36. Altmetric Badge
    Chapter 107 Intersection queries in sets of disks
37. Altmetric Badge
    Chapter 108 Dynamic partition trees