Kurt Mehlhorn

Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt: Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge. Journal of Graph Theory 72(1): 112-121 (2013)

Tomasz Jurkiewicz, Kurt Mehlhorn: The cost of address translation. ALENEX 2013: 148-162

Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani: On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets. COCOON 2013: 65-76

Kurt Mehlhorn: Physarum Computations (Invited talk). STACS 2013: 5-6

Kurt Mehlhorn, Michael Sagraloff, Pengming Wang: From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition. CoRR abs/1301.4870 (2013)

Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani: On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets. CoRR abs/1301.5290 (2013)

Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah: A Framework for the Verification of Certifying Computations. CoRR abs/1301.7462 (2013)

Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt: An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs. Algorithmica 62(3-4): 754-766 (2012)

Kurt Mehlhorn, Jörg-Rüdiger Sack: CGTA-Awards 2011. Comput. Geom. 45(4): 139 (2012)

Nicole Megow, Kurt Mehlhorn, Pascal Schweitzer: Online graph exploration: New results on old and new algorithms. Theor. Comput. Sci. 463: 62-72 (2012)

Daniel M. Kane, Kurt Mehlhorn, Thomas Sauerwald, He Sun: Counting Arbitrary Subgraphs in Data Streams. ICALP (2) 2012: 598-609

Vincenzo Bonifaci, Kurt Mehlhorn, Girish Varma: Physarum can compute shortest paths. SODA 2012: 233-240

Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer (Eds.): Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I. Lecture Notes in Computer Science 7391, Springer 2012, isbn 978-3-642-31593-0

Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer (Eds.): Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II. Lecture Notes in Computer Science 7392, Springer 2012, isbn 978-3-642-31584-8

Karl Bringmann, Kurt Mehlhorn, Adrian Neumann: Remarks on Category-Based Routing in Social Networks. CoRR abs/1202.2293 (2012)

George Christodoulou, Kurt Mehlhorn, Evangelia Pyrga: Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. CoRR abs/1202.2877 (2012)

Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt: Certifying 3-Edge-Connectivity. CoRR abs/1211.6553 (2012)

Tomasz Jurkiewicz, Kurt Mehlhorn: The Cost of Address Translation. CoRR abs/1212.0703 (2012)

Ran Duan, Kurt Mehlhorn: A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market. CoRR abs/1212.0979 (2012)

Kurt Mehlhorn, Moshe Y. Vardi, Marc Herbstritt: Publication Culture in Computing Research (Dagstuhl Perspectives Workshop 12452). Dagstuhl Reports 2(11): 20-44 (2012)

Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Winzen, Kasper Green Larsen, Kurt Mehlhorn: The Deterministic and Randomized Query Complexity of a Simple Guessing Game. Electronic Colloquium on Computational Complexity (ECCC) 19: 87 (2012)

Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail: New Approximation Algorithms for Minimum Cycle Bases of Graphs. Algorithmica 59(4): 471-488 (2011)

Dan Halperin, Kurt Mehlhorn: Guest Editorial: Selected Papers from European Symposium on Algorithms. Algorithmica 60(1): 1-2 (2011)

Kurt Mehlhorn, Ralf Osbild, Michael Sagraloff: A general approach to the analysis of controlled perturbation algorithms. Comput. Geom. 44(9): 507-528 (2011)

Ross M. McConnell, Kurt Mehlhorn, Stefan Näher, Pascal Schweitzer: Certifying algorithms. Computer Science Review 5(2): 119-161 (2011)

Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah, Pascal Schweitzer: An Introduction to Certifying Algorithms. it - Information Technology 53(6): 287-293 (2011)

Nino Shervashidze, Pascal Schweitzer, Erik Jan van Leeuwen, Kurt Mehlhorn, Karsten M. Borgwardt: Weisfeiler-Lehman Graph Kernels. Journal of Machine Learning Research 12: 2539-2561 (2011)

Kurt Mehlhorn, Michael Sagraloff: A deterministic algorithm for isolating real roots of a real polynomial. J. Symb. Comput. 46(1): 70-90 (2011)

Arno Eigenwillig, Kurt Mehlhorn: Multiplication of Long Integers - Faster than Long Multiplication. Algorithms Unplugged 2011: 101-109

Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah: Verification of Certifying Computations. CAV 2011: 67-82

George Christodoulou, Kurt Mehlhorn, Evangelia Pyrga: Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. ESA 2011: 119-130

Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, He Sun: Approximate Counting of Cycles in Streams. ESA 2011: 677-688

Nicole Megow, Kurt Mehlhorn, Pascal Schweitzer: Online Graph Exploration: New Results on Old and New Algorithms. ICALP (2) 2011: 478-489

Kurt Mehlhorn: The Physarum Computer. WALCOM 2011: 8

Vincenzo Bonifaci, Kurt Mehlhorn, Girish Varma: Physarum Can Compute Shortest Paths. CoRR abs/1106.0423 (2011)

Pankaj K. Agarwal, Kurt Mehlhorn, Monique Teillaud: Computational Geometry (Dagstuhl Seminar 11111). Dagstuhl Reports 1(3): 19-41 (2011)

Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, Julián Mestre: Assigning Papers to Referees. Algorithmica 58(1): 119-136 (2010)

Kurt Mehlhorn, Jörg-Rüdiger Sack: Editorial. Comput. Geom. 43(6-7): 555 (2010)

Kurt Mehlhorn, Saurabh Ray: Faster algorithms for computing Hong's bound on absolute positiveness. J. Symb. Comput. 45(6): 677-683 (2010)

Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein: Arrangements on Parametric Surfaces I: General Framework and Infrastructure. Mathematics in Computer Science 4(1): 45-66 (2010)

Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie: Additive spanners and (alpha, beta)-spanners. ACM Transactions on Algorithms 7(1): 5 (2010)

Kurt Mehlhorn, Pascal Schweitzer: Progress on Certifying Algorithms. FAW 2010: 1-5

Kurt Mehlhorn: Reliable and Efficient Geometric Computing. ICMS 2010: 10-11

Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt: A Separation Bound for Real Algebraic Expressions. Algorithmica 55(1): 14-28 (2009)

Kurt Mehlhorn, Jörg-Rüdiger Sack, Joseph Zaks: Note on the paper "K-vertex guarding simple polygons" [Computational Geometry 42 (4) (May 2009) 352-361]. Comput. Geom. 42(6-7): 722 (2009)

Telikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, Romeo Rizzi, Torsten Ueckerdt, Katharina Anna Zweig: Cycle bases in graphs characterization, algorithms, complexity, and applications. Computer Science Review 3(4): 199-243 (2009)

Nino Shervashidze, S. V. N. Vishwanathan, Tobias Petri, Kurt Mehlhorn, Karsten M. Borgwardt: Efficient graphlet kernels for large graph comparison. Journal of Machine Learning Research - Proceedings Track 5: 488-495 (2009)

Kurt Mehlhorn, Dimitrios Michail: Minimum cycle bases: Faster and simpler. ACM Transactions on Algorithms 6(1) (2009)

Edoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, Romeo Rizzi: Breaking the O(m²n) Barrier for Minimum Cycle Bases. ESA 2009: 301-312

Kurt Mehlhorn: Assigning Papers to Referees. ICALP (1) 2009: 1-2

Kurt Mehlhorn, Michael Sagraloff: Isolating real roots of real polynomials. ISSAC 2009: 247-254

Kurt Mehlhorn, Peter Sanders: Algorithms and Data Structures: The Basic Toolbox. Springer 2008, isbn 978-3-540-77977-3

Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: An [(O)\tilde](m²n)\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs. Algorithmica 52(3): 333-349 (2008)

Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap: Classroom examples of robustness problems in geometric computations. Comput. Geom. 40(1): 61-78 (2008)

Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn: Faster Algorithms for Minimum Cycle Basis in Directed Graphs. SIAM J. Comput. 38(4): 1430-1447 (2008)

Arno Eigenwillig, Kurt Mehlhorn: Multiplikation langer Zahlen (schneller als in der Schule). Taschenbuch der Algorithmen 2008: 109-118

Dan Halperin, Kurt Mehlhorn (Eds.): Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings. Lecture Notes in Computer Science 5193, Springer 2008, isbn 978-3-540-87743-1

Craig Gotsman, Kanela Kaligosi, Kurt Mehlhorn, Dimitrios Michail, Evangelia Pyrga: Cycle bases of graphs and sampled manifolds. Computer Aided Geometric Design 24(8-9): 464-480 (2007)

Peter Hachenberger, Lutz Kettner, Kurt Mehlhorn: Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments. Comput. Geom. 38(1-2): 64-99 (2007)

Telikepalli Kavitha, Kurt Mehlhorn: Algorithms to Compute Minimum Cycle Basis in Directed Graphs. Theory Comput. Syst. 40(4): 485-505 (2007)

David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn: Popular Matchings. SIAM J. Comput. 37(4): 1030-1045 (2007)

Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem. ACM Transactions on Algorithms 3(2) (2007)

Kurt Mehlhorn: Matchings in Graphs Variations of the Problem. COCOA 2007: 1-2

Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein: Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step. ESA 2007: 645-656

Kurt Mehlhorn: Minimum Cycle Bases in Graphs Algorithms and Applications. MFCS 2007: 13-14

Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail: New Approximation Algorithms for Minimum Cycle Bases of Graphs. STACS 2007: 512-523

Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama: Polyline Fitting of Planar Points under Min-sum Criteria. Int. J. Comput. Geometry Appl. 16(2-3): 97-116 (2006)

Kurt Mehlhorn, Dimitrios Michail: Implementing minimum cycle basis algorithms. ACM Journal of Experimental Algorithmics 11 (2006)

Werner Krandick, Kurt Mehlhorn: New bounds for the Descartes method. J. Symb. Comput. 41(1): 49-66 (2006)

Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki: Matching Algorithms Are Fast in Sparse Random Graphs. Theory Comput. Syst. 39(1): 3-14 (2006)

Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad: Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. SIAM J. Comput. 36(2): 326-353 (2006)

Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: Rank-maximal matchings. ACM Transactions on Algorithms 2(4): 602-610 (2006)

Kurt Mehlhorn: Reliable and Efficient Geometric Computing. CIAC 2006: 1-2

Kurt Mehlhorn, Arno Eigenwillig, Lutz Kettner, Werner Krandick, Susanne Schmitt, Nicola Wolpert: A Descartes Algorithms for Polynomials with Bit-Stream Coefficients. Reliable Implementation of Real Number Algorithms 2006

Kurt Mehlhorn: Reliable and Efficient Geometric Computing. ESA 2006: 2

Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn: A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. ICALP (1) 2006: 250-261

Kurt Mehlhorn, Ralf Osbild, Michael Sagraloff: Reliable and Efficient Computational Geometry Via Controlled Perturbation. ICALP (1) 2006: 299-310

Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap: Reply to "Backward Error Analysis ...". ICCSA (1) 2006: 60-60

Kurt Mehlhorn: Reliable Geometric Computing. OR 2006: 111

Stefan Funke, Kurt Mehlhorn, Stefan Näher: Structural filtering: a paradigm for efficient and exact geometric programs. Comput. Geom. 31(3): 179-194 (2005)

Arno Eigenwillig, Lutz Kettner, Werner Krandick, Kurt Mehlhorn, Susanne Schmitt, Nicola Wolpert: A Descartes Algorithm for Polynomials with Bit-Stream Coefficients. CASC 2005: 138-149

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. ESA 2005: 155-166

Kurt Mehlhorn: Minimum Cycle Bases and Surface Reconstruction. Graph Drawing 2005: 532-532

Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, Peter Sanders: Towards Optimal Multiple Selection. ICALP 2005: 103-114

David J. Abraham, Katarína Cechlárová, David Manlove, Kurt Mehlhorn: Pareto Optimality in House Allocation Problems. ISAAC 2005: 1163-1175

David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn: Popular matchings. SODA 2005: 424-432

Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie: New constructions of (alpha, beta)-spanners and purely additive spanners. SODA 2005: 672-681

Stefan Funke, Christian Klein, Kurt Mehlhorn, Susanne Schmitt: Controlled perturbation for Delaunay triangulations. SODA 2005: 1047-1056

Telikepalli Kavitha, Kurt Mehlhorn: A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs. STACS 2005: 654-665

Kurt Mehlhorn, Dimitrios Michail: Implementing Minimum Cycle Basis Algorithms. WEA 2005: 32-43

Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn (Eds.): Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004. Dagstuhl Seminar Proceedings 04301, IBFI, Schloss Dagstuhl, Germany 2005

Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn: 04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. Cache-Oblivious and Cache-Aware Algorithms 2004

Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap: Classroom Examples of Robustness Problems in Geometric Computations. ESA 2004: 702-713

Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: A Faster Algorithm for Minimum Cycle Basis of Graphs. ICALP 2004: 846-857

David J. Abraham, Katarína Cechlárová, David Manlove, Kurt Mehlhorn: Pareto Optimality in House Allocation Problems. ISAAC 2004: 3-15

Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama: Polyline Fitting of Planar Points Under Min-sum Criteria. ISAAC 2004: 77-88

Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: Rank-maximal matchings. SODA 2004: 68-75

Ernst Althaus, Friedrich Eisenbrand, Stefan Funke, Kurt Mehlhorn: Point containment in the integer hull of a polyhedron. SODA 2004: 929-933

Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki: Matching Algorithms Are Fast in Sparse Random Graphs. STACS 2004: 81-92

Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem. STACS 2004: 222-233

Kurt Mehlhorn, Peter Sanders: Scanning Multiple Sequences Via Cache Memory. Algorithmica 35(1): 75-93 (2003)

Holger Bast, Kurt Mehlhorn, Guido Schäfer: A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. Algorithmica 36(1): 75-88 (2003)

Kurt Mehlhorn, Michael Seel: Infimaximal Frames: A Technique for Making Lines Look Like Segments. Int. J. Comput. Geometry Appl. 13(3): 241-255 (2003)

Stephen Kwek, Kurt Mehlhorn: Optimal search for rationals. Inf. Process. Lett. 86(1): 23-26 (2003)

Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel: An efficient graph algorithm for dominance constraints. J. Algorithms 48(1): 194-219 (2003)

Kurt Mehlhorn: The Reliable Algorithmic Software Challenge RASC. Computer Science in Perspective 2003: 255-263

Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Michael Seel: Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation. ESA 2003: 654-666

Cyril Banderier, René Beier, Kurt Mehlhorn: Smoothed Analysis of Three Combinatorial Problems. MFCS 2003: 198-207

Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad: Certifying algorithms for recognizing interval graphs and permutation graphs. SODA 2003: 158-167

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? SODA 2003: 255-256

Kurt Mehlhorn: The Reliable Algorithmic Software Challenge RASC. WEA 2003: 222

Stefan Funke, Kurt Mehlhorn: LOOK: A Lazy Object-Oriented Kernel design for geometric computation. Comput. Geom. 22(1-3): 99-118 (2002)

Kurt Mehlhorn, Volker Priebe, Guido Schäfer, Naveen Sivadasan: All-pairs shortest-paths computation in the presence of negative cycles. Inf. Process. Lett. 81(6): 341-343 (2002)

Kurt Mehlhorn, Guido Schäfer: Implementation of O(n m log n) Weighted Matchings in General Graphs: The Power of Data Structures. ACM Journal of Experimental Algorithmics 7: 4 (2002)

Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn: SCIL - Symbolic Constraints in Integer Linear Programming. ESA 2002: 75-87

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. ESA 2002: 174-186

Kurt Mehlhorn, Ulrich Meyer: External-Memory Breadth-First Search with Sublinear I/O. ESA 2002: 723-735

Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos: Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems. Int. J. Comput. Geometry Appl. 11(3): 305-337 (2001)

Kurt Mehlhorn, Stefan Meiser, Ronald Rasch: Furthest Site Abstract Voronoi Diagrams. Int. J. Comput. Geometry Appl. 11(6): 583-616 (2001)

Ernst Althaus, Kurt Mehlhorn: Traveling Salesman-Based Curve Reconstruction in Polynomial Time. SIAM J. Comput. 31(1): 27-66 (2001)

Kurt Mehlhorn, Stefan Schirra: Exact Computation with leda_real - Theory and geometric Applications. Symbolic Algebraic Methods and Verification Methods 2001: 163-172

Kurt Mehlhorn, Mark Ziegelmann: CNOP - A Package for Constrained Network Optimization. ALENEX 2001: 17-31

Kurt Mehlhorn: From Algorithm to Program to Software Library. Informatics 2001: 268-273

Kurt Mehlhorn, Guido Schäfer: A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. ESA 2001: 242-253

Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt: A Separation Bound for Real Algebraic Expressions. ESA 2001: 254-265

Kurt Mehlhorn: Exact geometric computation. HERCMA 2001: 87

Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel: An efficient algorithm for the configuration problem of dominance graphs. SODA 2001: 815-824

Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra: A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals. Algorithmica 27(1): 87-99 (2000)

Tamal K. Dey, Kurt Mehlhorn, Edgar A. Ramos: Curve reconstruction: Connecting dots with good reason. Comput. Geom. 15(4): 229-244 (2000)

Kurt Mehlhorn, Jörg-Rüdiger Sack: Editorial. Comput. Geom. 17(1-2): 1-2 (2000)

John D. Kececioglu, Hans-Peter Lenhof, Kurt Mehlhorn, Petra Mutzel, Knut Reinert, Martin Vingron: A polyhedral approach to sequence alignment problems. Discrete Applied Mathematics 104(1-3): 143-186 (2000)

Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe: Average-case complexity of shortest-paths problems in the vertex-potential model. Random Struct. Algorithms 16(1): 33-46 (2000)

Alexander Koller, Kurt Mehlhorn, Joachim Niehren: A Polynomial-Time Fragment of Dominance Constraints. ACL 2000

Stefan Funke, Kurt Mehlhorn: Look - a Lazy Object-Oriented Kernel for geometric computation. Symposium on Computational Geometry 2000: 156-165

Kurt Mehlhorn, Sven Thiel: Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint. CP 2000: 306-319

Kurt Mehlhorn, Mark Ziegelmann: Resource Constrained Shortest Paths. ESA 2000: 326-337

Kurt Mehlhorn: Constraint Programming and Graph Algorithms. ICALP 2000: 571-575

Ernst Althaus, Kurt Mehlhorn: TSP-based curve reconstruction in polynomial time. SODA 2000: 686-695

Kurt Mehlhorn, Guido Schäfer: Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures. Algorithm Engineering 2000: 23-38

Kurt Mehlhorn, Stefan Näher: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press 1999, isbn 0-521-56329-1

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)

Kurt Mehlhorn, Jörg-Rüdiger Sack, Jorge Urrutia: Editorial. Comput. Geom. 12(3-4): 153-154 (1999)

Joseph Cheriyan, Kurt Mehlhorn: An Analysis of the Highest-Level Selection Rule in the Preflow-Push Max-Flow. Inf. Process. Lett. 69(5): 239-242 (1999)

Srinivasa Rao Arikati, Kurt Mehlhorn: A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm. Inf. Process. Lett. 70(5): 251-254 (1999)

Stefan Funke, Kurt Mehlhorn, Stefan Näher: Structural filtering: A paradigm for efficient and exact geometric programs. CCCG 1999

Tamal K. Dey, Kurt Mehlhorn, Edgar A. Ramos: Curve Reconstruction: Connecting Dots with Good Reason. Symposium on Computational Geometry 1999: 197-206

Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra: Efficient Exact Geometric Computation Made Easy. Symposium on Computational Geometry 1999: 341-350

Kurt Mehlhorn: The Engineering of some Bipartite Matching Programs. FSTTCS 1999: 446-449

Kurt Mehlhorn: The Engineering of Some Bipartite Matching Programs. ISAAC 1999: 1-3

Ulrich Finkler, Kurt Mehlhorn: Checking Priority Queues. SODA 1999: 901-902

Kurt Mehlhorn: Ten Years of LEDA Some Thoughts (Abstract). Algorithm Engineering 1999: 14

Andreas Crauser, Kurt Mehlhorn: LEDA-SM Extending LEDA to Secondary Memory. Algorithm Engineering 1999: 229-243

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)

Ernst Althaus, Kurt Mehlhorn: Maximum Network Flow with Floating Point Arithmetic. Inf. Process. Lett. 66(3): 109-113 (1998)

Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos: Randomized External-Memory Algorithms for Some Geometric Problems. Symposium on Computational Geometry 1998: 259-268

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

Kurt Mehlhorn, Stefan Näher: From Algorithms to Working Programs: On the Use of Program Checking in LEDA. MFCS 1998: 84-93

Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders: A Parallelization of Dijkstra's Shortest Path Algorithm. MFCS 1998: 722-731

Kurt Mehlhorn (Ed.): Fundamentals - Foundations of Computer Science, IFIP World Computer Congress 1998, August 31 - September 4, 1998, Vienna/Austria and Budapest/Hungary. books@ocg.at 117, Austrian Computer Society 1998, isbn 3-85403-117-3

Kurt Mehlhorn (Ed.): Algorithm Engineering, 2nd International Workshop, WAE '92, Saarbrücken, Germany, August 20-22, 1998, Proceedings. Max-Planck-Institut für Informatik 1998

Kurt Mehlhorn, R. Sundar, Christian Uhrig: Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time. Algorithmica 17(2): 183-198 (1997)

Kurt Mehlhorn, Volker Priebe: On the all-pairs shortest-path algorithm of Moffat and Takaoka. Random Struct. Algorithms 10(1-2): 205-220 (1997)

Kurt Mehlhorn, Thomas C. Shermer, Chee-Keng Yap: A Complete Roundness Classification Procedure. Symposium on Computational Geometry 1997: 129-138

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. Symposium on Computational Geometry 1997: 254-263

Kurt Mehlhorn, Stefan Näher, Christian Uhrig: The LEDA Platform of Combinatorial and Geometric Computing. ICALP 1997: 7-16

Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe: Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model. RANDOM 1997: 15-26

Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kurt Mehlhorn, John D. Kececioglu: A branch-and-cut algorithm for multiple sequence alignment. RECOMB 1997: 241-250

Ulrich Finkler, Kurt Mehlhorn: Runtime Prediction of Real Programs on Real Machines. SODA 1997: 380-389

Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra: A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots. SODA 1997: 702-709

Joseph Cheriyan, Kurt Mehlhorn: Algorithms for Dense Graphs and Networks on the Random Access Computer. Algorithmica 15(6): 521-549 (1996)

Kurt Mehlhorn, Petra Mutzel: On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm. Algorithmica 16(2): 233-242 (1996)

Helmut Alt, Leonidas J. Guibas, Kurt Mehlhorn, Richard M. Karp, Avi Wigderson: A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Algorithmica 16(4/5): 543-547 (1996)

Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn: An o(n³)-Time Algorithm Maximum-Flow Algorithm. SIAM J. Comput. 25(6): 1144-1170 (1996)

Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, Christian Uhrig: Checking Geometric Programs or Verification of Geometric Structures. Symposium on Computational Geometry 1996: 159-165

Kurt Mehlhorn, Stefan Näher, Christian Uhrig: The LEDA Platform for Combinatorial and Geometric Computing. GI Jahrestagung 1996: 43-50

Kurt Mehlhorn: Position Paper for Panel Discussion. WACG 1996: 51-52

Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig: Lower Bounds for Set Intersection Queries. Algorithmica 14(2): 154-168 (1995)

Kurt Mehlhorn, Stefan Näher: LEDA: A Platform for Combinatorial and Geometric Computing. Commun. ACM 38(1): 96-102 (1995)

Kurt Mehlhorn: Guest Editor's Foreword. Discrete & Computational Geometry 14(4): 363 (1995)

Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn: A Communication-Randomness Tradeoff for Two-Processor Systems. Inf. Comput. 116(2): 155-161 (1995)

Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig: Exact Geometric Computation in LEDA. Symposium on Computational Geometry 1995: C18-C19

Kurt Mehlhorn, Volker Priebe: On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka. ESA 1995: 185-198

Kurt Mehlhorn: Experiences with the Implementation of Geometric Algorithms (Abstract). WADS 1995: 518

Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn: A Lower Bound for Area-Universal Graphs. Inf. Process. Lett. 51(2): 101-105 (1994)

Hanna Baumgarten, Hermann Jung, Kurt Mehlhorn: Dynamic Point Location in General Subdivisions. J. Algorithms 17(3): 342-380 (1994)

Michael Kaufmann, Kurt Mehlhorn: A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs. SIAM J. Comput. 23(2): 227-246 (1994)

Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan: Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM J. Comput. 23(4): 738-761 (1994)

Christoph Burnikel, Kurt Mehlhorn, Stefan Schirra: How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results. ESA 1994: 227-239

Kurt Mehlhorn, Stefan Näher: The Implementation of Geometric Algorithms. IFIP Congress (1) 1994: 223-231

Christoph Burnikel, Kurt Mehlhorn, Stefan Schirra: On Degeneracy in Geometric Computations. SODA 1994: 16-23

Kurt Mehlhorn, R. Sundar, Christian Uhrig: Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic Time. SODA 1994: 213-222

Rolf Klein, Kurt Mehlhorn, Stefan Meiser: Randomized Incremental Construction of Abstract Voronoi Diagrams. Comput. Geom. 3: 157-184 (1993)

Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel: Four Results on Randomized Incremental Constructions. Comput. Geom. 3: 185-212 (1993)

Kurt Mehlhorn, Micha Sharir, Emo Welzl: Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection. Comput. Geom. 3: 235-246 (1993)

Kurt Mehlhorn, Athanasios K. Tsakalidis: Dynamic Interpolation Search. J. ACM 40(3): 621-634 (1993)

Kurt Mehlhorn, Volker Claus, Wolfgang Thomas: Komplexitätstheorie und Algorithmik. Perspektiven der Informatik 1993: 113-116

Devdatt P. Dubhashi, Kurt Mehlhorn, Desh Ranjan, Christian Thiel: Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets. FSTTCS 1993: 436-443

Torben Hagerup, Kurt Mehlhorn, J. Ian Munro: Maintaining Discrete Probability Distributions Optimally. ICALP 1993: 253-264

Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig: Lower Bounds for Set Intersection Queries. SODA 1993: 194-201

Ludek Kucera, Kurt Mehlhorn, B. Preis, E. Schwarzenecker: Exact Algorithms for a Geometric Packing Problem (Extended Abstract). STACS 1993: 317-322

Katrin Dobrindt, Kurt Mehlhorn, Mariette Yvinec: A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron. WADS 1993: 314-324

Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap: Simultaneous Inner and Outer Approximation of Shapes. Algorithmica 8(5&6): 365-389 (1992)

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)

Kurt Mehlhorn, Wolfgang J. Paul, Christian Uhrig: k versus k+1 Index Registers and Modifiable versus Non-modifiable Programs. Inf. Comput. 101(1): 123-129 (1992)

Helmut Alt, Viliam Geffert, Kurt Mehlhorn: A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition. Inf. Process. Lett. 42(1): 25-27 (1992)

Michael Kaufmann, Kurt Mehlhorn: On local routing of two-terminal nets. J. Comb. Theory, Ser. B 55(1): 33-72 (1992)

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

Kurt Mehlhorn: Recent Developments in Algorithms for the Maximum-Flow Problem (Abstract). FSTTCS 1992: 404

Kurt Mehlhorn, Stefan Näher: Algorithm Design and Software Libraries: Recent Developments in the LEDA Project. IFIP Congress (1) 1992: 493-505

Kurt Mehlhorn, Micha Sharir, Emo Welzl: Tail Estimates for the Space Complexity of Randomized Incremental Algorithms. SODA 1992: 89-93

Hanna Baumgarten, Hermann Jung, Kurt Mehlhorn: Dynamic Point Location in General Subdivisions. SODA 1992: 250-258

Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel: Four Results on Randomized Incremental Constructions. STACS 1992: 463-474

Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing: On the Construction of Abstract Voronoi Diagrams. Discrete & Computational Geometry 6: 211-224 (1991)

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). Inf. Process. Lett. 37(4): 237-240 (1991)

Kurt Mehlhorn, Chee-Keng Yap: Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves. SIAM J. Comput. 20(4): 603-621 (1991)

Kurt Mehlhorn, Stefan Näher: Dynamic Fractional Cascading. Algorithmica 5(2): 215-241 (1990)

Yu-Tai Ching, Kurt Mehlhorn, Michiel H. M. Smid: Dynamic Deferred Data Structuring. Inf. Process. Lett. 35(1): 37-40 (1990)

Kurt Mehlhorn, Stefan Näher, Christian Uhrig: Hidden Line Elimination for Isooriented Rectangels. Inf. Process. Lett. 35(3): 137-143 (1990)

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)

Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert Endre Tarjan: Faster Algorithms for the Shortest Path Problem. J. ACM 37(2): 213-223 (1990)

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)

Kurt Mehlhorn, Stefan Näher: A faster compaction algorithm with automatic jog insertion. IEEE Trans. on CAD of Integrated Circuits and Systems 9(2): 158-166 (1990)

Kurt Mehlhorn, Wolfgang Rülling: Compaction on the torus [VLSI layout]. IEEE Trans. on CAD of Integrated Circuits and Systems 9(4): 389-397 (1990)

Kurt Mehlhorn, Athanasios K. Tsakalidis: Data Structures. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 301-342

Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap: On Simultaneous Inner and Outer Approximation of Shapes. Symposium on Computational Geometry 1990: 216-224

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. Symposium on Computational Geometry 1990: 281-289

Stefan Näher, Kurt Mehlhorn: LEDA - A Library of Efficient Data Types and Algorithms. GI Jahrestagung (1) 1990: 35-39

Stefan Näher, Kurt Mehlhorn: LEDA: A Library of Efficient Data Types and Algorithms. ICALP 1990: 1-5

Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn: Can A Maximum Flow be Computed on o(nm) Time? ICALP 1990: 235-248

Rolf Klein, Kurt Mehlhorn, Stefan Meiser: On the Construction of Abstract Voronoi Diagrams, II. SIGAL International Symposium on Algorithms 1990: 138-154

Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing: On the Construction of Abstract Voronoi Diagrams. STACS 1990: 227-239

Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn: A Time-Randomness Tradeoff for Communication Complexity. WDAG 1990: 390-401

Jacques Loeckx, Kurt Mehlhorn, Reinhard Wilhelm: Foundations of Programming Languages. John Wiley 1989, isbn 0-471-92139-4

Martin Fürer, Kurt Mehlhorn: AT²-Optimal Galois Field Multiplier for VLSI. IEEE Trans. Computers 38(9): 1333-1336 (1989)

Kurt Mehlhorn, Stefan Näher, Monika Rauch: On the Complexity of a Game Related to the Dictionary Problem. FOCS 1989: 546-548

Kurt Mehlhorn, Wolfgang J. Paul: Two Versus One Index Register and Modifiable Versus Non-modifiable Programs. ICALP 1989: 603-609

Kurt Mehlhorn, Stefan Näher: LEDA: A Library of Efficient Data Types and Algorithms. MFCS 1989: 88-106

Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl: Congruence, Similarity, and Symmetries of Geometric Objects. Discrete & Computational Geometry 3: 237-256 (1988)

Kurt Mehlhorn: A Faster Approximation Algorithm for the Steiner Problem in Graphs. Inf. Process. Lett. 27(3): 125-128 (1988)

Hermann Jung, Kurt Mehlhorn: Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees. Inf. Process. Lett. 27(5): 227-236 (1988)

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)

Kurt Mehlhorn, Wolfgang Rülling: Compaction on the Torus. AWOC 1988: 212-225

Shaodi Gao, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling, Christoph Storb, Mark Jerrum: On Continuous Homotopic One Layer Routing. Workshop on Computational Geometry 1988: 55-70

Shaodi Gao, Mark Jerrum, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling: On Continuous Homotopic One Layer Routing. Symposium on Computational Geometry 1988: 392-402

Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan: Dynamic Perfect Hashing: Upper and Lower Bounds. FOCS 1988: 524-531

Kurt Mehlhorn, Gerhard Zimmermann: SFB 124: VLSI-Entwurfsmethoden und Parallelität. GI Jahrestagung (2) 1988: 3-29

Kurt Mehlhorn, Chee-Keng Yap: Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves. ICALP 1988: 410-423

Martin Dietzfelbinger, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert: Upper and Lower Bounds for the Dictionary Problem (Abstract). SWAT 1988: 214-215

Kurt Mehlhorn, Franco P. Preparata: Area-Time Optimal Division for T=Omega((log n)^1+ epsilon). Inf. Comput. 72(3): 270-282 (1987)

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)

Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata: Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. SIAM J. Comput. 16(5): 808-835 (1987)

Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl: Congruence, Similarity, and Symmetries of Geometric Objects. Symposium on Computational Geometry 1987: 308-315

Kurt Mehlhorn, Stefan Näher, Helmut Alt: A Lower Bound for the Complexity of the Union-Split-Find Problem. ICALP 1987: 479-488

Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata: Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. Parallel Algorithms and Architectures 1987: 11-15

Michael Kaufmann, Kurt Mehlhorn: On Local Routing of Two-Terminal Nets. STACS 1987: 40-52

Andreas Alexander Albrecht, Hermann Jung, Kurt Mehlhorn (Eds.): Parallel Algorithms and Architectures, International Workshop, Suhl, GDR, May 25-30, 1987, Proceedings. Lecture Notes in Computer Science 269, Springer 1987, isbn 3-540-18099-0

Jacques Loeckx, Kurt Mehlhorn, Reinhard Wilhelm: Grundlagen der Programmiersprachen. Teubner 1986, isbn 3-519-02254-0

Michael Becker, Kurt Mehlhorn: Algorithms for Routing in Planar Graphs. Acta Inf. 23(2): 163-176 (1986)

Kurt Mehlhorn, Franco P. Preparata, Majid Sarrafzadeh: Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs. Algorithmica 1(2): 213-221 (1986)

Kurt Hoffman, Kurt Mehlhorn, Pierre Rosenstiehl, Robert Endre Tarjan: Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees. Information and Control 68(1-3): 170-184 (1986)

Kurt Mehlhorn: Über Verdrahtungsalgorithmen. Informatik Spektrum 9(4): 227-234 (1986)

Kurt Mehlhorn, Franco P. Preparata: Routing through a rectangle. J. ACM 33(1): 60-85 (1986)

Michael Kaufmann, Kurt Mehlhorn: Routing Through a Generalized Switchbox. J. Algorithms 7(4): 510-531 (1986)

Kurt Mehlhorn, Athanasios K. Tsakalidis: An Amortized Analysis of Insertions into AVL-Trees. SIAM J. Comput. 15(1): 22-33 (1986)

Martin Fürer, Kurt Mehlhorn: AT²-Optimal Galois Field Multiplier for VLSI. Aegean Workshop on Computing 1986: 217-225

Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata: Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. MFCS 1986: 199-208

Kurt Mehlhorn, Franco P. Preparata: Area-time Optimal Division for T=Omega(log n)^1+epsilon. STACS 1986: 341-352

Fillia Makedon, Kurt Mehlhorn, Theodore S. Papatheodorou, Paul G. Spirakis (Eds.): VLSI Algorithms and Architectures, Aegean Workshop on Computing, Loutraki, Greece, July 8-11, 1986, Proceedings. Lecture Notes in Computer Science 227, Springer 1986, isbn 3-540-16766-8

Stefan Hertel, Kurt Mehlhorn: Fast Triangulation of the Plane with Respect to Simple Polygons. Information and Control 64(1-3): 52-76 (1985)

Heikki Mannila, Kurt Mehlhorn: A Fast Algorithm for Renaming a Set of Clauses as a Horn Set. Inf. Process. Lett. 21(5): 269-272 (1985)

Helmut Alt, Kurt Mehlhorn: Searching Semisorted Tables. SIAM J. Comput. 14(4): 840-848 (1985)

Otfried Fries, Kurt Mehlhorn, Stefan Näher: Dynamization of geometric data structures. Symposium on Computational Geometry 1985: 168-176

Kurt Hoffman, Kurt Mehlhorn, Pierre Rosenstiehl, Robert Endre Tarjan: Sorting Jordan sequences in linear time. Symposium on Computational Geometry 1985: 196-203

Kurt Mehlhorn, Klaus Simon: Intersecting two polyhedra one of which is convex. FCT 1985: 534-542

Michael Kaufmann, Kurt Mehlhorn: Routing Through a Generalized Switchbox. ICALP 1985: 328-337

Kurt Mehlhorn, Athanasios K. Tsakalidis: Dynamic Interpolation Search. ICALP 1985: 424-434

Kurt Mehlhorn (Ed.): STACS 85, 2nd Symposium of Theoretical Aspects of Computer Science, Saarbrücken, Germany, January 3-5, 1985, Proceedings. Lecture Notes in Computer Science 182, Springer 1985, isbn 3-540-13912-5

Kurt Mehlhorn: Data Structures and Algorithms 1: Sorting and Searching. Monographs in Theoretical Computer Science. An EATCS Series 1, Springer 1984, isbn 3-540-13302-X

Kurt Mehlhorn: Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. Monographs in Theoretical Computer Science. An EATCS Series 2, Springer 1984, isbn 3-540-13641-X

Kurt Mehlhorn: Data Structures and Algorithms 3. Monographs in Theoretical Computer Science. An EATCS Series 3, Springer 1984, isbn 3-540-13642-8

Kurt Mehlhorn, Uzi Vishkin: Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories. Acta Inf. 21: 339-374 (1984)

Stefan Hertel, Martti Mäntylä, Kurt Mehlhorn, Jürg Nievergelt: Space Sweep Solves Intersection of Convex Polyhedra. Acta Inf. 21: 501-519 (1984)

Helmut Alt, Kurt Mehlhorn, J. Ian Munro: Partial Match Retrieval in Implicit Data Structures. Inf. Process. Lett. 19(2): 61-65 (1984)

Kurt Mehlhorn: On Optimal VLSI-Circuits for the Basic Arithmetic Functions. CAAP 1984: 23-30

Kurt Mehlhorn: Über Verdrahtungsalgorithmen. GI Jahrestagung (Fachgespräche) 1984: 79-89

Kurt Mehlhorn, Franco P. Preparata: Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time. ICALP 1984: 347-357

Max Fontet, Kurt Mehlhorn (Eds.): STACS 84, Symposium of Theoretical Aspects of Computer Science, Paris, France, 11-13 April, 1984, Proceedings. Lecture Notes in Computer Science 166, Springer 1984, isbn 3-540-12920-0

Burchard von Braunmühl, Stephen A. Cook, Kurt Mehlhorn, Rutger Verbeek: The Recognition of Deterministic CFL's in Small Time and Space. Information and Control 56(1/2): 34-51 (1983)

Kurt Mehlhorn, Franco P. Preparata: Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time. Information and Control 58(1-3): 137-156 (1983)

Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg: Cost Trade-offs in Graph Embeddings, with Applications. J. ACM 30(4): 709-728 (1983)

Stefan Hertel, Kurt Mehlhorn: Fast Triangulation of Simple Polygons. FCT 1983: 207-218

Kurt Mehlhorn, Bernd H. Schmidt: A Single Shortest Path Algorithm for Graphs with Separators. FCT 1983: 302-309

Scott Huddleston, Kurt Mehlhorn: A New Data Structure for Representing Sorted Lists. Acta Inf. 17: 157-184 (1982)

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. Information and Control 55(1-3): 125-174 (1982)

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)

Kurt Mehlhorn: A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions. SIAM J. Comput. 11(4): 748-760 (1982)

Kurt Mehlhorn: On the Program Size of Perfect and Universal Hash Functions. FOCS 1982: 170-175

Kurt Mehlhorn, Erik Meineche Schmidt: Las Vegas Is better than Determinism in VLSI and Distributed Computing (Extended Abstract). STOC 1982: 330-337

Kurt Mehlhorn, Mark H. Overmars: Optimal Dynamization of Decomposable Searching Problems. Inf. Process. Lett. 12(2): 93-98 (1981)

Kurt Mehlhorn: Arbitrary Weight Changes in Dynamic Trees. ITA 15(3): 183-211 (1981)

Kurt Mehlhorn: Lower Bounds on the Efficiency of Transforming Static Data sSructures into Dynamic Structures. Mathematical Systems Theory 15(1): 1-16 (1981)

Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg: Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version). ICALP 1981: 41-55

Helmut Alt, Kurt Mehlhorn, J. Ian Munro: Partial Match Retrieval in Implicit Data Structures. MFCS 1981: 156-161

Scott Huddleston, Kurt Mehlhorn: Robust Balancing in B-Trees. Theoretical Computer Science 1981: 234-244

Reiner Güttler, Kurt Mehlhorn, Wolfgang Schneider: Binary Search Trees: Average and Worst Case Behavior. Elektronische Informationsverarbeitung und Kybernetik 16(1-3): 41-61 (1980)

Doris Altenkamp, Kurt Mehlhorn: Codes: Unequal Probabilities, Unequal Letter Cost. J. ACM 27(3): 412-427 (1980)

Norbert Blum, Kurt Mehlhorn: On the Average Number of Rebalancing Operations in Weight-Balanced Trees. Theor. Comput. Sci. 11: 303-320 (1980)

Kurt Mehlhorn: An efficient algorithm for constructing nearly optimal prefix codes. IEEE Transactions on Information Theory 26(5): 513-517 (1980)

Kurt Mehlhorn: Pebbling Moutain Ranges and its Application of DCFL-Recognition. ICALP 1980: 422-435

Kurt Mehlhorn: A New Data Structure for Representing Sorted Lists. WG 1980: 90-112

Kurt Mehlhorn: Some Remarks on Boolean Sums. Acta Inf. 12: 371-375 (1979)

Kurt Mehlhorn: Parsing Macro Grammars Top Down. Information and Control 40(2): 123-143 (1979)

Helmut Alt, Kurt Mehlhorn: Complexity arguments in algebraic language theory. ITA 13(3) (1979)

Kurt Mehlhorn: Dynamic Binary Search. SIAM J. Comput. 8(2): 175-198 (1979)

Kurt Mehlhorn: Konzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens. GI Jahrestagung 1979: 16-22

Kurt Mehlhorn: Searching, Sorting and Information Theory. MFCS 1979: 131-145

Kurt Mehlhorn: Some Remarks on Boolean Sums. MFCS 1979: 375-380

Norbert Blum, Kurt Mehlhorn: Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen. Theoretical Computer Science 1979: 67-78

Kurt Mehlhorn: Sorting Presorted Files. Theoretical Computer Science 1979: 199-212

Kurt Mehlhorn: Effiziente Algorithmen: Ein Beispiel. Informatik Spektrum 1(2): 81-89 (1978)

Doris Altenkamp, Kurt Mehlhorn: Codes: Unequal Probabilities, Unequal Letter Costs (Extended Abstract). ICALP 1978: 15-25

Kurt Mehlhorn: Effiziente Algorithmen. Teubner 1977, isbn 3-519-02343-1

Peter Deussen, Kurt Mehlhorn: Van Wijngaarden Grammars and Space Complexity Classs EXSPACE. Acta Inf. 8: 193-199 (1977)

Kurt Mehlhorn: A Best Possible Bound for the Weighted Path Length of Binary Search Trees. SIAM J. Comput. 6(2): 235-239 (1977)

Kurt Mehlhorn: Dynamic Binary Search. ICALP 1977: 323-336

Kurt Mehlhorn, Zvi Galil: Monotone switching circuits and boolean matrix product. Computing 16(1-2): 99-111 (1976)

Kurt Mehlhorn: An Improved Lower Bound on the Formula Complexity of Context-free Recognition. Elektronische Informationsverarbeitung und Kybernetik 12(11/12): 523-524 (1976)

Kurt Mehlhorn: Bracket-Languages are Recognizable in Logarithmic Space. Inf. Process. Lett. 5(6): 168-170 (1976)

Kurt Mehlhorn: Polynomial and Abstract Subrecursive Classes. J. Comput. Syst. Sci. 12(2): 147-178 (1976)

Manfred Heydthausen, Kurt Mehlhorn: Top Down Parsing of Macro Grammars. GI Jahrestagung 1976: 95-108

Reiner Güttler, Kurt Mehlhorn, Wolfgang Schneider, Norbert Wernet: Binary Search Trees: Average and Worst Case Behavior. GI Jahrestagung 1976: 301-313

Helmut Alt, Kurt Mehlhorn: Lower Bounds for the Space Complexity of Context-Free Recognition. ICALP 1976: 338-354

Kurt Mehlhorn: Nearly Optimal Binary Search Trees. Acta Inf. 5: 287-295 (1975)

Kurt Mehlhorn: Best possible bounds for the weighted path length of optimum binary search trees. Automata Theory and Formal Languages 1975: 31-41

Kurt Mehlhorn, Zvi Galil: Monotone Switching Circuits and Boolean Matrix Product. MFCS 1975: 315-319

Kurt Mehlhorn: The "Almost All" Theory of Subrecursive Degrees is Decidable. ICALP 1974: 317-325

Kurt Mehlhorn: Polynomial and Abstract Subrecursive Classes. STOC 1974: 96-109

Kurt Mehlhorn: On the Size of Sets of Computable Functions. SWAT (FOCS) 1973: 190-196