Stefan Näher

According to our database1, Stefan Näher authored at least 40 papers between 1982 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Engineering DFS-Based Graph Algorithms.
CoRR, 2017

2014
Slanted Orthogonal Drawings: Model, Algorithms and Evaluations.
J. Graph Algorithms Appl., 2014

2013
Slanted Orthogonal Drawings.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

2011
Certifying algorithms.
Comput. Sci. Rev., 2011

The Travelling Salesman Problem.
Proceedings of the Algorithms Unplugged, 2011

2009
Multi-core Implementations of Geometric Algorithms.
Proceedings of the Efficient Algorithms, 2009

2008
Das Travelling Salesman Problem.
Proceedings of the Taschenbuch der Algorithmen, 2008

A Framework for Multi-Core Implementations of Divide and Conquer Algorithms and its Application to the Convex Hull Problem.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
Experimental Evaluation of Structural Filtering as a Tool for Exact and Efficient Geometric Computing.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2005
Structural filtering: a paradigm for efficient and exact geometric programs.
Comput. Geom., 2005

2004
LEDA, a Platform for Combinatorial and Geometric Computing.
Proceedings of the Handbook of Data Structures and Applications., 2004

Two computational geometry libraries: LEDA and CGAL.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

2002
Design and Implementation of Efficient Data Types for Static Graphs.
Proceedings of the Algorithms, 2002

2001
GeoWin - A Generic Tool for Interactive Visualization of Geometric Algorithms.
Proceedings of the Software Visualization, 2001

2000
Visualization in Algorithm Engineering: Tools and Techniques.
Proceedings of the Experimental Algorithmics, 2000

1999
Checking geometric programs or verification of geometric structures.
Comput. Geom., 1999

LEDA: A Platform for Combinatorial and Geometric Computing.
Cambridge University Press, ISBN: 0-521-56329-1, 1999

1998
A computational basis for higher-dimensional computational geometry and applications.
Comput. Geom., 1998

From Algorithms to Working Programs on the Use of Program Checking in LEDA.
Proceedings of the Fundamentals - Foundations of Computer Science, 1998


1997
The LEDA Platform of Combinatorial and Geometric Computing.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1995
LEDA: A Platform for Combinatorial and Geometric Computing.
Commun. ACM, 1995

Exact Geometric Computation in LEDA.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
The Implementation of Geometric Algorithms.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1993
LEDA: A Library of Efficient Data Types and Algorithms.
Proceedings of the STACS 93, 1993

1992
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.
Algorithmica, 1992

Algorithm Design and Software Libraries: Recent Developments in the LEDA Project.
Proceedings of the Algorithms, Software, Architecture, 1992

Selected Topics from Computational Geometry, Data Structures and Motion Planning.
Proceedings of the Data Structures and Efficient Algorithms, 1992

1990
A faster compaction algorithm with automatic jog insertion.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1990

On the Complexity of a Game Related to the Dictionary Problem.
SIAM J. Comput., 1990

Hidden Line Elimination for Isooriented Rectangels.
Inf. Process. Lett., 1990

Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space.
Inf. Process. Lett., 1990

Dynamic Fractional Cascading.
Algorithmica, 1990

LEDA: A Library of Efficient Data Types and Algorithms.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1988
A Lower Bound on the Complexity of the Union-Split-Find Problem.
SIAM J. Comput., 1988

1987
Dynamic Fractional Cascading oder die Verwaltung vieler linearer Listen.
PhD thesis, 1987

A log log n Data Structure for Three-Sided Range Queries.
Inf. Process. Lett., 1987

1986
An analysis of ternary simulation as a tool for race detection in digital MOS circuits.
Integr., 1986

1985
Dynamization of geometric data structures.
Proceedings of the First Annual Symposium on Computational Geometry, 1985

1982
A Probabilistic Algorithm for Vertex Connectivity of Graphs.
Inf. Process. Lett., 1982


  Loading...