The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Stefan Näher: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kurt Mehlhorn, Stefan Näher
    LEDA: A Library of Efficient Data Types and Algorithms. [Citation Graph (2, 0)][DBLP]
    MFCS, 1989, pp:88-106 [Conf]
  2. Kurt Mehlhorn, Stefan Näher
    Dynamic Fractional Cascading. [Citation Graph (1, 0)][DBLP]
    Algorithmica, 1990, v:5, n:2, pp:215-241 [Journal]
  3. Stefan Funke, Kurt Mehlhorn, Stefan Näher
    Structural filtering: A paradigm for efficient and exact geometric programs. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:281-289 [Conf]
  5. Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
    Exact Geometric Computation in LEDA. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:0-0 [Conf]
  6. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:254-263 [Conf]
  7. Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, Christian Uhrig
    Checking Geometric Programs or Verification of Geometric Structures. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:159-165 [Conf]
  8. Matthias Bäsken, Stefan Näher
    GeoWin - A Generic Tool for Interactive Visualization of Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    Software Visualization, 2001, pp:88-100 [Conf]
  9. Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher
    Visualization in Algorithm Engineering: Tools and Techniques. [Citation Graph (0, 0)][DBLP]
    Experimental Algorithmics, 2000, pp:24-50 [Conf]
  10. 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. [Citation Graph (0, 0)][DBLP]
    Data Structures and Efficient Algorithms, 1992, pp:25-43 [Conf]
  11. Stefan Näher, Oliver Zlotowski
    Design and Implementation of Efficient Data Types for Static Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:748-759 [Conf]
  12. Kurt Mehlhorn, Stefan Näher, Monika Rauch
    On the Complexity of a Game Related to the Dictionary Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:546-548 [Conf]
  13. 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. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:456-457 [Conf]
  14. Kurt Mehlhorn, Stefan Näher, Christian Uhrig
    The LEDA Platform for Combinatorial and Geometric Computing. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1996, pp:43-50 [Conf]
  15. Stefan Näher, Kurt Mehlhorn
    LEDA - A Library of Efficient Data Types and Algorithms. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung (1), 1990, pp:35-39 [Conf]
  16. Kurt Mehlhorn, Stefan Näher, Christian Uhrig
    The LEDA Platform of Combinatorial and Geometric Computing. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:7-16 [Conf]
  17. Kurt Mehlhorn, Stefan Näher, Helmut Alt
    A Lower Bound for the Complexity of the Union-Split-Find Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:479-488 [Conf]
  18. Stefan Näher, Kurt Mehlhorn
    LEDA: A Library of Efficient Data Types and Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:1-5 [Conf]
  19. Kurt Mehlhorn, Stefan Näher
    Algorithm Design and Software Libraries: Recent Developments in the LEDA Project. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1992, pp:493-505 [Conf]
  20. Kurt Mehlhorn, Stefan Näher
    The Implementation of Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1994, pp:223-231 [Conf]
  21. Kurt Mehlhorn, Stefan Näher
    From Algorithms to Working Programs on the Use of Program Checking in LEDA. [Citation Graph (0, 0)][DBLP]
    IFIP Congress: Fundamentals - Foundations of Computer Science, 1998, pp:81-88 [Conf]
  22. Kurt Mehlhorn, Stefan Näher
    From Algorithms to Working Programs: On the Use of Program Checking in LEDA. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:84-93 [Conf]
  23. Stefan Näher
    LEDA: A Library of Efficient Data Types and Algorithms. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:710-711 [Conf]
  24. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:5&6, pp:391-406 [Journal]
  25. Kurt Mehlhorn, Stefan Näher
    LEDA: A Platform for Combinatorial and Geometric Computing. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1995, v:38, n:1, pp:96-102 [Journal]
  26. Stefan Funke, Kurt Mehlhorn, Stefan Näher
    Structural filtering: a paradigm for efficient and exact geometric programs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:31, n:3, pp:179-194 [Journal]
  27. 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. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:4, pp:289-303 [Journal]
  28. Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, Christian Uhrig
    Checking geometric programs or verification of geometric structures. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:12, n:1-2, pp:85-103 [Journal]
  29. 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. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:15, n:3, pp:135-136 [Journal]
  30. Otfried Fries, Kurt Mehlhorn, Stefan Näher, Athanasios K. Tsakalidis
    A log log n Data Structure for Three-Sided Range Queries. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:4, pp:269-273 [Journal]
  31. Kurt Mehlhorn, Stefan Näher
    Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:35, n:4, pp:183-189 [Journal]
  32. Kurt Mehlhorn, Stefan Näher, Christian Uhrig
    Hidden Line Elimination for Isooriented Rectangels. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:35, n:3, pp:137-143 [Journal]
  33. Kurt Mehlhorn, Stefan Näher, Helmut Alt
    A Lower Bound on the Complexity of the Union-Split-Find Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:6, pp:1093-1102 [Journal]
  34. Kurt Mehlhorn, Stefan Näher, Monika Rauch
    On the Complexity of a Game Related to the Dictionary Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:5, pp:902-906 [Journal]
  35. Kurt Mehlhorn, Stefan Näher
    A faster compaction algorithm with automatic jog insertion. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1990, v:9, n:2, pp:158-166 [Journal]
  36. Stefan Näher, Martin Taphorn
    Experimental Evaluation of Structural Filtering as a Tool for Exact and Efficient Geometric Computing. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:41-44 [Conf]

  37. Multi-core Implementations of Geometric Algorithms. [Citation Graph (, )][DBLP]


  38. A Framework for Multi-Core Implementations of Divide and Conquer Algorithms and its Application to the Convex Hull Problem. [Citation Graph (, )][DBLP]


  39. Dynamization of geometric data structures. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002