We stand with Ukraine

We stand with Ukraine

Stefan Näher

Affiliations:

University of Trier, Department of Computer Science, Germany

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.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

on uni-trier.de
on dl.acm.org

On csauthors.net:

Bibliography

2017

Engineering DFS-Based Graph Algorithms.

[BibT_eX]

[DOI]

,

,

CoRR, 2017

2014

Slanted Orthogonal Drawings: Model, Algorithms and Evaluations.

[BibT_eX]

[DOI]

Michael A. Bekos

,

Michael Kaufmann

,

,

Thorsten Ludwig

,

,

Vincenzo Roselli

J. Graph Algorithms Appl., 2014

2013

Slanted Orthogonal Drawings.

[BibT_eX]

[DOI]

Michael A. Bekos

,

Michael Kaufmann

,

,

,

Vincenzo Roselli

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

2011

Certifying algorithms.

[BibT_eX]

[DOI]

Ross M. McConnell

,

,

,

Pascal Schweitzer

Comput. Sci. Rev., 2011

The Travelling Salesman Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms Unplugged, 2011

2009

Multi-core Implementations of Geometric Algorithms.

[BibT_eX]

[DOI]

,

Proceedings of the Efficient Algorithms, 2009

2008

Das Travelling Salesman Problem.

[BibT_eX]

[DOI]

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.

[BibT_eX]

,

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.

[BibT_eX]

[DOI]

,

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

2005

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

[BibT_eX]

[DOI]

,

,

Comput. Geom., 2005

2004

LEDA, a Platform for Combinatorial and Geometric Computing.

[BibT_eX]

[DOI]

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

Two computational geometry libraries: LEDA and CGAL.

[BibT_eX]

[DOI]

,

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

2002

Design and Implementation of Efficient Data Types for Static Graphs.

[BibT_eX]

[DOI]

,

Oliver Zlotowski

Proceedings of the Algorithms, 2002

2001

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

[BibT_eX]

[DOI]

Matthias Bäsken

,

Proceedings of the Software Visualization, 2001

2000

Visualization in Algorithm Engineering: Tools and Techniques.

[BibT_eX]

[DOI]

Camil Demetrescu

,

,

Giuseppe F. Italiano

,

Proceedings of the Experimental Algorithmics, 2000

1999

Checking geometric programs or verification of geometric structures.

[BibT_eX]

[DOI]

,

,

,

,

,

,

Christian Uhrig

Comput. Geom., 1999

LEDA: A Platform for Combinatorial and Geometric Computing.

[BibT_eX]

[DOI]

,

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

1998

A computational basis for higher-dimensional computational geometry and applications.

[BibT_eX]

[DOI]

,

Michael Müller

,

,

,

,

Christian Uhrig

,

Joachim Ziegler

Comput. Geom., 1998

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

[BibT_eX]

,

Proceedings of the Fundamentals - Foundations of Computer Science, 1998

A Library of Algorithms for Graph Drawing.

[BibT_eX]

[DOI]

,

Carsten Gutwenger

,

Ralf Brockenauer

,

,

,

Michael Krüger

,

,

,

,

,

,

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.

[BibT_eX]

Ulrike Bartuschka

,

,

Proceedings of the Workshop on Algorithm Engineering, 1997

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

[BibT_eX]

,

Carsten Gutwenger

,

,

Proceedings of the Workshop on Algorithm Engineering, 1997

The LEDA Platform of Combinatorial and Geometric Computing.

[BibT_eX]

[DOI]

,

,

Christian Uhrig

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1995

LEDA: A Platform for Combinatorial and Geometric Computing.

[BibT_eX]

[DOI]

,

Commun. ACM, 1995

Exact Geometric Computation in LEDA.

[BibT_eX]

[DOI]

Christoph Burnikel

,

Jochen Könemann

,

,

,

,

Christian Uhrig

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

The Implementation of Geometric Algorithms.

[BibT_eX]

,

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.

[BibT_eX]

[DOI]

Proceedings of the STACS 93, 1993

1992

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

[BibT_eX]

[DOI]

,

Rudolf Fleischer

,

Michael Kaufmann

,

,

,

,

Christian Uhrig

Algorithmica, 1992

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

[BibT_eX]

,

Proceedings of the Algorithms, Software, Architecture, 1992

Selected Topics from Computational Geometry, Data Structures and Motion Planning.

[BibT_eX]

[DOI]

Rudolf Fleischer

,

,

,

,

,

,

,

,

Athanasios K. Tsakalidis

,

Christian Uhrig

Proceedings of the Data Structures and Efficient Algorithms, 1992

1990

A faster compaction algorithm with automatic jog insertion.

[BibT_eX]

[DOI]

,

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

On the Complexity of a Game Related to the Dictionary Problem.

[BibT_eX]

[DOI]

,

,

SIAM J. Comput., 1990

Hidden Line Elimination for Isooriented Rectangels.

[BibT_eX]

[DOI]

,

,

Christian Uhrig

Inf. Process. Lett., 1990

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

[BibT_eX]

[DOI]

,

Inf. Process. Lett., 1990

Dynamic Fractional Cascading.

[BibT_eX]

[DOI]

,

Algorithmica, 1990

LEDA: A Library of Efficient Data Types and Algorithms.

[BibT_eX]

[DOI]

,

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1988

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

[BibT_eX]

[DOI]

,

,

SIAM J. Comput., 1988

1987

Dynamic Fractional Cascading oder die Verwaltung vieler linearer Listen.

[BibT_eX]

[DOI]

PhD thesis, 1987

A log log n Data Structure for Three-Sided Range Queries.

[BibT_eX]

[DOI]

,

,

,

Athanasios K. Tsakalidis

Inf. Process. Lett., 1987

1986

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

[BibT_eX]

[DOI]

Thomas Lengauer

,

Integr., 1986

1985

Dynamization of geometric data structures.

[BibT_eX]

[DOI]

,

,

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1982

A Probabilistic Algorithm for Vertex Connectivity of Graphs.

[BibT_eX]

[DOI]

,

,

Jürgen Doenhardt

,

,

,

,

,

,

,

Inf. Process. Lett., 1982

Loading...