Database Entry Point
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF D1 Publications, generated: 3:54, 24 April 2014

Search the publication database

  . Return

Your search returned the following 45 documents:

  1. Kurt Mehlhorn, Stefan Näher, and Pascal Schweitzer
    Certifying algorithms
    Computer Science Review 5 (2): 119-161, 2011
  2. Ross M. McConnella, Kurt Mehlhorn, Stefan Näher, and Pascal Schweitzer
    Certifying algorithms
    Computer Science Review Article in Press: 1-43, 2010
  3. Stefan Funke, Kurt Mehlhorn, and Stefan Näher
    Structural filtering: a paradigm for efficient and exact geometric programs
    Computational Geometry 31 (3): 179-194, 2005

  4. Lutz Kettner and Stefan Näher
    Two Computational Geometry Libraries: LEDA and CGAL
    In: Handbook of Discrete and Computational Geometry, 2004, 1435-1463
  5. Ernst Althaus, Kurt Mehlhorn, Stefan Näher, and Stefan Schirra
    Experiments on curve reconstruction
    In: Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), San Francisco, USA, Jan, 6-11, 2000, 103-114

  6. Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, and Christian Uhrig
    Checking geometric programs or verification of geometric structures
    Computational Geometry: Theory and Applications 12 (1-2): 85-104, 1999

  7. Kurt Mehlhorn and Stefan Näher
    LEDA: a platform for combinatorial and geometric computing
    , Cambridge University Press, Cambridge, 1999, 1018 p.
  8. Stefan Funke, Kurt Mehlhorn, and Stefan Näher
    Structural Filtering: a Paradigm for Efficient and Exact Geometric Programs
    In: Abstracts for the 11th Canadian Conference on Computational Geometry (CCCG-99), Vancouver, Canada, August, 15-18, 1999, 39-42

  9. Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, and Joachim Ziegler
    A computational basis for higher-dimensional computational geometry and applications
    Computational Geometry: Theory and Applications 10 (4): 289-304, 1998
  10. 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, and Sebastian Leipert
    AGD: A Library of Algorithms for Graph Drawing
    In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), Montréal, Canada, August 13 - 15, 1998, 456-457
  11. Kurt Mehlhorn and Stefan Näher
    From Algorithms to Working Programs on the Use of Program Checking in LEDA
    In: Fundamentals - foundations of computer science : XV. IFIP world computer congress, Vienna, Austria and Budapest, Hungary, August 20-22, 1998, 81-88
  12. Kurt Mehlhorn and Stefan Näher
    From Algorithms to Working Programs: On the Use of Program Checking in LEDA
    In: Mathematical foundations of computer science (MFCS-98) : 23rd international symposium, Brno, Czech Republic, August, 24 - August, 28 1998, 1998, 84-93
    [PDF: Download: Mehlhorn_a_1998_f.pdf]
  13. Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, and Joachim Ziegler
    A Computational Basis for Higher-dimensional Computational Geometry and Applications
    In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), Nice, France, June, 4 - June, 6, 1997, 254-263
  14. David Alberts, Carsten Gutwenger, Petra Mutzel, and Stefan Näher
    AGD-Library: A Library of Algorithms for Graph Drawing
    In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), Venice, Italy, September, 1997, 1997, 112-123
  15. Kurt Mehlhorn, Stefan Näher, and Christian Uhrig
    The LEDA platform for combinatorial and geometric computing
    In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), Bologna, Italy, July 7-11, 1997, 7-16
  16. Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, and Christian Uhrig
    Checking Geometric Programs or Verification of Geometric Structures
    In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), Philadelphia, PA, USA, May, 24-26, 1996, 159-165
  17. Kurt Mehlhorn, Stefan Näher, and Christian Uhrig
    The LEDA Platform for Combinatorial and Geometric Computing
    In: Beherrschung von Informationssystemen : Tagungsband der Informatik '96 ; GI - 26. Jahrestagung, Klagenfurt; Österreich, 1996, 43-50
  18. Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, and Christian Uhrig
    Exact Geometric Computation in LEDA
    In: 11th ACM Symposium on Computational Geometry (SCG95), Vancouver, British Columbia, Canada, June, 5th - 7th, 1995, C18-C19

  19. Kurt Mehlhorn and Stefan Näher
    LEDA : A Platform for Combinatorial and Geometric Computing
    Universität Halle, Halle, 95-10, Reports on Computer Science
  20. Kurt Mehlhorn and Stefan Näher
    LEDA: A Platform for Combinatorial and Geometric Computing
    Communications of the ACM 38 (1): 96-102, 1995

  21. Kurt Mehlhorn, Stefan Näher, and Jurg Nievergelt
    Introduction
    Journal of Symbolic Computation 17 (4): 295-295, 1994
    [PDF: Download: Mehlhorn_a_1994_g.pdf]
  22. Kurt Mehlhorn and Stefan Näher
    The Implementation of Geometric Algorithms
    In: Technology and foundations : Information Processing '94 ; proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 1994, 223-231
    [PDF: Download: Mehlhorn112.pdf]
  23. Kurt Mehlhorn and Stefan Näher
    Algorithm Design and Software Libraries: Recent Developments in the LEDA Project
    In: Proceedings of the IFIP 12th World Computer Congress. Volume 1: Algorithms, Software, Architecture, Madrid, Spain,, 1992, 493-508
    [PDF: Download: Mehlhorn102.pdf]
  24. Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, and Christian Uhrig
    Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
    Algorithmica 8 (5/6): 391-408, 1992. Note: Conference version in Proceedings of 6th ACM Symposium on Computational Geometry, 1990
  25. Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios Tsakalidis, and Christian Uhrig
    Selected Topics from Computational Geometry, Data Structures and Motion Planning
    In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 1992, 25-43
  26. Kurt Mehlhorn and Stefan Näher
    A faster compaction algorithm with automatic jog insertion
    IEEE Transactions on CAD of Integrated Circuits and Systems 9 (2): 158-166, 1990
  27. Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, and Christian Uhrig
    Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
    In: Computational geometry (SCG-90) : 6th annual symposium, Berkeley, USA, 1990, 281-289
  28. Kurt Mehlhorn and Stefan Näher
    Bounded ordered dictionaries in $O(\log \log n)$ time and $O(n)$ space
    Information Processing Letters 35 (4): 183-189, 1990
  29. Kurt Mehlhorn and Stefan Näher
    Dynamic Fractional Cascading
    Algorithmica 5: 215-241, 1990
    [PDF: Download: DynamicFractionalCascading.pdf]
  30. Kurt Mehlhorn, Stefan Näher, and Christian Uhrig
    Hidden line elimination for isooriented rectangles
    Universität des Saarlandes, Saarbrücken, A 90/02
    [PDF: Download: Mehlhorn_SFB_A_02_90-1.pdf]
  31. Kurt Mehlhorn, Stefan Näher, and Christian Uhrig
    Hidden line elimination for isooriented rectangles
    Information Processing Letters 35 (3): 137-143, 1990
    [PDF: Download: HiddenLineRectangles.pdf]
  32. Stefan Näher and Kurt Mehlhorn
    LEDA - A Library of Efficient Data Types and Algorithms
    In: GI - 20. Jahrestagung I, Informatik auf dem Weg zum Anwender, Stuttgart, Germany, 1990, 35-39
  33. Stefan Näher and Kurt Mehlhorn
    LEDA: A Library of Efficient Data Types and Algorithms
    In: Automata, languages and programming (ICALP-90) : 17th international colloquium, Warwick University, England, 1990, 1-5
  34. Kurt Mehlhorn, Stefan Näher, and Monika Rauch
    On the Complexity of a Game Related to the Dictionary Problem
    SIAM Journal on Computing 19 (5): 902-906, 1990
  35. Kurt Mehlhorn and Stefan Näher
    LEDA: A library of efficient data types and algorithms
    In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, Porabka-Kozubnik, Poland, 1989, 88-106
  36. Kurt Mehlhorn, Stefan Näher, and Monika Rauch
    On the Complexity of a Game Related to the Dictionary Problem
    In: 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), Research Triangle Park, NC, USA, 1989, 546-548
  37. Kurt Mehlhorn, Stefan Näher, and Helmut Alt
    A Lower Bound on the Complexity of the Union-Split-Find Problem
    SIAM Journal on Computing 17 (6): 1093-1102, 1988
  38. Kurt Mehlhorn and Stefan Näher
    A faster compaction algorithm with automatic jog insertion
    Sonderforschungsbereich 124 / Universität des Saarlandes, Saarbrücken/Kaiserslautern, 87/15
  39. Kurt Mehlhorn, Stefan Näher, and Helmut Alt
    A Lower Bound for the Complexity of the Union-Split-Find Problem
    In: Automata, Languages and Programming (ICALP-87) : 14th International Colloquium, Karlsruhe, Federal Republic of Germany, 1987, 479-488
  40. O. Fries, Kurt Mehlhorn, Stefan Näher, and A. Tsakalidis
    A $\log \log n$ data structure for three-sided range queries
    Information Processing Letters 25 (4): 269-273, 1987
  41. Kurt Mehlhorn, Stefan Näher, and Helmut Alt
    A Lower Bound for the Complexity of the Union-Split-Find Problem
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 86/07
  42. Kurt Mehlhorn and Stefan Näher
    Dynamic fractional cascading
    Universität des Saarlandes, Saarbrücken, A 86/06
  43. Michael Becker, W. Degenhardt, J. Doenhardt, S. Hertel, G. Kaninke, W. Kerber, Kurt Mehlhorn, Stefan Näher, H. Rohnert, and T. Winter
    A Probabilistic Algorithm for Vertex Connectivity of Graphs
    Information Processing Letters 15 (3): 135-136, 1982
    [PDF: Download: mehlhorn34.pdf]
  44. O. Fries, Kurt Mehlhorn, and Stefan Näher
    Dynamization of geometric data structures
    In: Computational geometry (SCG-85) : 1st symposium, Baltimore, MD, USA, 1985, 168-176
  45. O. Fries, Kurt Mehlhorn, and Stefan Näher
    Dynamization of geometric data structures
    SFB Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken, 85/02