Stefan Näher

54 papers A* 4A 4B 2Journal 17Unranked 19
YearRankTypeTitle / Venue / Authors
2017 J jnl
Engineering DFS-Based Graph Algorithms.
CoRR
Kurt Mehlhorn, Stefan Näher, Peter Sanders
2014 J jnl
Slanted Orthogonal Drawings: Model, Algorithms and Evaluations.
J. Graph Algorithms Appl.
Michael A. Bekos, Michael Kaufmann, Robert Krug, Thorsten Ludwig, Stefan Näher, Vincenzo Roselli
2013 A conf
Slanted Orthogonal Drawings.
GD
Michael A. Bekos, Michael Kaufmann, Robert Krug, Stefan Näher, Vincenzo Roselli
2011 J jnl
Certifying algorithms.
Comput. Sci. Rev.
Ross M. McConnell, Kurt Mehlhorn, Stefan Näher, Pascal Schweitzer
2011 — ch.
The Travelling Salesman Problem.
Algorithms Unplugged
Stefan Näher
2009 — ed.
Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday
Efficient Algorithms
Susanne Albers, Helmut Alt, Stefan Näher
2009 — conf
Multi-core Implementations of Geometric Algorithms.
Efficient Algorithms
Stefan Näher, Daniel Schmitt
2008 — conf
A Framework for Multi-Core Implementations of Divide and Conquer Algorithms and its Application to the Convex Hull Problem.
CCCG
Stefan Näher, Daniel Schmitt
2008 — ch.
Das Travelling Salesman Problem.
Taschenbuch der Algorithmen
Stefan Näher
2007 — conf
Experimental Evaluation of Structural Filtering as a Tool for Exact and Efficient Geometric Computing.
CCCG
Stefan Näher, Martin Taphorn
2005 J jnl
Structural filtering: a paradigm for efficient and exact geometric programs.
Comput. Geom.
Stefan Funke, Kurt Mehlhorn, Stefan Näher
2004 — ch.
LEDA, a Platform for Combinatorial and Geometric Computing.
Handbook of Data Structures and Applications
Stefan Näher
2004 — ch.
Two computational geometry libraries: LEDA and CGAL.
Handbook of Discrete and Computational Geometry, 2nd Ed.
Lutz Kettner, Stefan Näher
2002 A conf
Design and Implementation of Efficient Data Types for Static Graphs.
ESA
Stefan Näher, Oliver Zlotowski
2001 — ed.
Algorithm Engineering, 4th International Workshop, WAE 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings
Stefan Näher, Dorothea Wagner
2001 — conf
GeoWin - A Generic Tool for Interactive Visualization of Geometric Algorithms.
Software Visualization
Matthias Bäsken, Stefan Näher
2000 — conf
Visualization in Algorithm Engineering: Tools and Techniques.
Experimental Algorithmics
Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher
1999 J jnl
Checking geometric programs or verification of geometric structures.
Comput. Geom.
Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, Christian Uhrig
1999 — book
LEDA: A Platform for Combinatorial and Geometric Computing.
Kurt Mehlhorn, Stefan Näher
1999 — conf
Structural filtering: A paradigm for efficient and exact geometric programs.
CCCG
Stefan Funke, Kurt Mehlhorn, Stefan Näher
1998 A conf
A Library of Algorithms for Graph Drawing.
GD
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
1998 J jnl
A computational basis for higher-dimensional computational geometry and applications.
Comput. Geom.
Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler
1998 — conf
From Algorithms to Working Programs on the Use of Program Checking in LEDA.
IFIP Congress: Fundamentals - Foundations of Computer Science
Kurt Mehlhorn, Stefan Näher
1998 B conf
From Algorithms to Working Programs: On the Use of Program Checking in LEDA.
MFCS
Kurt Mehlhorn, Stefan Näher
1997 — conf
A Computational Basis for Higher-Dimensional Computational Geometry and Applications.
SCG
Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler
1997 — conf
A Robust and Efficient Implementation of a Sweep Line Algorithm for the Straight Line Segment Intersection Problem.
WAE
Ulrike Bartuschka, Kurt Mehlhorn, Stefan Näher
1997 — conf
AGD-Library: A Library of Algorithms for Graph Drawing.
WAE
David Alberts, Carsten Gutwenger, Petra Mutzel, Stefan Näher
1997 A* conf
The LEDA Platform of Combinatorial and Geometric Computing.
ICALP
Kurt Mehlhorn, Stefan Näher, Christian Uhrig
1996 — conf
Checking Geometric Programs or Verification of Geometric Structures.
SCG
Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, Christian Uhrig
1996 — conf
The LEDA Platform for Combinatorial and Geometric Computing.
GI Jahrestagung
Kurt Mehlhorn, Stefan Näher, Christian Uhrig
1995 — conf
Exact Geometric Computation in LEDA.
SCG
Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
1995 J jnl
LEDA: A Platform for Combinatorial and Geometric Computing.
Commun. ACM
Kurt Mehlhorn, Stefan Näher
1994 — conf
The Implementation of Geometric Algorithms.
IFIP Congress (1)
Kurt Mehlhorn, Stefan Näher
1993 A conf
LEDA: A Library of Efficient Data Types and Algorithms.
STACS
Stefan Näher
1992 — conf
Algorithm Design and Software Libraries: Recent Developments in the LEDA Project.
IFIP Congress (1)
Kurt Mehlhorn, Stefan Näher
1992 J jnl
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.
Algorithmica
Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
1992 — conf
Selected Topics from Computational Geometry, Data Structures and Motion Planning.
Data Structures and Efficient Algorithms
Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios K. Tsakalidis, Christian Uhrig
1990 J jnl
A faster compaction algorithm with automatic jog insertion.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Kurt Mehlhorn, Stefan Näher
1990 — conf
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.
SCG
Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
1990 J jnl
Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space.
Inf. Process. Lett.
Kurt Mehlhorn, Stefan Näher
1990 J jnl
Dynamic Fractional Cascading.
Algorithmica
Kurt Mehlhorn, Stefan Näher
1990 J jnl
Hidden Line Elimination for Isooriented Rectangels.
Inf. Process. Lett.
Kurt Mehlhorn, Stefan Näher, Christian Uhrig
1990 — conf
LEDA - A Library of Efficient Data Types and Algorithms.
GI Jahrestagung (1)
Stefan Näher, Kurt Mehlhorn
1990 A* conf
LEDA: A Library of Efficient Data Types and Algorithms.
ICALP
Stefan Näher, Kurt Mehlhorn
1990 J jnl
On the Complexity of a Game Related to the Dictionary Problem.
SIAM J. Comput.
Kurt Mehlhorn, Stefan Näher, Monika Rauch
1989 B conf
LEDA: A Library of Efficient Data Types and Algorithms.
MFCS
Kurt Mehlhorn, Stefan Näher
1989 A* conf
On the Complexity of a Game Related to the Dictionary Problem
FOCS
Kurt Mehlhorn, Stefan Näher, Monika Rauch
1988 J jnl
A Lower Bound on the Complexity of the Union-Split-Find Problem.
SIAM J. Comput.
Kurt Mehlhorn, Stefan Näher, Helmut Alt
1987 A* conf
A Lower Bound for the Complexity of the Union-Split-Find Problem.
ICALP
Kurt Mehlhorn, Stefan Näher, Helmut Alt
1987 J jnl
A log log n Data Structure for Three-Sided Range Queries.
Inf. Process. Lett.
Otfried Fries, Kurt Mehlhorn, Stefan Näher, Athanasios K. Tsakalidis
1987 — —
Dynamic Fractional Cascading oder die Verwaltung vieler linearer Listen.
Stefan Näher
1986 J jnl
An analysis of ternary simulation as a tool for race detection in digital MOS circuits.
Integr.
Thomas Lengauer, Stefan Näher
1985 — conf
Dynamization of geometric data structures.
SCG
Otfried Fries, Kurt Mehlhorn, Stefan Näher
1982 J jnl
A Probabilistic Algorithm for Vertex Connectivity of Graphs.
Inf. Process. Lett.
Michael Becker, W. Degenhardt, Jürgen Doenhardt, Stefan Hertel, Gerd Kaninke, W. Kerber, Kurt Mehlhorn, Stefan Näher, Hans Rohnert, Thomas Winter