The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kurt Mehlhorn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bernhard Eisenbarth, Nivio Ziviani, Gaston H. Gonnet, Kurt Mehlhorn, Derick Wood
    The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees [Citation Graph (6, 0)][DBLP]
    Information and Control, 1982, v:55, n:1-3, pp:125-174 [Journal]
  2. Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan
    Dynamic Perfect Hashing: Upper and Lower Bounds [Citation Graph (4, 0)][DBLP]
    FOCS, 1988, pp:524-531 [Conf]
  3. Stefan Hertel, Kurt Mehlhorn
    Fast Triangulation of Simple Polygons. [Citation Graph (2, 0)][DBLP]
    FCT, 1983, pp:207-218 [Conf]
  4. 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]
  5. Scott Huddleston, Kurt Mehlhorn
    A New Data Structure for Representing Sorted Lists. [Citation Graph (2, 0)][DBLP]
    Acta Inf., 1982, v:17, n:, pp:157-184 [Journal]
  6. Kurt Mehlhorn
    Nearly Optimal Binary Search Trees [Citation Graph (2, 0)][DBLP]
    Acta Inf., 1975, v:5, n:, pp:287-295 [Journal]
  7. Kurt Mehlhorn, Stefan Näher
    Dynamic Fractional Cascading. [Citation Graph (1, 0)][DBLP]
    Algorithmica, 1990, v:5, n:2, pp:215-241 [Journal]
  8. Kurt Mehlhorn
    Dynamic Binary Search. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:2, pp:175-198 [Journal]
  9. Alexander Koller, Kurt Mehlhorn, Joachim Niehren
    A Polynomial-Time Fragment of Dominance Constraints. [Citation Graph (0, 0)][DBLP]
    ACL, 2000, pp:- [Conf]
  10. Kurt Mehlhorn, Mark Ziegelmann
    CNOP - A Package for Constrained Network Optimization. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:17-31 [Conf]
  11. Kurt Mehlhorn
    Best possible bounds for the weighted path length of optimum binary search trees. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:31-41 [Conf]
  12. Martin Fürer, Kurt Mehlhorn
    AT2-Optimal Galois Field Multiplier for VLSI. [Citation Graph (0, 0)][DBLP]
    Aegean Workshop on Computing, 1986, pp:217-225 [Conf]
  13. Kurt Mehlhorn, Wolfgang Rülling
    Compaction on the Torus. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:212-225 [Conf]
  14. Kurt Mehlhorn
    The Reliable Algorithmic Software Challenge RASC. [Citation Graph (0, 0)][DBLP]
    Computer Science in Perspective, 2003, pp:255-263 [Conf]
  15. Kurt Mehlhorn
    On Optimal VLSI-Circuits for the Basic Arithmetic Functions. [Citation Graph (0, 0)][DBLP]
    CAAP, 1984, pp:23-30 [Conf]
  16. Arno Eigenwillig, Lutz Kettner, Werner Krandick, Kurt Mehlhorn, Susanne Schmitt, Nicola Wolpert
    A Descartes Algorithm for Polynomials with Bit-Stream Coefficients. [Citation Graph (0, 0)][DBLP]
    CASC, 2005, pp:138-149 [Conf]
  17. 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]
  18. Shaodi Gao, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling, Christoph Storb, Mark Jerrum
    On Continuous Homotopic One Layer Routing. [Citation Graph (0, 0)][DBLP]
    Workshop on Computational Geometry, 1988, pp:55-70 [Conf]
  19. Kurt Mehlhorn
    Reliable and Efficient Geometric Computing. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:1-2 [Conf]
  20. Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl
    Congruence, Similarity, and Symmetries of Geometric Objects. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:308-315 [Conf]
  21. 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]
  22. Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra
    Efficient Exact Geometric Computation Made Easy. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:341-350 [Conf]
  23. 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]
  24. Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos
    Randomized External-Memory Algorithms for Some Geometric Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:259-268 [Conf]
  25. Tamal K. Dey, Kurt Mehlhorn, Edgar A. Ramos
    Curve Reconstruction: Connecting Dots with Good Reason. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:197-206 [Conf]
  26. Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
    On Simultaneous Inner and Outer Approximation of Shapes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:216-224 [Conf]
  27. Stefan Funke, Kurt Mehlhorn
    Look - a Lazy Object-Oriented Kernel for geometric computation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:156-165 [Conf]
  28. Shaodi Gao, Mark Jerrum, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling
    On Continuous Homotopic One Layer Routing. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:392-402 [Conf]
  29. 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]
  30. 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]
  31. Kurt Mehlhorn, Thomas C. Shermer, Chee-Keng Yap
    A Complete Roundness Classification Procedure. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:129-138 [Conf]
  32. Kurt Mehlhorn, Sven Thiel
    Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint. [Citation Graph (0, 0)][DBLP]
    CP, 2000, pp:306-319 [Conf]
  33. Kurt Mehlhorn
    From Algorithm to Program to Software Library. [Citation Graph (0, 0)][DBLP]
    Informatics, 2001, pp:268-273 [Conf]
  34. Kurt Mehlhorn, Volker Claus, Wolfgang Thomas
    Komplexitätstheorie und Algorithmik. [Citation Graph (0, 0)][DBLP]
    Perspektiven der Informatik, 1993, pp:113-116 [Conf]
  35. 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]
  36. Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn
    SCIL - Symbolic Constraints in Integer Linear Programming. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:75-87 [Conf]
  37. Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Joachim Reichel, Susanne Schmitt, Elmar Schömer, Nicola Wolpert
    EXACUS: Efficient and Exact Algorithms for Curves and Surfaces. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:155-166 [Conf]
  38. Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Kurt Mehlhorn, Elmar Schömer
    A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:174-186 [Conf]
  39. Christoph Burnikel, Kurt Mehlhorn, Stefan Schirra
    How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:227-239 [Conf]
  40. Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt
    A Separation Bound for Real Algebraic Expressions. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:254-265 [Conf]
  41. Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Michael Seel
    Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:654-666 [Conf]
  42. Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap
    Classroom Examples of Robustness Problems in Geometric Computations. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:702-713 [Conf]
  43. Kurt Mehlhorn
    Reliable and Efficient Geometric Computing. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:2- [Conf]
  44. Kurt Mehlhorn, Ulrich Meyer
    External-Memory Breadth-First Search with Sublinear I/O. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:723-735 [Conf]
  45. Kurt Mehlhorn, Volker Priebe
    On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:185-198 [Conf]
  46. Kurt Mehlhorn, Guido Schäfer
    A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:242-253 [Conf]
  47. Kurt Mehlhorn, Mark Ziegelmann
    Resource Constrained Shortest Paths. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:326-337 [Conf]
  48. Kurt Mehlhorn, Bernd H. Schmidt
    A Single Shortest Path Algorithm for Graphs with Separators. [Citation Graph (0, 0)][DBLP]
    FCT, 1983, pp:302-309 [Conf]
  49. Kurt Mehlhorn, Klaus Simon
    Intersecting two polyhedra one of which is convex. [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:534-542 [Conf]
  50. Kurt Mehlhorn
    On the Size of Sets of Computable Functions [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:190-196 [Conf]
  51. Kurt Mehlhorn
    On the Program Size of Perfect and Universal Hash Functions [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:170-175 [Conf]
  52. 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]
  53. Devdatt P. Dubhashi, Kurt Mehlhorn, Desh Ranjan, Christian Thiel
    Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:436-443 [Conf]
  54. Kurt Mehlhorn
    Recent Developments in Algorithms for the Maximum-Flow Problem (Abstract). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:404- [Conf]
  55. Kurt Mehlhorn
    The Engineering of some Bipartite Matching Programs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:446-449 [Conf]
  56. Kurt Mehlhorn
    Minimum Cycle Bases and Surface Reconstruction. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:532-532 [Conf]
  57. Reiner Güttler, Kurt Mehlhorn, Wolfgang Schneider, Norbert Wernet
    Binary Search Trees: Average and Worst Case Behavior. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1976, pp:301-313 [Conf]
  58. Manfred Heydthausen, Kurt Mehlhorn
    Top Down Parsing of Macro Grammars. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1976, pp:95-108 [Conf]
  59. Kurt Mehlhorn
    Konzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1979, pp:16-22 [Conf]
  60. Kurt Mehlhorn
    Über Verdrahtungsalgorithmen. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung (Fachgespräche), 1984, pp:79-89 [Conf]
  61. 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]
  62. Kurt Mehlhorn, Gerhard Zimmermann
    SFB 124: VLSI-Entwurfsmethoden und Parallelität. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung (2), 1988, pp:3-29 [Conf]
  63. 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]
  64. Kurt Mehlhorn
    Exact geometric computation. [Citation Graph (0, 0)][DBLP]
    HERCMA, 2001, pp:87- [Conf]
  65. Helmut Alt, Kurt Mehlhorn
    Lower Bounds for the Space Complexity of Context-Free Recognition. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:338-354 [Conf]
  66. Doris Altenkamp, Kurt Mehlhorn
    Codes: Unequal Probabilities, Unequal Letter Costs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1978, pp:15-25 [Conf]
  67. Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn
    Can A Maximum Flow be Computed on o(nm) Time? [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:235-248 [Conf]
  68. Torben Hagerup, Kurt Mehlhorn, J. Ian Munro
    Maintaining Discrete Probability Distributions Optimally. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:253-264 [Conf]
  69. Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn
    A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:250-261 [Conf]
  70. Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg
    Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    ICALP, 1981, pp:41-55 [Conf]
  71. Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, Peter Sanders
    Towards Optimal Multiple Selection. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:103-114 [Conf]
  72. Michael Kaufmann, Kurt Mehlhorn
    Routing Through a Generalized Switchbox. [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:328-337 [Conf]
  73. Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
    A Faster Algorithm for Minimum Cycle Basis of Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:846-857 [Conf]
  74. 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]
  75. 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]
  76. Kurt Mehlhorn, Ralf Osbild, Michael Sagraloff
    Reliable and Efficient Computational Geometry Via Controlled Perturbation. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:299-310 [Conf]
  77. Kurt Mehlhorn, Franco P. Preparata
    Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time. [Citation Graph (0, 0)][DBLP]
    ICALP, 1984, pp:347-357 [Conf]
  78. Kurt Mehlhorn, Wolfgang J. Paul
    Two Versus One Index Register and Modifiable Versus Non-modifiable Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:603-609 [Conf]
  79. Kurt Mehlhorn, Athanasios K. Tsakalidis
    Dynamic Interpolation Search. [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:424-434 [Conf]
  80. Kurt Mehlhorn, Chee-Keng Yap
    Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:410-423 [Conf]
  81. Kurt Mehlhorn
    Constraint Programming and Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:571-575 [Conf]
  82. Kurt Mehlhorn
    The "Almost All" Theory of Subrecursive Degrees is Decidable. [Citation Graph (0, 0)][DBLP]
    ICALP, 1974, pp:317-325 [Conf]
  83. Kurt Mehlhorn
    Dynamic Binary Search. [Citation Graph (0, 0)][DBLP]
    ICALP, 1977, pp:323-336 [Conf]
  84. Kurt Mehlhorn
    Pebbling Moutain Ranges and its Application of DCFL-Recognition. [Citation Graph (0, 0)][DBLP]
    ICALP, 1980, pp:422-435 [Conf]
  85. 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]
  86. Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap
    Reply to "Backward Error Analysis ...". [Citation Graph (0, 0)][DBLP]
    ICCSA (1), 2006, pp:60-60 [Conf]
  87. 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]
  88. Kurt Mehlhorn, Stefan Näher
    The Implementation of Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1994, pp:223-231 [Conf]
  89. 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]
  90. David J. Abraham, Katarína Cechlárová, David Manlove, Kurt Mehlhorn
    Pareto Optimality in House Allocation Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:3-15 [Conf]
  91. David J. Abraham, Katarína Cechlárová, David Manlove, Kurt Mehlhorn
    Pareto Optimality in House Allocation Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:1163-1175 [Conf]
  92. Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama
    Polyline Fitting of Planar Points Under Min-sum Criteria. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:77-88 [Conf]
  93. Kurt Mehlhorn
    The Engineering of Some Bipartite Matching Programs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:1-3 [Conf]
  94. Cyril Banderier, René Beier, Kurt Mehlhorn
    Smoothed Analysis of Three Combinatorial Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:198-207 [Conf]
  95. Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata
    Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:199-208 [Conf]
  96. Helmut Alt, Kurt Mehlhorn, J. Ian Munro
    Partial Match Retrieval in Implicit Data Structures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1981, pp:156-161 [Conf]
  97. Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders
    A Parallelization of Dijkstra's Shortest Path Algorithm. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:722-731 [Conf]
  98. Kurt Mehlhorn
    Searching, Sorting and Information Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 1979, pp:131-145 [Conf]
  99. Kurt Mehlhorn
    Some Remarks on Boolean Sums. [Citation Graph (0, 0)][DBLP]
    MFCS, 1979, pp:375-380 [Conf]
  100. Kurt Mehlhorn, Zvi Galil
    Monotone Switching Circuits and Boolean Matrix Product. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:315-319 [Conf]
  101. 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]
  102. Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata
    Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. [Citation Graph (0, 0)][DBLP]
    Parallel Algorithms and Architectures, 1987, pp:11-15 [Conf]
  103. Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe
    Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:15-26 [Conf]
  104. Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kurt Mehlhorn, John D. Kececioglu
    A branch-and-cut algorithm for multiple sequence alignment. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1997, pp:241-250 [Conf]
  105. Rolf Klein, Kurt Mehlhorn, Stefan Meiser
    On the Construction of Abstract Voronoi Diagrams, II. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:138-154 [Conf]
  106. David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn
    Popular matchings. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:424-432 [Conf]
  107. Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel
    An efficient algorithm for the configuration problem of dominance graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:815-824 [Conf]
  108. Ernst Althaus, Friedrich Eisenbrand, Stefan Funke, Kurt Mehlhorn
    Point containment in the integer hull of a polyhedron. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:929-933 [Conf]
  109. Ernst Althaus, Kurt Mehlhorn
    TSP-based curve reconstruction in polynomial time. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:686-695 [Conf]
  110. Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie
    New constructions of (alpha, beta)-spanners and purely additive spanners. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:672-681 [Conf]
  111. Hanna Baumgarten, Hermann Jung, Kurt Mehlhorn
    Dynamic Point Location in General Subdivisions. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:250-258 [Conf]
  112. Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra
    A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:702-709 [Conf]
  113. Christoph Burnikel, Kurt Mehlhorn, Stefan Schirra
    On Degeneracy in Geometric Computations. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:16-23 [Conf]
  114. Marcel Dhiflaoui, Stefan Funke, Carsten Kwappik, Kurt Mehlhorn, Michael Seel, Elmar Schömer, Ralph Schulte, Dennis Weber
    Certifying and repairing solutions to large LPs how good are LP-solvers? [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:255-256 [Conf]
  115. Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig
    Lower Bounds for Set Intersection Queries. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:194-201 [Conf]
  116. Ulrich Finkler, Kurt Mehlhorn
    Runtime Prediction of Real Programs on Real Machines. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:380-389 [Conf]
  117. Ulrich Finkler, Kurt Mehlhorn
    Checking Priority Queues. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:901-902 [Conf]
  118. Stefan Funke, Christian Klein, Kurt Mehlhorn, Susanne Schmitt
    Controlled perturbation for Delaunay triangulations. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:1047-1056 [Conf]
  119. Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
    Rank-maximal matchings. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:68-75 [Conf]
  120. Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad
    Certifying algorithms for recognizing interval graphs and permutation graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:158-167 [Conf]
  121. Kurt Mehlhorn, R. Sundar, Christian Uhrig
    Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic Time. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:213-222 [Conf]
  122. Kurt Mehlhorn, Micha Sharir, Emo Welzl
    Tail Estimates for the Space Complexity of Randomized Incremental Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:89-93 [Conf]
  123. Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki
    Matching Algorithms Are Fast in Sparse Random Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:81-92 [Conf]
  124. Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel
    Four Results on Randomized Incremental Constructions. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:463-474 [Conf]
  125. Michael Kaufmann, Kurt Mehlhorn
    On Local Routing of Two-Terminal Nets. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:40-52 [Conf]
  126. Telikepalli Kavitha, Kurt Mehlhorn
    A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:654-665 [Conf]
  127. Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
    Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:222-233 [Conf]
  128. Ludek Kucera, Kurt Mehlhorn, B. Preis, E. Schwarzenecker
    Exact Algorithms for a Geometric Packing Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:317-322 [Conf]
  129. Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing
    On the Construction of Abstract Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    STACS, 1990, pp:227-239 [Conf]
  130. Kurt Mehlhorn, Franco P. Preparata
    Area-time Optimal Division for T=Omega(log n)1+epsilon [Citation Graph (0, 0)][DBLP]
    STACS, 1986, pp:341-352 [Conf]
  131. Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
    New Approximation Algorithms for Minimum Cycle Bases of Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:512-523 [Conf]
  132. Kurt Mehlhorn
    Polynomial and Abstract Subrecursive Classes [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:96-109 [Conf]
  133. Kurt Mehlhorn, Erik Meineche Schmidt
    Las Vegas Is better than Determinism in VLSI and Distributed Computing (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:330-337 [Conf]
  134. Martin Dietzfelbinger, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert
    Upper and Lower Bounds for the Dictionary Problem (Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:214-215 [Conf]
  135. Norbert Blum, Kurt Mehlhorn
    Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:67-78 [Conf]
  136. Scott Huddleston, Kurt Mehlhorn
    Robust Balancing in B-Trees. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:234-244 [Conf]
  137. Kurt Mehlhorn
    Sorting Presorted Files. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:199-212 [Conf]
  138. Kurt Mehlhorn
    Position Paper for Panel Discussion. [Citation Graph (0, 0)][DBLP]
    WACG, 1996, pp:51-52 [Conf]
  139. Katrin Dobrindt, Kurt Mehlhorn, Mariette Yvinec
    A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:314-324 [Conf]
  140. Kurt Mehlhorn
    Experiences with the Implementation of Geometric Algorithms (Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:518- [Conf]
  141. Kurt Mehlhorn
    Ten Years of LEDA Some Thoughts (Abstract). [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:14- [Conf]
  142. Andreas Crauser, Kurt Mehlhorn
    LEDA-SM Extending LEDA to Secondary Memory. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:229-243 [Conf]
  143. Kurt Mehlhorn, Guido Schäfer
    Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2000, pp:23-38 [Conf]
  144. Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn
    A Time-Randomness Tradeoff for Communication Complexity. [Citation Graph (0, 0)][DBLP]
    WDAG, 1990, pp:390-401 [Conf]
  145. Kurt Mehlhorn
    The Reliable Algorithmic Software Challenge RASC. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:222- [Conf]
  146. Kurt Mehlhorn, Dimitrios Michail
    Implementing Minimum Cycle Basis Algorithms. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:32-43 [Conf]
  147. Kurt Mehlhorn
    A New Data Structure for Representing Sorted Lists. [Citation Graph (0, 0)][DBLP]
    WG, 1980, pp:90-112 [Conf]
  148. Michael Becker, Kurt Mehlhorn
    Algorithms for Routing in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1986, v:23, n:2, pp:163-176 [Journal]
  149. Peter Deussen, Kurt Mehlhorn
    Van Wijngaarden Grammars and Space Complexity Classs EXSPACE [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1977, v:8, n:, pp:193-199 [Journal]
  150. Stefan Hertel, Martti Mäntylä, Kurt Mehlhorn, Jürg Nievergelt
    Space Sweep Solves Intersection of Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1984, v:21, n:, pp:501-519 [Journal]
  151. Kurt Mehlhorn
    Some Remarks on Boolean Sums. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1979, v:12, n:, pp:371-375 [Journal]
  152. Kurt Mehlhorn, Uzi Vishkin
    Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1984, v:21, n:, pp:339-374 [Journal]
  153. 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]
  154. Helmut Alt, Leonidas J. Guibas, Kurt Mehlhorn, Richard M. Karp, Avi Wigderson
    A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:4/5, pp:543-547 [Journal]
  155. Holger Bast, Kurt Mehlhorn, Guido Schäfer
    A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:36, n:1, pp:75-88 [Journal]
  156. Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra
    A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:1, pp:87-99 [Journal]
  157. Joseph Cheriyan, Kurt Mehlhorn
    Algorithms for Dense Graphs and Networks on the Random Access Computer. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:15, n:6, pp:521-549 [Journal]
  158. Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig
    Lower Bounds for Set Intersection Queries. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:14, n:2, pp:154-168 [Journal]
  159. Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
    Simultaneous Inner and Outer Approximation of Shapes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:5&6, pp:365-389 [Journal]
  160. Kurt Mehlhorn, Petra Mutzel
    On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:2, pp:233-242 [Journal]
  161. Kurt Mehlhorn, Franco P. Preparata, Majid Sarrafzadeh
    Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1986, v:1, n:2, pp:213-221 [Journal]
  162. Kurt Mehlhorn, Peter Sanders
    Scanning Multiple Sequences Via Cache Memory. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:35, n:1, pp:75-93 [Journal]
  163. Kurt Mehlhorn, R. Sundar, Christian Uhrig
    Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:2, pp:183-198 [Journal]
  164. 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]
  165. Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel
    Four Results on Randomized Incremental Constructions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:185-212 [Journal]
  166. Tamal K. Dey, Kurt Mehlhorn, Edgar A. Ramos
    Curve reconstruction: Connecting dots with good reason. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:15, n:4, pp:229-244 [Journal]
  167. Stefan Funke, Kurt Mehlhorn
    LOOK: A Lazy Object-Oriented Kernel design for geometric computation. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:22, n:1-3, pp:99-118 [Journal]
  168. 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]
  169. Rolf Klein, Kurt Mehlhorn, Stefan Meiser
    Randomized Incremental Construction of Abstract Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:157-184 [Journal]
  170. 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]
  171. 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]
  172. Kurt Mehlhorn, Jörg-Rüdiger Sack
    Editorial. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:17, n:1-2, pp:1-2 [Journal]
  173. Kurt Mehlhorn, Jörg-Rüdiger Sack, Jorge Urrutia
    Editorial. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:12, n:3-4, pp:153-154 [Journal]
  174. Kurt Mehlhorn, Micha Sharir, Emo Welzl
    Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:235-246 [Journal]
  175. John D. Kececioglu, Hans-Peter Lenhof, Kurt Mehlhorn, Petra Mutzel, Knut Reinert, Martin Vingron
    A polyhedral approach to sequence alignment problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:104, n:1-3, pp:143-186 [Journal]
  176. Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl
    Congruence, Similarity, and Symmetries of Geometric Objects. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:237-256 [Journal]
  177. Kurt Mehlhorn
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:14, n:4, pp:363-363 [Journal]
  178. Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing
    On the Construction of Abstract Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:211-224 [Journal]
  179. Reiner Güttler, Kurt Mehlhorn, Wolfgang Schneider
    Binary Search Trees: Average and Worst Case Behavior. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1980, v:16, n:1-3, pp:41-61 [Journal]
  180. Kurt Mehlhorn
    An Improved Lower Bound on the Formula Complexity of Context-free Recognition. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1976, v:12, n:11/12, pp:523-524 [Journal]
  181. Burchard von Braunmühl, Stephen Cook, Kurt Mehlhorn, Rutger Verbeek
    The Recognition of Deterministic CFL's in Small Time and Space [Citation Graph (0, 0)][DBLP]
    Information and Control, 1983, v:56, n:1/2, pp:34-51 [Journal]
  182. Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn
    A Communication-Randomness Tradeoff for Two-Processor Systems [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:116, n:2, pp:155-161 [Journal]
  183. Stefan Hertel, Kurt Mehlhorn
    Fast Triangulation of the Plane with Respect to Simple Polygons [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:64, n:1-3, pp:52-76 [Journal]
  184. Kurt Hoffman, Kurt Mehlhorn, Pierre Rosenstiehl, Robert Endre Tarjan
    Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees [Citation Graph (0, 0)][DBLP]
    Information and Control, 1986, v:68, n:1-3, pp:170-184 [Journal]
  185. Kurt Mehlhorn
    Parsing Macro Grammars Top Down [Citation Graph (0, 0)][DBLP]
    Information and Control, 1979, v:40, n:2, pp:123-143 [Journal]
  186. Kurt Mehlhorn, Franco P. Preparata
    Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time [Citation Graph (0, 0)][DBLP]
    Information and Control, 1983, v:58, n:1-3, pp:137-156 [Journal]
  187. Kurt Mehlhorn, Franco P. Preparata
    Area-Time Optimal Division for T=Omega((log n)^1+ epsilon) [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1987, v:72, n:3, pp:270-282 [Journal]
  188. Kurt Mehlhorn, Wolfgang J. Paul, Christian Uhrig
    k versus k+1 Index Registers and Modifiable versus Non-modifiable Programs [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:101, n:1, pp:123-129 [Journal]
  189. Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama
    Polyline Fitting of Planar Points under Min-sum Criteria. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2006, v:16, n:2-3, pp:97-116 [Journal]
  190. Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos
    Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:3, pp:305-337 [Journal]
  191. Kurt Mehlhorn, Stefan Meiser, Ronald Rasch
    Furthest Site Abstract Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:6, pp:583-616 [Journal]
  192. Kurt Mehlhorn, Michael Seel
    Infimaximal Frames: A Technique for Making Lines Look Like Segments. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:3, pp:241-255 [Journal]
  193. Kurt Mehlhorn
    Effiziente Algorithmen: Ein Beispiel. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1978, v:1, n:2, pp:81-89 [Journal]
  194. Kurt Mehlhorn
    Über Verdrahtungsalgorithmen. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1986, v:9, n:4, pp:227-234 [Journal]
  195. Helmut Alt, Norbert Blum, Kurt Mehlhorn, Markus Paul
    Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n). [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:4, pp:237-240 [Journal]
  196. Helmut Alt, Viliam Geffert, Kurt Mehlhorn
    A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:1, pp:25-27 [Journal]
  197. Helmut Alt, Kurt Mehlhorn, J. Ian Munro
    Partial Match Retrieval in Implicit Data Structures. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:2, pp:61-65 [Journal]
  198. Ernst Althaus, Kurt Mehlhorn
    Maximum Network Flow with Floating Point Arithmetic. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:66, n:3, pp:109-113 [Journal]
  199. Srinivasa Rao Arikati, Kurt Mehlhorn
    A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:70, n:5, pp:251-254 [Journal]
  200. 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]
  201. Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn
    A Lower Bound for Area-Universal Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:2, pp:101-105 [Journal]
  202. Joseph Cheriyan, Kurt Mehlhorn
    An Analysis of the Highest-Level Selection Rule in the Preflow-Push Max-Flow. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:5, pp:239-242 [Journal]
  203. Yu-Tai Ching, Kurt Mehlhorn, Michiel H. M. Smid
    Dynamic Deferred Data Structuring. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:35, n:1, pp:37-40 [Journal]
  204. 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]
  205. Hermann Jung, Kurt Mehlhorn
    Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:5, pp:227-236 [Journal]
  206. Stephen Kwek, Kurt Mehlhorn
    Optimal search for rationals. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:1, pp:23-26 [Journal]
  207. Heikki Mannila, Kurt Mehlhorn
    A Fast Algorithm for Renaming a Set of Clauses as a Horn Set. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:21, n:5, pp:269-272 [Journal]
  208. Kurt Mehlhorn
    Bracket-Languages are Recognizable in Logarithmic Space. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1976, v:5, n:6, pp:168-170 [Journal]
  209. Kurt Mehlhorn
    A Faster Approximation Algorithm for the Steiner Problem in Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:3, pp:125-128 [Journal]
  210. 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]
  211. 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]
  212. Kurt Mehlhorn, Mark H. Overmars
    Optimal Dynamization of Decomposable Searching Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:2, pp:93-98 [Journal]
  213. Kurt Mehlhorn, Volker Priebe, Guido Schäfer, Naveen Sivadasan
    All-pairs shortest-paths computation in the presence of negative cycles. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:6, pp:341-343 [Journal]
  214. Helmut Alt, Kurt Mehlhorn
    Complexity arguments in algebraic language theory. [Citation Graph (0, 0)][DBLP]
    ITA, 1979, v:13, n:3, pp:- [Journal]
  215. Kurt Mehlhorn
    Arbitrary Weight Changes in Dynamic Trees. [Citation Graph (0, 0)][DBLP]
    ITA, 1981, v:15, n:3, pp:183-211 [Journal]
  216. Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert Endre Tarjan
    Faster Algorithms for the Shortest Path Problem [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:2, pp:213-223 [Journal]
  217. Doris Altenkamp, Kurt Mehlhorn
    Codes: Unequal Probabilities, Unequal Letter Cost. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:3, pp:412-427 [Journal]
  218. Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg
    Cost Trade-offs in Graph Embeddings, with Applications [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:4, pp:709-728 [Journal]
  219. Kurt Mehlhorn, Franco P. Preparata
    Routing through a rectangle. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1986, v:33, n:1, pp:60-85 [Journal]
  220. Kurt Mehlhorn, Athanasios K. Tsakalidis
    Dynamic Interpolation Search. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:3, pp:621-634 [Journal]
  221. Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel
    An efficient graph algorithm for dominance constraints. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:1, pp:194-219 [Journal]
  222. Hanna Baumgarten, Hermann Jung, Kurt Mehlhorn
    Dynamic Point Location in General Subdivisions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:3, pp:342-380 [Journal]
  223. Michael Kaufmann, Kurt Mehlhorn
    Routing Through a Generalized Switchbox. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:4, pp:510-531 [Journal]
  224. Kurt Mehlhorn
    Polynomial and Abstract Subrecursive Classes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1976, v:12, n:2, pp:147-178 [Journal]
  225. Michael Kaufmann, Kurt Mehlhorn
    On local routing of two-terminal nets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:55, n:1, pp:33-72 [Journal]
  226. Kurt Mehlhorn, Dimitrios Michail
    Implementing minimum cycle basis algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2006, v:11, n:, pp:- [Journal]
  227. Kurt Mehlhorn, Guido Schäfer
    Implementation of O(n m log n) Weighted Matchings in General Graphs: The Power of Data Structures. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2002, v:7, n:, pp:4- [Journal]
  228. Werner Krandick, Kurt Mehlhorn
    New bounds for the Descartes method. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2006, v:41, n:1, pp:49-66 [Journal]
  229. Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki
    Matching Algorithms Are Fast in Sparse Random Graphs. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:1, pp:3-14 [Journal]
  230. Kurt Mehlhorn
    Lower Bounds on the Efficiency of Transforming Static Data sSructures into Dynamic Structures. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1981, v:15, n:1, pp:1-16 [Journal]
  231. Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe
    Average-case complexity of shortest-paths problems in the vertex-potential model. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:1, pp:33-46 [Journal]
  232. Kurt Mehlhorn, Volker Priebe
    On the all-pairs shortest-path algorithm of Moffat and Takaoka. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:1-2, pp:205-220 [Journal]
  233. Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata
    Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:5, pp:808-835 [Journal]
  234. Helmut Alt, Kurt Mehlhorn
    Searching Semisorted Tables. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:840-848 [Journal]
  235. Ernst Althaus, Kurt Mehlhorn
    Traveling Salesman-Based Curve Reconstruction in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:27-66 [Journal]
  236. Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn
    An o(n³)-Time Algorithm Maximum-Flow Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:6, pp:1144-1170 [Journal]
  237. Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan
    Dynamic Perfect Hashing: Upper and Lower Bounds. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:738-761 [Journal]
  238. Michael Kaufmann, Kurt Mehlhorn
    A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:2, pp:227-246 [Journal]
  239. Kurt Mehlhorn
    A Best Possible Bound for the Weighted Path Length of Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:2, pp:235-239 [Journal]
  240. Kurt Mehlhorn
    A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:4, pp:748-760 [Journal]
  241. 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]
  242. 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]
  243. Kurt Mehlhorn, Athanasios K. Tsakalidis
    An Amortized Analysis of Insertions into AVL-Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:1, pp:22-33 [Journal]
  244. Kurt Mehlhorn, Chee-Keng Yap
    Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:4, pp:603-621 [Journal]
  245. Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad
    Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:326-353 [Journal]
  246. Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
    Rank-maximal matchings. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:4, pp:602-610 [Journal]
  247. Martin Fürer, Kurt Mehlhorn
    AT²-Optimal Galois Field Multiplier for VLSI. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1989, v:38, n:9, pp:1333-1336 [Journal]
  248. 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]
  249. Kurt Mehlhorn, Wolfgang Rülling
    Compaction on the torus [VLSI layout]. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1990, v:9, n:4, pp:389-397 [Journal]
  250. Norbert Blum, Kurt Mehlhorn
    On the Average Number of Rebalancing Operations in Weight-Balanced Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:303-320 [Journal]
  251. Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein
    Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:645-656 [Conf]
  252. Kurt Mehlhorn
    Minimum Cycle Bases in Graphs Algorithms and Applications. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:13-14 [Conf]
  253. Kurt Mehlhorn
    Matchings in Graphs Variations of the Problem. [Citation Graph (0, 0)][DBLP]
    COCOA, 2007, pp:1-2 [Conf]
  254. Peter Hachenberger, Lutz Kettner, Kurt Mehlhorn
    Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:38, n:1-2, pp:64-99 [Journal]
  255. Telikepalli Kavitha, Kurt Mehlhorn
    Algorithms to Compute Minimum Cycle Basis in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:4, pp:485-505 [Journal]
  256. David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn
    Popular Matchings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:4, pp:1030-1045 [Journal]
  257. Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
    Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]

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


  259. Sorting Jordan sequences in linear time. [Citation Graph (, )][DBLP]


  260. A Descartes Algorithms for Polynomials with Bit-Stream Coefficients. [Citation Graph (, )][DBLP]


  261. 04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. [Citation Graph (, )][DBLP]


  262. Breaking the O(m2n) Barrier for Minimum Cycle Bases. [Citation Graph (, )][DBLP]


  263. Assigning Papers to Referees. [Citation Graph (, )][DBLP]


  264. Reliable and Efficient Geometric Computing. [Citation Graph (, )][DBLP]


  265. Isolating real roots of real polynomials. [Citation Graph (, )][DBLP]


  266. Progress on Certifying Algorithms. [Citation Graph (, )][DBLP]


  267. Reliable Geometric Computing. [Citation Graph (, )][DBLP]


  268. An [(O)\tilde](m2n)\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs. [Citation Graph (, )][DBLP]


  269. A Separation Bound for Real Algebraic Expressions. [Citation Graph (, )][DBLP]


  270. Cycle bases of graphs and sampled manifolds. [Citation Graph (, )][DBLP]


  271. Classroom examples of robustness problems in geometric computations. [Citation Graph (, )][DBLP]


  272. Note on the paper "K-vertex guarding simple polygons" [Computational Geometry 42 (4) (May 2009) 352-361]. [Citation Graph (, )][DBLP]


  273. Editorial. [Citation Graph (, )][DBLP]


  274. Monotone switching circuits and boolean matrix product. [Citation Graph (, )][DBLP]


Search in 1.376secs, Finished in 1.384secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002