Report (716)
11721.
Report
An optimal algorithm for the on-line closest-pair problem. Max-Planck-Institut für Informatik, Saarbrücken (1991), 11 pp.
11722.
Report
An O(n log n log log n) algorithm for the on-line closes pair problem. Max-Planck-Institut für Informatik, Saarbrücken (1991), 21 pp.
11723.
Report
Maintaining the minimal distance of a point set in polylogarithmic time (revised version). Max-Planck-Institut für Informatik, Saarbrücken (1991), 17 pp.
11724.
Report
Range trees with slack parameter. Max-Planck-Institut für Informatik, Saarbrücken (1991), 11 pp.
11725.
Report
Dynamic rectangular point location, with an application to the closest pair problem. Max-Planck-Institut für Informatik, Saarbrücken (1991), 28 pp.
11726.
Report
Edge separators for graphs of bounded genus with applications. Max-Planck-Institut für Informatik, Saarbrücken (1991), 10 pp.
11727.
Report
On crossing numbers of hypercubes and cube connected cycles. Max-Planck-Institut für Informatik, Saarbrücken (1991), 6 pp.
11728.
Report
A sorted logic using dynamic sorts. Max-Planck-Institut für Informatik, Saarbrücken (1991), 71 pp.
11729.
Report
Hidden line elimination for isooriented rectangles. Fachbereich Informatik, Universität des Saarlandes, Saarbrücken (1990)
11730.
Report
89). Institut für Ökonometrie und Operations Research, Bonn (1989)
Routing Problems in Grid Graphs (Report, 11731.
Report
89/05). Teubner, Bonn, Germany (1989)
Routing Problems in Grid Graphs (SFB Report, 11732.
Report
On the Construction of Abstract Voronoi Diagrams, II. Universtität des Saarlandes / Fachbereich Informatik, Saarbrücken (1989)
11733.
Report
On the construction of abstract Voronoi diagrams. Fachbereich Informatik, Universität des Saarlandes, Saarbrücken (1989)
11734.
Report
Data structures. Fachbereich Informatik, Universität des Saarlandes, Saarbrücken (1989)
11735.
Report
Faster Algorithms for the Shortest Path Problem. MIT Operations Research Center, Cambridge (1988), 34 pp.
11736.
Report
Faster Algorithms for the Shortest Path Problem. Fachbereich Informatik, Universität des Saarlandes, Saarbrücken (1988)
11737.
Report
A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs. SFB Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken (1988)
11738.
Report
Compaction on the Torus. Facgbereich 10, Informatik, Universität des Saarlandes, Saarbrücken (1988)
11739.
Report
Congruence, Similarity and Symmetries of Geometric Objects. Universität des Saarlandes / Fachbereich Informatik, Saarbrücken (1987)
11740.
Report
Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees. SFB Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken (1987)