Stefan Näher

Publication Activity (10 Years)

Years Active: 1982-2017
Publications (10 Years): 1

Top Venues

CoRR

Graph Drawing

J. Graph Algorithms Appl.

Saarland University, Saarbrücken, Germany (PHD)

Education History

Saarland University, Saarbrücken, Germany

PHD

Publications

Kurt Mehlhorn, Stefan Näher, Peter Sanders
Engineering DFS-Based Graph Algorithms. CoRR (2017)
Michael A. Bekos, Michael Kaufmann, Robert Krug, Thorsten Ludwig, Stefan Näher, Vincenzo Roselli
Slanted Orthogonal Drawings: Model, Algorithms and Evaluations. J. Graph Algorithms Appl. 18 (3) (2014)
Michael A. Bekos, Michael Kaufmann, Robert Krug, Stefan Näher, Vincenzo Roselli
Slanted Orthogonal Drawings. Graph Drawing (2013)
Ross M. McConnell, Kurt Mehlhorn, Stefan Näher, Pascal Schweitzer
Certifying algorithms. Comput. Sci. Rev. 5 (2) (2011)
Stefan Näher, Daniel Schmitt
Multi-core Implementations of Geometric Algorithms. Efficient Algorithms (2009)
Stefan Näher, Daniel Schmitt
A Framework for Multi-Core Implementations of Divide and Conquer Algorithms and its Application to the Convex Hull Problem. CCCG (2008)
Stefan Näher, Martin Taphorn
Experimental Evaluation of Structural Filtering as a Tool for Exact and Efficient Geometric Computing. CCCG (2007)
Stefan Funke, Kurt Mehlhorn, Stefan Näher
Structural filtering: a paradigm for efficient and exact geometric programs. Comput. Geom. 31 (3) (2005)
Stefan Näher, Oliver Zlotowski
Design and Implementation of Efficient Data Types for Static Graphs. ESA (2002)
Matthias Bäsken, Stefan Näher
GeoWin - A Generic Tool for Interactive Visualization of Geometric Algorithms. Software Visualization (2001)
Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher
Visualization in Algorithm Engineering: Tools and Techniques. Experimental Algorithmics (2000)
Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, Christian Uhrig
Checking geometric programs or verification of geometric structures. Comput. Geom. 12 (1-2) (1999)
Stefan Funke, Kurt Mehlhorn, Stefan Näher
Structural filtering: A paradigm for efficient and exact geometric programs. CCCG (1999)
Petra Mutzel, Carsten Gutwenger, Ralf Brockenauer, Sergej Fialko, Gunnar W. Klau, Michael Krüger, Thomas Ziegler, Stefan Näher, David Alberts, Dirk Ambras, Gunter Koch, Michael Jünger, Christoph Buchheim, Sebastian Leipert
A Library of Algorithms for Graph Drawing. Graph Drawing (1998)
Kurt Mehlhorn, Stefan Näher
From Algorithms to Working Programs: On the Use of Program Checking in LEDA. MFCS (1998)
Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler
A computational basis for higher-dimensional computational geometry and applications. Comput. Geom. 10 (4) (1998)
Kurt Mehlhorn, Stefan Näher
From Algorithms to Working Programs on the Use of Program Checking in LEDA. IFIP Congress: Fundamentals - Foundations of Computer Science (1998)
Kurt Mehlhorn, Stefan Näher, Christian Uhrig
The LEDA Platform of Combinatorial and Geometric Computing. ICALP (1997)
David Alberts, Carsten Gutwenger, Petra Mutzel, Stefan Näher
AGD-Library: A Library of Algorithms for Graph Drawing. WAE (1997)
Ulrike Bartuschka, Kurt Mehlhorn, Stefan Näher
A Robust and Efficient Implementation of a Sweep Line Algorithm for the Straight Line Segment Intersection Problem. WAE (1997)
Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler
A Computational Basis for Higher-Dimensional Computational Geometry and Applications. SCG (1997)
Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, Christian Uhrig
Checking Geometric Programs or Verification of Geometric Structures. SCG (1996)
Kurt Mehlhorn, Stefan Näher, Christian Uhrig
The LEDA Platform for Combinatorial and Geometric Computing. GI Jahrestagung (1996)
Kurt Mehlhorn, Stefan Näher
LEDA: A Platform for Combinatorial and Geometric Computing. Commun. ACM 38 (1) (1995)
Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
Exact Geometric Computation in LEDA. SCG (1995)
Kurt Mehlhorn, Stefan Näher
The Implementation of Geometric Algorithms. IFIP Congress (1) (1994)
Stefan Näher
LEDA: A Library of Efficient Data Types and Algorithms. STACS (1993)
Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios K. Tsakalidis, Christian Uhrig
Selected Topics from Computational Geometry, Data Structures and Motion Planning. Data Structures and Efficient Algorithms (1992)
Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. Algorithmica 8 (5&6) (1992)
Kurt Mehlhorn, Stefan Näher
Algorithm Design and Software Libraries: Recent Developments in the LEDA Project. IFIP Congress (1) (1992)
Stefan Näher, Kurt Mehlhorn
LEDA: A Library of Efficient Data Types and Algorithms. ICALP (1990)
Kurt Mehlhorn, Stefan Näher, Christian Uhrig
Hidden Line Elimination for Isooriented Rectangels. Inf. Process. Lett. 35 (3) (1990)
Kurt Mehlhorn, Stefan Näher
Dynamic Fractional Cascading. Algorithmica 5 (2) (1990)
Kurt Mehlhorn, Stefan Näher, Monika Rauch
On the Complexity of a Game Related to the Dictionary Problem. SIAM J. Comput. 19 (5) (1990)
Stefan Näher, Kurt Mehlhorn
LEDA - A Library of Efficient Data Types and Algorithms. GI Jahrestagung (1) (1990)
Kurt Mehlhorn, Stefan Näher
A faster compaction algorithm with automatic jog insertion. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9 (2) (1990)
Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. SCG (1990)
Kurt Mehlhorn, Stefan Näher
Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space. Inf. Process. Lett. 35 (4) (1990)
Kurt Mehlhorn, Stefan Näher, Monika Rauch
On the Complexity of a Game Related to the Dictionary Problem FOCS (1989)
Kurt Mehlhorn, Stefan Näher
LEDA: A Library of Efficient Data Types and Algorithms. MFCS (1989)
Kurt Mehlhorn, Stefan Näher, Helmut Alt
A Lower Bound on the Complexity of the Union-Split-Find Problem. SIAM J. Comput. 17 (6) (1988)
Otfried Fries, Kurt Mehlhorn, Stefan Näher, Athanasios K. Tsakalidis
A log log n Data Structure for Three-Sided Range Queries. Inf. Process. Lett. 25 (4) (1987)
Kurt Mehlhorn, Stefan Näher, Helmut Alt
A Lower Bound for the Complexity of the Union-Split-Find Problem. ICALP (1987)
Thomas Lengauer, Stefan Näher
An analysis of ternary simulation as a tool for race detection in digital MOS circuits. Integr. 4 (4) (1986)
Otfried Fries, Kurt Mehlhorn, Stefan Näher
Dynamization of geometric data structures. SCG (1985)
Michael Becker, W. Degenhardt, Jürgen Doenhardt, Stefan Hertel, Gerd Kaninke, W. Kerber, Kurt Mehlhorn, Stefan Näher, Hans Rohnert, Thomas Winter
A Probabilistic Algorithm for Vertex Connectivity of Graphs. Inf. Process. Lett. 15 (3) (1982)

Stefan Näher.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Stefan Näher