S. Näher

Available identifiers

zbMath Open naher.stefanMaRDI QIDQ908707

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q4643868	2018-05-29	Paper
Slanted Orthogonal Drawings: Model, Algorithms and Evaluations	2015-01-15	Paper
Certifying algorithms	2014-10-24	Paper
Slanted Orthogonal Drawings	2013-12-20	Paper
Multi-core Implementations of Geometric Algorithms	2009-11-12	Paper
LEDA. A platform for combinatorial and geometric computing. 2-part set	2009-07-22	Paper
Structural filtering: a paradigm for efficient and exact geometric programs	2005-08-05	Paper
https://portal.mardi4nfdi.de/entity/Q4471638	2004-07-30	Paper
https://portal.mardi4nfdi.de/entity/Q4417670	2003-07-29	Paper
https://portal.mardi4nfdi.de/entity/Q4411407	2003-07-08	Paper
https://portal.mardi4nfdi.de/entity/Q4331302	2002-05-15	Paper
https://portal.mardi4nfdi.de/entity/Q4702188	1999-11-24	Paper
Checking geometric programs or verification of geometric structures	1999-05-03	Paper
https://portal.mardi4nfdi.de/entity/Q4718223	1997-04-10	Paper
https://portal.mardi4nfdi.de/entity/Q4281577	1995-11-23	Paper
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures	1993-01-17	Paper
Dynamic fractional cascading	1990-01-01	Paper
Bounded ordered dictionaries in O(log log N) time and O(n) space	1990-01-01	Paper
Hidden line elimination for isooriented rectangles	1990-01-01	Paper
A Lower Bound on the Complexity of the Union-Split-Find Problem	1988-01-01	Paper
A log log n data structure for three-sided range queries	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3774943	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3684044	1985-01-01	Paper

Research outcomes over time

This page was built for person: S. Näher