Algorithms—ESA '93

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 39 The influence of lookahead in competitive paging algorithms
3. Altmetric Badge
   Chapter 40 An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
4. Altmetric Badge
   Chapter 41 Efficient self simulation algorithms for reconfigurable arrays
5. Altmetric Badge
   Chapter 42 Optimal upward planarity testing of single-source digraphs
6. Altmetric Badge
   Chapter 43 On bufferless routing of variable-length messages in leveled networks
7. Altmetric Badge
   Chapter 44 Saving comparisons in the Crochemore-Perrin string matching algorithm
8. Altmetric Badge
   Chapter 45 Unambiguity of extended regular expressions in SGML document grammars
9. Altmetric Badge
   Chapter 46 On the direct sum conjecture in the straight line model
10. Altmetric Badge
    Chapter 47 Combine and conquer: A general technique for dynamic algorithms
11. Altmetric Badge
    Chapter 48 Optimal CREW-PRAM algorithms for direct dominance problems
12. Altmetric Badge
    Chapter 49 Trekking in the Alps without freezing or getting tired
13. Altmetric Badge
    Chapter 50 Dog bites postman: Point location in the moving Voronoi diagram and related problems
14. Altmetric Badge
    Chapter 51 Parallel approximation schemes for problems on planar graphs
15. Altmetric Badge
    Chapter 52 DNA physical mapping: Three ways difficult
16. Altmetric Badge
    Chapter 53 A calculus of random generation
17. Altmetric Badge
    Chapter 54 The bit complexity of distributed sorting
18. Altmetric Badge
    Chapter 55 Three-clustering of points in the plane
19. Altmetric Badge
    Chapter 56 Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphs
20. Altmetric Badge
    Chapter 57 Fully dynamic planarity testing in planar embedded graphs
21. Altmetric Badge
    Chapter 58 Fully dynamic algorithms for bin packing: Being (mostly) myopic helps
22. Altmetric Badge
    Chapter 59 Increasing the vertex-connectivity in directed graphs
23. Altmetric Badge
    Chapter 60 On the recognition of permuted bottleneck monge matrices
24. Altmetric Badge
    Chapter 61 Computing treewidth and minimum fill-in: All you need are the minimal separators
25. Altmetric Badge
    Chapter 62 Block gossiping on grids and tori: Deterministic sorting and routing match the bisection bound
26. Altmetric Badge
    Chapter 63 The complexity of scheduling trees with communication delays
27. Altmetric Badge
    Chapter 64 Optimal tree contraction on the hypercube and related networks
28. Altmetric Badge
    Chapter 65 Evolution of an algorithm
29. Altmetric Badge
    Chapter 66 Mesh connected computers with fixed and reconfigurable buses: Packet routing, sorting, and selection
30. Altmetric Badge
    Chapter 67 An efficient parallel algorithm for the layered planar monotone circuit value problem
31. Altmetric Badge
    Chapter 68 Randomized routing on meshes with buses
32. Altmetric Badge
    Chapter 69 On the distribution of the transitive closure in a random acyclic digraph
33. Altmetric Badge
    Chapter 70 Complexity of disjoint paths problems in planar graphs
34. Altmetric Badge
    Chapter 71 Integer multicommodity flows with reduced demands
35. Altmetric Badge
    Chapter 72 A fully dynamic data structure for reachability in planar digraphs
36. Altmetric Badge
    Chapter 73 A linear-time algorithm for edge-disjoint paths in planar graphs
37. Altmetric Badge
    Chapter 74 Sequence comparison and statistical significance in molecular biology
38. Altmetric Badge
    Chapter 75 Surface reconstruction between simple polygons via angle criteria
39. Altmetric Badge
    Chapter 76 A linear algorithm for edge-coloring partial k -trees