A Probabilistic Algorithm for Vertex Connectivity of Graphs. - Michael Becker 009; W. Degenhardt; Jürgen Doenhardt; Stefan Hertel; Gerd Kaninke; W. Kerber; Kurt Mehlhorn; Stefan Näher; Hans Rohnert; Thomas Winter (Inf. Process. Lett., 1982)

Dynamization of geometric data structures. - Otfried Fries; Kurt Mehlhorn; Stefan Näher (SCG, 1985)

An analysis of ternary simulation as a tool for race detection in digital MOS circuits. - Thomas Lengauer; Stefan Näher (Integr., 1986)

A log log n Data Structure for Three-Sided Range Queries. - Otfried Fries; Kurt Mehlhorn; Stefan Näher; Athanasios K. Tsakalidis (Inf. Process. Lett., 1987)

Dynamic Fractional Cascading oder die Verwaltung vieler linearer Listen. - Stefan Näher (1987)

A Lower Bound on the Complexity of the Union-Split-Find Problem. - Kurt Mehlhorn; Stefan Näher; Helmut Alt (SIAM J. Comput., 1988)

LEDA: A Library of Efficient Data Types and Algorithms. - Stefan Näher; Kurt Mehlhorn (ICALP, 1990)

Dynamic Fractional Cascading. - Kurt Mehlhorn; Stefan Näher (Algorithmica, 1990)

Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space. - Kurt Mehlhorn; Stefan Näher (Inf. Process. Lett., 1990)

Hidden Line Elimination for Isooriented Rectangels. - Kurt Mehlhorn; Stefan Näher; Christian Uhrig (Inf. Process. Lett., 1990)

On the Complexity of a Game Related to the Dictionary Problem. - Kurt Mehlhorn; Stefan Näher; Monika Rauch (SIAM J. Comput., 1990)

A faster compaction algorithm with automatic jog insertion. - Kurt Mehlhorn; Stefan Näher (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990)

Selected Topics from Computational Geometry, Data Structures and Motion Planning. - Rudolf Fleischer; Otfried Fries; Kurt Mehlhorn; Stefan Meiser; Stefan Näher; Hans Rohnert; Stefan Schirra; Klaus Simon; Athanasios K. Tsakalidis; Christian Uhrig (Data Structures and Efficient Algorithms, 1992)

Algorithm Design and Software Libraries: Recent Developments in the LEDA Project. - Kurt Mehlhorn; Stefan Näher (IFIP Congress (1), 1992)

Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. - Helmut Alt; Rudolf Fleischer; Michael Kaufmann 001; Kurt Mehlhorn; Stefan Näher; Stefan Schirra; Christian Uhrig (Algorithmica, 1992)

LEDA: A Library of Efficient Data Types and Algorithms. - Stefan Näher (STACS, 1993)

The Implementation of Geometric Algorithms. - Kurt Mehlhorn; Stefan Näher (IFIP Congress (1), 1994)

Exact Geometric Computation in LEDA. - Christoph Burnikel; Jochen Könemann; Kurt Mehlhorn; Stefan Näher; Stefan Schirra; Christian Uhrig (SCG, 1995)

LEDA: A Platform for Combinatorial and Geometric Computing. - Kurt Mehlhorn; Stefan Näher (Commun. ACM, 1995)

The LEDA Platform of Combinatorial and Geometric Computing. - Kurt Mehlhorn; Stefan Näher; Christian Uhrig (ICALP, 1997)

AGD-Library: A Library of Algorithms for Graph Drawing. - David Alberts; Carsten Gutwenger; Petra Mutzel; Stefan Näher (WAE, 1997)

A Robust and Efficient Implementation of a Sweep Line Algorithm for the Straight Line Segment Intersection Problem. - Ulrike Bartuschka; Kurt Mehlhorn; Stefan Näher (WAE, 1997)

A Library of Algorithms for Graph Drawing. - Petra Mutzel; Carsten Gutwenger; Ralf Brockenauer; Sergej Fialko; Gunnar W. Klau; Michael Krüger; Thomas Ziegler 002; Stefan Näher; David Alberts; Dirk Ambras; Gunter Koch; Michael Jünger; et al. (GD, 1998)

From Algorithms to Working Programs on the Use of Program Checking in LEDA. - Kurt Mehlhorn; Stefan Näher (IFIP Congress: Fundamentals - Foundations of Computer Science, 1998)

A computational basis for higher-dimensional computational geometry and applications. - Kurt Mehlhorn; Michael Müller 002; Stefan Näher; Stefan Schirra; Michael Seel; Christian Uhrig; Joachim Ziegler (Comput. Geom., 1998)

LEDA: A Platform for Combinatorial and Geometric Computing. - Kurt Mehlhorn; Stefan Näher (Cambridge University Press, 1999)

Checking geometric programs or verification of geometric structures. - Kurt Mehlhorn; Stefan Näher; Michael Seel; Raimund Seidel; Thomas Schilz; Stefan Schirra; Christian Uhrig (Comput. Geom., 1999)

Visualization in Algorithm Engineering: Tools and Techniques. - Camil Demetrescu; Irene Finocchi; Giuseppe F. Italiano; Stefan Näher (Experimental Algorithmics, 2000)

GeoWin - A Generic Tool for Interactive Visualization of Geometric Algorithms. - Matthias Bäsken; Stefan Näher (Software Visualization, 2001)

Design and Implementation of Efficient Data Types for Static Graphs. - Stefan Näher; Oliver Zlotowski (ESA, 2002)

Two computational geometry libraries: LEDA and CGAL. - Lutz Kettner; Stefan Näher (Handbook of Discrete and Computational Geometry, 2nd Ed., 2004)

LEDA, a Platform for Combinatorial and Geometric Computing. - Stefan Näher (Handbook of Data Structures and Applications, 2004)

Structural filtering: a paradigm for efficient and exact geometric programs. - Stefan Funke; Kurt Mehlhorn; Stefan Näher (Comput. Geom., 2005)

Experimental Evaluation of Structural Filtering as a Tool for Exact and Efficient Geometric Computing. - Stefan Näher; Martin Taphorn (CCCG, 2007)

A Framework for Multi-Core Implementations of Divide and Conquer Algorithms and its Application to the Convex Hull Problem. - Stefan Näher; Daniel Schmitt 002 (CCCG, 2008)

Das Travelling Salesman Problem. - Stefan Näher (Taschenbuch der Algorithmen, 2008)

Multi-core Implementations of Geometric Algorithms. - Stefan Näher; Daniel Schmitt 002 (Efficient Algorithms, 2009)

The Travelling Salesman Problem. - Stefan Näher (Algorithms Unplugged, 2011)

Certifying algorithms. - Ross M. McConnell; Kurt Mehlhorn; Stefan Näher; Pascal Schweitzer (Comput. Sci. Rev., 2011)

Slanted Orthogonal Drawings. - Michael A. Bekos; Michael Kaufmann 001; Robert Krug 001; Stefan Näher; Vincenzo Roselli (GD, 2013)

Slanted Orthogonal Drawings: Model, Algorithms and Evaluations. - Michael A. Bekos; Michael Kaufmann 001; Robert Krug 001; Thorsten Ludwig; Stefan Näher; Vincenzo Roselli (J. Graph Algorithms Appl., 2014)

Engineering DFS-Based Graph Algorithms. - Kurt Mehlhorn; Stefan Näher; Peter Sanders 001 (CoRR, 2017)