Algorithm Theory - SWAT 2000

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Dynamic Graph Algorithms with Applications
3. Altmetric Badge
   Chapter 2 Coping with the NP-Hardness of the Graph Bandwidth Problem
4. Altmetric Badge
   Chapter 3 Toward Complete Genome Data Mining in Computational Biology
5. Altmetric Badge
   Chapter 4 A New Trade-Off for Deterministic Dictionaries
6. Altmetric Badge
   Chapter 5 Improved Upper Bounds for Pairing Heaps
7. Altmetric Badge
   Chapter 6 Maintaining Center and Median in Dynamic Trees
8. Altmetric Badge
   Chapter 7 Dynamic Planar Convex Hull with Optimal Query Time and O(log n · log log n ) Update Time
9. Altmetric Badge
   Chapter 8 A Dynamic Algorithm for Maintaining Graph Partitions
10. Altmetric Badge
    Chapter 9 Data Structures for Maintaining Set Partitions
11. Altmetric Badge
    Chapter 10 Fixed Parameter Algorithms for P lanar D ominating S et and Related Problems
12. Altmetric Badge
    Chapter 11 Embeddings of k-Connected Graphs of Pathwidth k
13. Altmetric Badge
    Chapter 12 On Graph Powers for Leaf-Labeled Trees
14. Altmetric Badge
    Chapter 13 Recognizing Weakly Triangulated Graphs by Edge Separability
15. Altmetric Badge
    Chapter 14 Caching for Web Searching
16. Altmetric Badge
    Chapter 15 On-Line Scheduling with Precedence Constraints
17. Altmetric Badge
    Chapter 16 Scheduling Jobs Before Shut-Down
18. Altmetric Badge
    Chapter 17 Resource Augmentation in Load Balancing
19. Altmetric Badge
    Chapter 18 Fair versus Unrestricted Bin Packing
20. Altmetric Badge
    Chapter 19 A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs
21. Altmetric Badge
    Chapter 20 Approximation Algorithms for the Label-Cover MAX and Red-Blue Set Cover Problems
22. Altmetric Badge
    Chapter 21 Approximation Algorithms for Maximum Linear Arrangement
23. Altmetric Badge
    Chapter 22 Approximation Algorithms for Clustering to Minimize the Sum of Diameters
24. Altmetric Badge
    Chapter 23 Robust Matchings and Maximum Clustering
25. Altmetric Badge
    Chapter 24 The Hospitals/Residents Problem with Ties
26. Altmetric Badge
    Chapter 25 Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph
27. Altmetric Badge
    Chapter 26 On the Minimum Augmentation of an ℓ-Connected Graph to a k-Connected Graph
28. Altmetric Badge
    Chapter 27 Locating Sources to Meet Flow Demands in Undirected Networks
29. Altmetric Badge
    Chapter 28 Improved Greedy Algorithms for Constructing Sparse Geometric Spanners
30. Altmetric Badge
    Chapter 29 Computing the Penetration Depth of Two Convex Polytopes in 3D
31. Altmetric Badge
    Chapter 30 Compact Voronoi Diagrams for Moving Convex Polygons
32. Altmetric Badge
    Chapter 31 Efficient Expected-Case Algorithms for Planar Point Location
33. Altmetric Badge
    Chapter 32 A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon
34. Altmetric Badge
    Chapter 33 The Enhanced Double Digest Problem for DNA Physical Mapping
35. Altmetric Badge
    Chapter 34 Generalization of a Suffix Tree for RNA Structural Pattern Matching
36. Altmetric Badge
    Chapter 35 Efficient Computation of All Longest Common Subsequences
37. Altmetric Badge
    Chapter 36 A Blocked All-Pairs Shortest-Paths Algorithm
38. Altmetric Badge
    Chapter 37 On External-Memory MST, SSSP, and Multi-way Planar Graph Separation
39. Altmetric Badge
    Chapter 38 I/O-Space Trade-Offs
40. Altmetric Badge
    Chapter 39 Optimal Flow Aggregation
41. Altmetric Badge
    Chapter 40 On the Complexities of the Optimal Rounding Problems of Sequences and Matrices
42. Altmetric Badge
    Chapter 41 On the Complexity of the Sub-permutation Problem
43. Altmetric Badge
    Chapter 42 Parallel Attribute-Efficient Learning of Monotone Boolean Functions
44. Altmetric Badge
    Chapter 43 Max- and Min-Neighborhood Monopolies
45. Altmetric Badge
    Chapter 44 Optimal Adaptive Fault Diagnosis of Hypercubes
46. Altmetric Badge
    Chapter 45 Fibonacci Correction Networks
47. Altmetric Badge
    Chapter 46 Least Adaptive Optimal Search with Unreliable Tests