Algorithms — ESA '96

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 42 Analysis of Shellsort and related algorithms
3. Altmetric Badge
   Chapter 43 Drawing with colors
4. Altmetric Badge
   Chapter 44 Approximating the unsatisfiability threshold of random formulas (Extended Abstract)
5. Altmetric Badge
   Chapter 45 Preemptive weighted completion time scheduling of parallel jobs
6. Altmetric Badge
   Chapter 46 Approximation algorithms for dynamic storage allocation
7. Altmetric Badge
   Chapter 47 Positive linear programming, parallel approximation and PCP's
8. Altmetric Badge
   Chapter 48 Scheduling jobs with communication delays: Using infeasible solutions for approximation
9. Altmetric Badge
   Chapter 49 Randomization of search trees by subtree size
10. Altmetric Badge
    Chapter 50 Efficient dynamic method-lookup for object oriented languages
11. Altmetric Badge
    Chapter 51 Priority queues: Small, monotone and trans-dichotomous
12. Altmetric Badge
    Chapter 52 Simulated Annealing and its problems to color graphs
13. Altmetric Badge
    Chapter 53 The capacitated K-center problem
14. Altmetric Badge
    Chapter 54 A unified local ratio approximation of node-deletion problems
15. Altmetric Badge
    Chapter 55 Approximation algorithms for connected dominating sets
16. Altmetric Badge
    Chapter 56 Greedy algorithms for the shortest common superstring that are asymtotically optimal
17. Altmetric Badge
    Chapter 57 On the depth of randomly generated circuits
18. Altmetric Badge
    Chapter 58 The analysis of linear probing hashing with buckets
19. Altmetric Badge
    Chapter 59 Parallel algorithms for partitioning sorted sets and related problems
20. Altmetric Badge
    Chapter 60 Fast generation of random permutations via networks simulation
21. Altmetric Badge
    Chapter 61 On the Parallel Dynamic Dictionary Matching problem: New results with applications
22. Altmetric Badge
    Chapter 62 Parallel algorithms for series parallel graphs
23. Altmetric Badge
    Chapter 63 Parallel complexity of householder QR factorization
24. Altmetric Badge
    Chapter 64 Reporting red-blue intersections between two sets of connected line segments
25. Altmetric Badge
    Chapter 65 Matching convex shapes with respect to the symmetric difference
26. Altmetric Badge
    Chapter 66 On minimum-area hulls
27. Altmetric Badge
    Chapter 67 Negative-cycle detection algorithms
28. Altmetric Badge
    Chapter 68 A new regular grammar pattern matching algorithm
29. Altmetric Badge
    Chapter 69 Lempel-Ziv index for q -grams
30. Altmetric Badge
    Chapter 70 Computing upper and lower bounds on textile nesting problems
31. Altmetric Badge
    Chapter 71 On-line and off-line approximation algorithms for vector covering problems
32. Altmetric Badge
    Chapter 72 Competitive analysis of randomized paging algorithms
33. Altmetric Badge
    Chapter 73 On-line competitive algorithms for call admission in optical networks
34. Altmetric Badge
    Chapter 74 Race-condition detection in parallel computation with semaphores (extended abstract)
35. Altmetric Badge
    Chapter 75 Efficient wavelength routing on directed fiber trees
36. Altmetric Badge
    Chapter 76 A lower bound for nearly minimal adaptive and hot potato algorithms
37. Altmetric Badge
    Chapter 77 The structure of circular decomposable metrics
38. Altmetric Badge
    Chapter 78 Faster algorithms for subgraph isomorphism of κ-connected partial κ-trees
39. Altmetric Badge
    Chapter 79 Planar spanners and approximate shortest path queries among obstacles in the plane
40. Altmetric Badge
    Chapter 80 A new approach to optimal planning of robot motion on a tree with obstacles
41. Altmetric Badge
    Chapter 81 Generalized streets revisited
42. Altmetric Badge
    Chapter 82 Computational aspects of organization theory