Report (716)
11301.
Report
Using (sub)graphs of small width for solving the Steiner problem. Max-Planck-Institut für Informatik, Saarbrücken (2002), 9 pp.
11302.
Report
The factor algorithm for all-to-all communication on clusters of SMP nodes. Max-Planck-Institut für Informatik, Saarbrücken (2002), 8 pp.
11303.
Report
Fifth Biennial Report: June 1999 - August 2001 (Biennial Report / Max-Planck-Institut für Informatik, 5). Max-Planck-Institut für Informatik, Saarbrücken (2001), 278 pp.
11304.
Report
Experiments with iterative improvement algorithms on completely unimodel hypercubes. Max-Planck-Institut für Informatik, Saarbrücken (2001), 25 pp.
11305.
Report
Linear one-sided stability of MAT for weakly injective domain. Max-Planck-Institut für Informatik, Saarbrücken (2001), 18 pp.
11306.
Report
A Randomized On-line Algorithm for the k-Server Problem on a Line. DIMACS-Center for Discrete Mathematics & Theoretical Computer Science, Piscataway, NJ (2001)
11307.
Report
Efficient light transport using precomputed visibility. Max-Planck-Institut für Informatik, Saarbrücken (2001), 32 pp.
11308.
Report
Proceeding of the Second International Workshop of the Implementation of Logics. Max-Planck-Institut für Informatik, Saarbrücken (2001), 102 pp.
11309.
Report
An adaptable and extensible geometry kernel. Max-Planck-Institut für Informatik, Saarbrücken (2001), 27 pp.
11310.
Report
Approximating minimum size 1,2-connected networks. Max-Planck-Institut für Informatik, Saarbrücken (2001), 22 pp.
11311.
Report
A framework for the acquisition, processing and interactive display of high quality 3D models. Max-Planck-Institut für Informatik, Saarbrücken (2001), 39 pp.
11312.
Report
Image-based reconstruction of spatially varying materials. Max-Planck-Institut für Informatik, Saarbrücken (2001), 20 pp.
11313.
Report
A framework for the acquisition, processing, transmission, and interactive display of high quality 3D models on the Web. Max-Planck-Institut für Informatik, Saarbrücken (2001), 20 pp.
11314.
Report
Directed single-source shortest-paths in linear average-case time. Max-Planck-Institut für Informatik, Saarbrücken (2001), 32 pp.
11315.
Report
Extending reduction techniques for the Steiner tree problem: a combination of alternative-and bound-based approaches. Max-Planck-Institut für Informatik, Saarbrücken (2001), 24 pp.
11316.
Report
Partitioning techniques for the Steiner problem. Max-Planck-Institut für Informatik, Saarbrücken (2001), 21 pp.
11317.
Report
On Steiner trees and minimum spanning trees in hypergraphs. Max-Planck-Institut für Informatik, Saarbrücken (2001), 15 pp.
11318.
Report
Implementation of planar Nef polyhedra. Max-Planck-Institut für Informatik, Saarbrücken (2001), 345 pp.
11319.
Report
Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators. Max-Planck-Institut für Informatik, Saarbrücken (2001), 41 pp.
11320.
Report
Superposition and chaining for totally ordered divisible abelian groups. Max-Planck-Institut für Informatik, Saarbrücken (2001), 40 pp.