Algorithms - ESA '93 First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993. Proceedings

Symposium on Algorithms (ESA '93), held in Bad Honnef, near Boon, in Germany, September 30 - October 2, 1993. The symposium is intended to launchan annual series of international conferences, held in early fall, covering the field of algorithms. Within the scope of the symposium lies all research on algorithms, theoretical as well as applied, that is carried out in the fields of computer science and discrete applied mathematics. The symposium aims to cater to both of these research communities and to intensify the exchange between them. The volume contains 35 contributed papers selected from 101 proposals submitted in response to the call for papers, as well as three invited lectures: "Evolution of an algorithm" by Michael Paterson, "Complexity of disjoint paths problems in planar graphs" by Alexander Schrijver, and "Sequence comparison and statistical significance in molecular biology" by Michael S. Waterman.

The influence of lookahead in competitive paging algorithms.- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications.- Efficient self simulation algorithms for reconfigurable arrays.- Optimal upward planarity testing of single-source digraphs.- On bufferless routing of variable-length messages in leveled networks.- Saving comparisons in the Crochemore-Perrin string matching algorithm.- Unambiguity of extended regular expressions in SGML document grammars.- On the direct sum conjecture in the straight line model.- Combine and conquer: A general technique for dynamic algorithms.- Optimal CREW-PRAM algorithms for direct dominance problems.- Trekking in the Alps without freezing or getting tired.- Dog bites postman: Point location in the moving Voronoi diagram and related problems.- Parallel approximation schemes for problems on planar graphs.- DNA physical mapping: Three ways difficult.- A calculus of random generation.- The bit complexity of distributed sorting.- Three-clustering of points in the plane.- Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphs.- Fully dynamic planarity testing in planar embedded graphs.- Fully dynamic algorithms for bin packing: Being (mostly) myopic helps.- Increasing the vertex-connectivity in directed graphs.- On the recognition of permuted bottleneck monge matrices.- Computing treewidth and minimum fill-in: All you need are the minimal separators.- Block gossiping on grids and tori: Deterministic sorting and routing match the bisection bound.- The complexity of scheduling trees with communication delays.- Optimal tree contraction on the hypercube and related networks.- Evolution of an algorithm.- Mesh connected computers with fixed and reconfigurable buses: Packet routing, sorting, and selection.- An efficient parallel algorithm for the layered planar monotone circuit value problem.- Randomized routing on meshes with buses.- On the distribution of the transitive closure in a random acyclic digraph.- Complexity of disjoint paths problems in planar graphs.- Integer multicommodity flows with reduced demands.- A fully dynamic data structure for reachability in planar digraphs.- A linear-time algorithm for edge-disjoint paths in planar graphs.- Sequence comparison and statistical significance in molecular biology.- Surface reconstruction between simple polygons via angle criteria.- A linear algorithm for edge-coloring partial k-trees.