Stefan Näher

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2017

Engineering DFS-Based Graph Algorithms.

Kurt Mehlhorn, Stefan Näher, Peter Sanders

CoRR, 2017

2014

Slanted Orthogonal Drawings: Model, Algorithms and Evaluations.

Michael A. Bekos, Michael Kaufmann, Robert Krug, Thorsten Ludwig, Stefan Näher, Vincenzo Roselli

J. Graph Algorithms Appl., 2014

2013

Slanted Orthogonal Drawings.

Michael A. Bekos, Michael Kaufmann, Robert Krug, Stefan Näher, Vincenzo Roselli

Proceedings of the Graph Drawing - 21st International Symposium, 2013

2011

Certifying algorithms.

Ross M. McConnell, Kurt Mehlhorn, Stefan Näher, Pascal Schweitzer

Comput. Sci. Rev., 2011

The Travelling Salesman Problem.

Stefan Näher

Proceedings of the Algorithms Unplugged, 2011

2009

Multi-core Implementations of Geometric Algorithms.

Stefan Näher, Daniel Schmitt

Proceedings of the Efficient Algorithms, 2009

2008

Das Travelling Salesman Problem.

Stefan Näher

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.

Stefan Näher, Daniel Schmitt

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.

Stefan Näher, Martin Taphorn

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2004

LEDA, a Platform for Combinatorial and Geometric Computing.

Stefan Näher

Proceedings of the Handbook of Data Structures and Applications., 2004

Two computational geometry libraries: LEDA and CGAL.

Lutz Kettner, Stefan Näher

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

2002

Design and Implementation of Efficient Data Types for Static Graphs.

Stefan Näher, Oliver Zlotowski

Proceedings of the Algorithms, 2002

2001

GeoWin - A Generic Tool for Interactive Visualization of Geometric Algorithms.

Matthias Bäsken, Stefan Näher

Proceedings of the Software Visualization, 2001

2000

Visualization in Algorithm Engineering: Tools and Techniques.

Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher

Proceedings of the Experimental Algorithmics, 2000

1999

Structural filtering: A paradigm for efficient and exact geometric programs.

Stefan Funke, Kurt Mehlhorn, Stefan Näher

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

LEDA: A Platform for Combinatorial and Geometric Computing.

Kurt Mehlhorn, Stefan Näher

Cambridge University Press, ISBN: 0-521-56329-1, 1999

1998

From Algorithms to Working Programs on the Use of Program Checking in LEDA.

Kurt Mehlhorn, Stefan Näher

Proceedings of the Fundamentals - Foundations of Computer Science, 1998

A Library of Algorithms for Graph Drawing.

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

Proceedings of the Graph Drawing, 6th International Symposium, 1998

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

Proceedings of the Workshop on Algorithm Engineering, 1997

AGD-Library: A Library of Algorithms for Graph Drawing.

David Alberts, Carsten Gutwenger, Petra Mutzel, Stefan Näher

Proceedings of the Workshop on Algorithm Engineering, 1997

A Computational Basis for Higher-Dimensional Computational Geometry and Applications.

Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

The LEDA Platform for Combinatorial and Geometric Computing.

Kurt Mehlhorn, Stefan Näher, Christian Uhrig

Proceedings of the Beherrschung von Informationssystemen, 1996

Checking Geometric Programs or Verification of Geometric Structures.

Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, Christian Uhrig

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

LEDA: A Platform for Combinatorial and Geometric Computing.

Kurt Mehlhorn, Stefan Näher

Commun. ACM, 1995

Exact Geometric Computation in LEDA.

Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

The Implementation of Geometric Algorithms.

Kurt Mehlhorn, Stefan Näher

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.

Stefan Näher

Proceedings of the STACS 93, 1993

1992

Algorithm Design and Software Libraries: Recent Developments in the LEDA Project.

Kurt Mehlhorn, Stefan Näher

Proceedings of the Algorithms, Software, Architecture, 1992

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

Proceedings of the Data Structures and Efficient Algorithms, 1992

1990

A faster compaction algorithm with automatic jog insertion.

Kurt Mehlhorn, Stefan Näher

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990

Hidden Line Elimination for Isooriented Rectangels.

Kurt Mehlhorn, Stefan Näher, Christian Uhrig

Inf. Process. Lett., 1990

Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space.

Kurt Mehlhorn, Stefan Näher

Inf. Process. Lett., 1990

Dynamic Fractional Cascading.

Kurt Mehlhorn, Stefan Näher

Algorithmica, 1990

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

Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989

LEDA: A Library of Efficient Data Types and Algorithms.

Kurt Mehlhorn, Stefan Näher

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

On the Complexity of a Game Related to the Dictionary Problem

Kurt Mehlhorn, Stefan Näher, Monika Rauch

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1987

Dynamic Fractional Cascading oder die Verwaltung vieler linearer Listen.

Stefan Näher

PhD thesis, 1987

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

A Lower Bound for the Complexity of the Union-Split-Find Problem.

Kurt Mehlhorn, Stefan Näher, Helmut Alt

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

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

Thomas Lengauer, Stefan Näher

Integr., 1986

1985

Dynamization of geometric data structures.

Otfried Fries, Kurt Mehlhorn, Stefan Näher

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1982

A Probabilistic Algorithm for Vertex Connectivity of Graphs.

Michael Becker, W. Degenhardt, Jürgen Doenhardt, Stefan Hertel, Gerd Kaninke, W. Kerber, Kurt Mehlhorn, Stefan Näher, Hans Rohnert, Thomas Winter

Inf. Process. Lett., 1982