Geometric spanner networks von Narasimhan, Giri, Smid, Michiel

Inhaltsverzeichnis

Efficient algorithms for constructing tolerant geometric spanners von Levcopoulos, Christos, Narasimhan, Giri, Smid, Michiel

Maintaining the minimal distance of a point set in less than linear time von Smid, Michiel

Dynamic data structures on multiple storage media a tutorial von Smid, Michiel, Emde Boas, Peter van

Dynamic data structures on multiple storage media von Smid, Michiel H.

Approximation algorithms for the bottleneck stretch factor problem von Narasimhan, Giri, Smid, Michiel

Computing the width of a three-dimensional point set documentation von Schwerdt, Jörg 1969-, Smid, Michiel

Approximating the stretch factor of Euclidean paths, cycles and trees von Narasimhan, Giri, Smid, Michiel

Improved algorithms for constructing fault-tolerant spanners von Levcopoulos, Christos, Narasimhan, Giri, Smid, Michiel

Approximating the stretch factor of Euclidean graphs von Narasimhan, Giri, Smid, Michiel

Using persistent data structures for adding range restrictions to searching problems von Lenhof, Hans-Peter, Smid, Michiel

A worst-case algorithm for semi-online updates on decomposable problems von Smid, Michiel

The reconstruction problem for dynamic data structures an overview von Smid, Michiel