default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Näher
Person information
- affiliation: University of Trier, Department of Computer Science, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[i1]Kurt Mehlhorn, Stefan Näher, Peter Sanders:
Engineering DFS-Based Graph Algorithms. CoRR abs/1703.10023 (2017)- 2014
- [j16]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): 459-489 (2014) - 2013
- [c29]Michael A. Bekos, Michael Kaufmann, Robert Krug, Stefan Näher, Vincenzo Roselli:
Slanted Orthogonal Drawings. GD 2013: 424-435 - 2011
- [j15]Ross M. McConnell, Kurt Mehlhorn, Stefan Näher, Pascal Schweitzer:
Certifying algorithms. Comput. Sci. Rev. 5(2): 119-161 (2011) - [p2]Stefan Näher:
The Travelling Salesman Problem. Algorithms Unplugged 2011: 383-391
2000 – 2009
- 2009
- [c28]Stefan Näher, Daniel Schmitt:
Multi-core Implementations of Geometric Algorithms. Efficient Algorithms 2009: 261-274 - [e2]Susanne Albers, Helmut Alt, Stefan Näher:
Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 5760, Springer 2009, ISBN 978-3-642-03455-8 [contents] - 2008
- [c27]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 - [p1]Stefan Näher:
Das Travelling Salesman Problem. Taschenbuch der Algorithmen 2008: 413-422 - 2007
- [c26]Stefan Näher, Martin Taphorn:
Experimental Evaluation of Structural Filtering as a Tool for Exact and Efficient Geometric Computing. CCCG 2007: 41-44 - 2005
- [j14]Stefan Funke, Kurt Mehlhorn, Stefan Näher:
Structural filtering: a paradigm for efficient and exact geometric programs. Comput. Geom. 31(3): 179-194 (2005) - 2004
- [r2]Lutz Kettner, Stefan Näher:
Two computational geometry libraries: LEDA and CGAL. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 1435-1463 - [r1]Stefan Näher:
LEDA, a Platform for Combinatorial and Geometric Computing. Handbook of Data Structures and Applications 2004 - 2002
- [c25]Stefan Näher, Oliver Zlotowski:
Design and Implementation of Efficient Data Types for Static Graphs. ESA 2002: 748-759 - 2001
- [c24]Matthias Bäsken, Stefan Näher:
GeoWin - A Generic Tool for Interactive Visualization of Geometric Algorithms. Software Visualization 2001: 88-100 - [e1]Stefan Näher, Dorothea Wagner:
Algorithm Engineering, 4th International Workshop, WAE 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings. Lecture Notes in Computer Science 1982, Springer 2001, ISBN 3-540-42512-8 [contents] - 2000
- [c23]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher:
Visualization in Algorithm Engineering: Tools and Techniques. Experimental Algorithmics 2000: 24-50
1990 – 1999
- 1999
- [b2]Kurt Mehlhorn, Stefan Näher:
LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press 1999, ISBN 0-521-56329-1 - [j13]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): 85-103 (1999) - [c22]Stefan Funke, Kurt Mehlhorn, Stefan Näher:
Structural filtering: A paradigm for efficient and exact geometric programs. CCCG 1999 - 1998
- [j12]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): 289-303 (1998) - [c21]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. GD 1998: 456-457 - [c20]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: 81-88 - [c19]Kurt Mehlhorn, Stefan Näher:
From Algorithms to Working Programs: On the Use of Program Checking in LEDA. MFCS 1998: 84-93 - 1997
- [c18]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: 254-263 - [c17]Kurt Mehlhorn, Stefan Näher, Christian Uhrig:
The LEDA Platform of Combinatorial and Geometric Computing. ICALP 1997: 7-16 - [c16]David Alberts, Carsten Gutwenger, Petra Mutzel, Stefan Näher:
AGD-Library: A Library of Algorithms for Graph Drawing. WAE 1997: 112-123 - [c15]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: 124-135 - 1996
- [c14]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: 159-165 - [c13]Kurt Mehlhorn, Stefan Näher, Christian Uhrig:
The LEDA Platform for Combinatorial and Geometric Computing. GI Jahrestagung 1996: 43-50 - 1995
- [j11]Kurt Mehlhorn, Stefan Näher:
LEDA: A Platform for Combinatorial and Geometric Computing. Commun. ACM 38(1): 96-102 (1995) - [c12]Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig:
Exact Geometric Computation in LEDA. SCG 1995: C18-C19 - 1994
- [c11]Kurt Mehlhorn, Stefan Näher:
The Implementation of Geometric Algorithms. IFIP Congress (1) 1994: 223-231 - 1993
- [c10]Stefan Näher:
LEDA: A Library of Efficient Data Types and Algorithms. STACS 1993: 710-711 - 1992
- [j10]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): 391-406 (1992) - [c9]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: 25-43 - [c8]Kurt Mehlhorn, Stefan Näher:
Algorithm Design and Software Libraries: Recent Developments in the LEDA Project. IFIP Congress (1) 1992: 493-505 - 1990
- [j9]Kurt Mehlhorn, Stefan Näher:
Dynamic Fractional Cascading. Algorithmica 5(2): 215-241 (1990) - [j8]Kurt Mehlhorn, Stefan Näher, Christian Uhrig:
Hidden Line Elimination for Isooriented Rectangels. Inf. Process. Lett. 35(3): 137-143 (1990) - [j7]Kurt Mehlhorn, Stefan Näher:
Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space. Inf. Process. Lett. 35(4): 183-189 (1990) - [j6]Kurt Mehlhorn, Stefan Näher, Monika Rauch:
On the Complexity of a Game Related to the Dictionary Problem. SIAM J. Comput. 19(5): 902-906 (1990) - [j5]Kurt Mehlhorn, Stefan Näher:
A faster compaction algorithm with automatic jog insertion. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(2): 158-166 (1990) - [c7]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: 281-289 - [c6]Stefan Näher, Kurt Mehlhorn:
LEDA - A Library of Efficient Data Types and Algorithms. GI Jahrestagung (1) 1990: 35-39 - [c5]Stefan Näher, Kurt Mehlhorn:
LEDA: A Library of Efficient Data Types and Algorithms. ICALP 1990: 1-5
1980 – 1989
- 1989
- [c4]Kurt Mehlhorn, Stefan Näher, Monika Rauch:
On the Complexity of a Game Related to the Dictionary Problem. FOCS 1989: 546-548 - [c3]Kurt Mehlhorn, Stefan Näher:
LEDA: A Library of Efficient Data Types and Algorithms. MFCS 1989: 88-106 - 1988
- [j4]Kurt Mehlhorn, Stefan Näher, Helmut Alt:
A Lower Bound on the Complexity of the Union-Split-Find Problem. SIAM J. Comput. 17(6): 1093-1102 (1988) - 1987
- [b1]Stefan Näher:
Dynamic Fractional Cascading oder die Verwaltung vieler linearer Listen. Saarland University, Saarbrücken, Germany, 1987, pp. 1-95 - [j3]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): 269-273 (1987) - [c2]Kurt Mehlhorn, Stefan Näher, Helmut Alt:
A Lower Bound for the Complexity of the Union-Split-Find Problem. ICALP 1987: 479-488 - 1986
- [j2]Thomas Lengauer, Stefan Näher:
An analysis of ternary simulation as a tool for race detection in digital MOS circuits. Integr. 4(4): 309-330 (1986) - 1985
- [c1]Otfried Fries, Kurt Mehlhorn, Stefan Näher:
Dynamization of geometric data structures. SCG 1985: 168-176 - 1982
- [j1]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): 135-136 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
