Travelled to:1 × Italy
2 × Germany
Collaborated with:K.Mehlhorn M.Bäsken C.Uhrig H.Alt
Talks about:algorithm (2) geometr (2) leda (2) combinatori (1) platform (1) interact (1) problem (1) librari (1) generic (1) complex (1)
Person: Stefan Näher
DBLP: N=auml=her:Stefan
Contributed to:
2001
199719901987Wrote 4 papers:
- SVIS-2001-BaskenN #algorithm #geometry #interactive #named #visualisation
- GeoWin — A Generic Tool for Interactive Visualization of Geometric Algorithms (MB, SN), pp. 88–100.
- ICALP-1997-MehlhornNU #combinator #framework #geometry #platform
- The LEDA Platform of Combinatorial and Geometric Computing (KM, SN, CU), pp. 7–16.
- ICALP-1990-NaherM #algorithm #data type #library #named #performance
- LEDA: A Library of Efficient Data Types and Algorithms (SN, KM), pp. 1–5.
- ICALP-1987-MehlhornNA #bound #complexity #problem
- A Lower Bound for the Complexity of the Union-Split-Find Problem (KM, SN, HA), pp. 479–488.