| 2025 | AAAI | Welfare-Optimal Serial Dictatorships Have Polynomial Query Complexity. | Ioannis Caragiannis, Kurt Mehlhorn, Nidhi Rathi |
| 2023 | IJCAI | Fair and Efficient Allocation of Indivisible Chores with Surplus. | Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta |
| 2022 | AAAI | Maximizing Nash Social Welfare in 2-Value Instances. | Hannaneh Akrami, Bhaskar Ray Chaudhury, Martin Hoefer, Kurt Mehlhorn, Marco Schmalhofer, Golnoosh Shahkarami, Giovanna Varricchio, Quentin Vermande, Ernest van Wijland |
| 2020 | SODA | A Little Charity Guarantees Almost Envy-Freeness. | Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa |
| 2019 | MFCS | Trustworthy Graph Algorithms (Invited Talk). | Mohammad Abdulaziz, Kurt Mehlhorn, Tobias Nipkow |
| 2018 | ISAAC | Multi-Finger Binary Search Trees. | Parinya Chalermsook, Mayank Goswami, Lszl Kozma, Kurt Mehlhorn, Thatchaphol Saranurak |
| 2018 | SODA | Approximating the Nash Social Welfare with Budget-Additive Valuations. | Jugal Garg, Martin Hoefer, Kurt Mehlhorn |
| 2017 | SAGT | Earning Limits in Fisher Markets with Spending-Constraint Utilities. | Xiaohui Bei, Jugal Garg, Martin Hoefer, Kurt Mehlhorn |
| 2016 | ESA | Computing Equilibria in Markets with Budget-Additive Utilities. | Xiaohui Bei, Jugal Garg, Martin Hoefer, Kurt Mehlhorn |
| 2016 | ESA | A Note On Spectral Clustering. | Pavel Kolev, Kurt Mehlhorn |
| 2016 | JELIA | Opposition Frameworks. | Cosmina Croitoru, Kurt Mehlhorn |
| 2016 | SODA | An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market. | Ran Duan, Jugal Garg, Kurt Mehlhorn |
| 2015 | ESA | Self-Adjusting Binary Search Trees: What Makes Them Tick? | Parinya Chalermsook, Mayank Goswami, Lszl Kozma, Kurt Mehlhorn, Thatchaphol Saranurak |
| 2015 | FOCS | Pattern-Avoiding Access in Binary Search Trees. | Parinya Chalermsook, Mayank Goswami, Lszl Kozma, Kurt Mehlhorn, Thatchaphol Saranurak |
| 2015 | SAGT | Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design. | Khaled M. Elbassioni, Kurt Mehlhorn, Fahimeh Ramezani |
| 2015 | WADS | Greedy Is an Almost Optimal Deque. | Parinya Chalermsook, Mayank Goswami, Lszl Kozma, Kurt Mehlhorn, Thatchaphol Saranurak |
| 2014 | WALCOM | Algorithms for Equilibrium Prices in Linear Market Models. | Kurt Mehlhorn |
| 2013 | ALENEX | The cost of address translation. | Tomasz Jurkiewicz, Kurt Mehlhorn |
| 2013 | COCOON | On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets. | Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani |
| 2013 | ICALP | Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds. | Luca Becchetti, Vincenzo Bonifaci, Michael Dirnberger, Andreas Karrenbauer, Kurt Mehlhorn |
| 2013 | ICALP | A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market. | Ran Duan, Kurt Mehlhorn |
| 2013 | ISSAC | From approximate factorization to root isolation. | Kurt Mehlhorn, Michael Sagraloff, Pengming Wang |
| 2013 | STACS | Physarum Computations (Invited talk). | Kurt Mehlhorn |
| 2013 | WG | Certifying 3-Edge-Connectivity. | Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt |
| 2012 | ICALP | Counting Arbitrary Subgraphs in Data Streams. | Daniel M. Kane, Kurt Mehlhorn, Thomas Sauerwald, He Sun |
| 2012 | SODA | Physarum can compute shortest paths. | Vincenzo Bonifaci, Kurt Mehlhorn, Girish Varma |
| 2011 | CAV | Verification of Certifying Computations. | Eyad Alkassar, Sascha Bhme, Kurt Mehlhorn, Christine Rizkallah |
| 2011 | ESA | Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. | George Christodoulou, Kurt Mehlhorn, Evangelia Pyrga |
| 2011 | ESA | Approximate Counting of Cycles in Streams. | Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, He Sun |
| 2011 | ICALP | Online Graph Exploration: New Results on Old and New Algorithms. | Nicole Megow, Kurt Mehlhorn, Pascal Schweitzer |
| 2011 | WALCOM | The Physarum Computer. | Kurt Mehlhorn |
| 2010 | FAW | Progress on Certifying Algorithms. | Kurt Mehlhorn, Pascal Schweitzer |
| 2009 | ESA | Breaking the O(m | Edoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, Romeo Rizzi |
| 2009 | ICALP | Assigning Papers to Referees. | Kurt Mehlhorn |
| 2009 | ISSAC | Isolating real roots of real polynomials. | Kurt Mehlhorn, Michael Sagraloff |
| 2007 | COCOA | Matchings in Graphs Variations of the Problem. | Kurt Mehlhorn |
| 2007 | ESA | Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step. | Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein |
| 2007 | MFCS | Minimum Cycle Bases in Graphs Algorithms and Applications. | Kurt Mehlhorn |
| 2007 | STACS | New Approximation Algorithms for Minimum Cycle Bases of Graphs. | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail |
| 2006 | CIAC | Reliable and Efficient Geometric Computing. | Kurt Mehlhorn |
| 2006 | ESA | Reliable and Efficient Geometric Computing. | Kurt Mehlhorn |
| 2006 | ICALP | A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. | Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn |
| 2006 | ICALP | Reliable and Efficient Computational Geometry Via Controlled Perturbation. | Kurt Mehlhorn, Ralf Osbild, Michael Sagraloff |
| 2006 | ICCSA | Reply to "Backward Error Analysis ...". | Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap |
| 2005 | CASC | A Descartes Algorithm for Polynomials with Bit-Stream Coefficients. | Arno Eigenwillig, Lutz Kettner, Werner Krandick, Kurt Mehlhorn, Susanne Schmitt, Nicola Wolpert |
| 2005 | ESA | EXACUS: Efficient and Exact Algorithms for Curves and Surfaces. | Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Joachim Reichel, Susanne Schmitt, Elmar Schmer, Nicola Wolpert |
| 2005 | GD | Minimum Cycle Bases and Surface Reconstruction. | Kurt Mehlhorn |
| 2005 | ICALP | Towards Optimal Multiple Selection. | Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, Peter Sanders |
| 2005 | ISAAC | Pareto Optimality in House Allocation Problems. | David J. Abraham, Katarna Cechlrov, David F. Manlove, Kurt Mehlhorn |
| 2005 | SODA | Popular matchings. | David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn |
| 2005 | SODA | New constructions of (alpha, beta)-spanners and purely additive spanners. | Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie |
| 2005 | SODA | Controlled perturbation for Delaunay triangulations. | Stefan Funke, Christian Klein, Kurt Mehlhorn, Susanne Schmitt |
| 2005 | STACS | A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs. | Telikepalli Kavitha, Kurt Mehlhorn |
| 2004 | ESA | Classroom Examples of Robustness Problems in Geometric Computations. | Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap |
| 2004 | ICALP | A Faster Algorithm for Minimum Cycle Basis of Graphs. | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch |
| 2004 | ISAAC | Pareto Optimality in House Allocation Problems. | David J. Abraham, Katarna Cechlrov, David F. Manlove, Kurt Mehlhorn |
| 2004 | ISAAC | Polyline Fitting of Planar Points Under Min-sum Criteria. | Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama |
| 2004 | SODA | Point containment in the integer hull of a polyhedron. | Ernst Althaus, Friedrich Eisenbrand, Stefan Funke, Kurt Mehlhorn |
| 2004 | SODA | Rank-maximal matchings. | Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch |
| 2004 | STACS | Matching Algorithms Are Fast in Sparse Random Graphs. | Hannah Bast, Kurt Mehlhorn, Guido Schfer, Hisao Tamaki |
| 2004 | STACS | Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem. | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch |
| 2003 | ESA | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation. | Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Michael Seel |
| 2003 | MFCS | Smoothed Analysis of Three Combinatorial Problems. | Cyril Banderier, Ren Beier, Kurt Mehlhorn |
| 2003 | SODA | Certifying and repairing solutions to large LPs how good are LP-solvers? | Marcel Dhiflaoui, Stefan Funke, Carsten Kwappik, Kurt Mehlhorn, Michael Seel, Elmar Schmer, Ralph Schulte, Dennis Weber |
| 2003 | SODA | Certifying algorithms for recognizing interval graphs and permutation graphs. | Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad |
| 2002 | ESA | SCIL - Symbolic Constraints in Integer Linear Programming. | Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jnger, Thomas Kasper, Kurt Mehlhorn |
| 2002 | ESA | A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons. | Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Kurt Mehlhorn, Elmar Schmer |
| 2002 | ESA | External-Memory Breadth-First Search with Sublinear I/O. | Kurt Mehlhorn, Ulrich Meyer |
| 2001 | ALENEX | CNOP - A Package for Constrained Network Optimization. | Kurt Mehlhorn, Mark Ziegelmann |
| 2001 | ESA | A Separation Bound for Real Algebraic Expressions. | Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt |
| 2001 | ESA | A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. | Kurt Mehlhorn, Guido Schfer |
| 2001 | SODA | An efficient algorithm for the configuration problem of dominance graphs. | Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel |
| 2000 | ACL | A Polynomial-Time Fragment of Dominance Constraints. | Alexander Koller, Kurt Mehlhorn, Joachim Niehren |
| 2000 | CP | Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint. | Kurt Mehlhorn, Sven Thiel |
| 2000 | ESA | Resource Constrained Shortest Paths. | Kurt Mehlhorn, Mark Ziegelmann |
| 2000 | ICALP | Constraint Programming and Graph Algorithms. | Kurt Mehlhorn |
| 2000 | SODA | TSP-based curve reconstruction in polynomial time. | Ernst Althaus, Kurt Mehlhorn |
| 1999 | ISAAC | The Engineering of Some Bipartite Matching Programs. | Kurt Mehlhorn |
| 1999 | SODA | Checking Priority Queues. | Ulrich Finkler, Kurt Mehlhorn |
| 1998 | MFCS | A Parallelization of Dijkstra's Shortest Path Algorithm. | Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders |
| 1998 | MFCS | From Algorithms to Working Programs: On the Use of Program Checking in LEDA. | Kurt Mehlhorn, Stefan Nher |
| 1997 | ICALP | The LEDA Platform of Combinatorial and Geometric Computing. | Kurt Mehlhorn, Stefan Nher, Christian Uhrig |
| 1997 | RECOMB | A branch-and-cut algorithm for multiple sequence alignment. | Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kurt Mehlhorn, John D. Kececioglu |
| 1997 | SODA | A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots. | Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra |
| 1997 | SODA | Runtime Prediction of Real Programs on Real Machines. | Ulrich Finkler, Kurt Mehlhorn |
| 1996 | GI | The LEDA Platform for Combinatorial and Geometric Computing. | Kurt Mehlhorn, Stefan Nher, Christian Uhrig |
| 1995 | ESA | On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka. | Kurt Mehlhorn, Volker Priebe |
| 1995 | WADS | Experiences with the Implementation of Geometric Algorithms (Abstract). | Kurt Mehlhorn |
| 1994 | ESA | How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results. | Christoph Burnikel, Kurt Mehlhorn, Stefan Schirra |
| 1994 | SODA | On Degeneracy in Geometric Computations. | Christoph Burnikel, Kurt Mehlhorn, Stefan Schirra |
| 1994 | SODA | Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic Time. | Kurt Mehlhorn, R. Sundar, Christian Uhrig |
| 1993 | ICALP | Maintaining Discrete Probability Distributions Optimally. | Torben Hagerup, Kurt Mehlhorn, J. Ian Munro |
| 1993 | SODA | Lower Bounds for Set Intersection Queries. | Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig |
| 1993 | STACS | Exact Algorithms for a Geometric Packing Problem (Extended Abstract). | Ludek Kucera, Kurt Mehlhorn, B. Preis, Erik Schwarzenecker |
| 1993 | WADS | A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron. | Katrin Dobrindt, Kurt Mehlhorn, Mariette Yvinec |
| 1992 | SODA | Dynamic Point Location in General Subdivisions. | Hanna Baumgarten, Hermann Jung, Kurt Mehlhorn |
| 1992 | SODA | Tail Estimates for the Space Complexity of Randomized Incremental Algorithms. | Kurt Mehlhorn, Micha Sharir, Emo Welzl |
| 1992 | STACS | Four Results on Randomized Incremental Constructions. | Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel |
| 1990 | GI | LEDA - A Library of Efficient Data Types and Algorithms. | Stefan Nher, Kurt Mehlhorn |
| 1990 | ICALP | Can A Maximum Flow be Computed on o(nm) Time? | Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn |
| 1990 | ICALP | LEDA: A Library of Efficient Data Types and Algorithms. | Stefan Nher, Kurt Mehlhorn |
| 1990 | STACS | On the Construction of Abstract Voronoi Diagrams. | Kurt Mehlhorn, Stefan Meiser, Colm 'Dnlaing |
| 1989 | FOCS | On the Complexity of a Game Related to the Dictionary Problem | Kurt Mehlhorn, Stefan Nher, Monika Rauch |
| 1989 | ICALP | Two Versus One Index Register and Modifiable Versus Non-modifiable Programs. | Kurt Mehlhorn, Wolfgang J. Paul |
| 1989 | MFCS | LEDA: A Library of Efficient Data Types and Algorithms. | Kurt Mehlhorn, Stefan Nher |
| 1988 | FOCS | Dynamic Perfect Hashing: Upper and Lower Bounds | Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan |
| 1988 | GI | SFB 124: VLSI-Entwurfsmethoden und Parallelitt. | Kurt Mehlhorn, Gerhard Zimmermann |
| 1988 | ICALP | Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves. | Kurt Mehlhorn, Chee-Keng Yap |
| 1987 | ICALP | A Lower Bound for the Complexity of the Union-Split-Find Problem. | Kurt Mehlhorn, Stefan Nher, Helmut Alt |
| 1987 | STACS | On Local Routing of Two-Terminal Nets. | Michael Kaufmann, Kurt Mehlhorn |
| 1986 | MFCS | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. | Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata |
| 1986 | STACS | Area-time Optimal Division for T=Omega(log n) | Kurt Mehlhorn, Franco P. Preparata |
| 1985 | FCT | Intersecting two polyhedra one of which is convex. | Kurt Mehlhorn, Klaus Simon |
| 1985 | ICALP | Routing Through a Generalized Switchbox. | Michael Kaufmann, Kurt Mehlhorn |
| 1985 | ICALP | Dynamic Interpolation Search. | Kurt Mehlhorn, Athanasios K. Tsakalidis |
| 1984 | GI | ber Verdrahtungsalgorithmen. | Kurt Mehlhorn |
| 1984 | ICALP | Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time. | Kurt Mehlhorn, Franco P. Preparata |
| 1983 | FCT | Fast Triangulation of Simple Polygons. | Stefan Hertel, Kurt Mehlhorn |
| 1983 | FCT | A Single Shortest Path Algorithm for Graphs with Separators. | Kurt Mehlhorn, Bernd H. Schmidt |
| 1983 | WG | Granularity of Memory in Parallel Computation. | Kurt Mehlhorn, Uzi Vishkin |
| 1982 | FOCS | On the Program Size of Perfect and Universal Hash Functions | Kurt Mehlhorn |
| 1982 | STOC | Las Vegas Is better than Determinism in VLSI and Distributed Computing (Extended Abstract) | Kurt Mehlhorn, Erik Meineche Schmidt |
| 1981 | ICALP | Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version). | Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg |
| 1981 | MFCS | Partial Match Retrieval in Implicit Data Structures. | Helmut Alt, Kurt Mehlhorn, J. Ian Munro |
| 1981 | WG | Lower Bounds on the Efficiency of Transforming Static Data Structures into Dynamic Structures. | Kurt Mehlhorn |
| 1980 | ICALP | Pebbling Moutain Ranges and its Application of DCFL-Recognition. | Kurt Mehlhorn |
| 1980 | WG | A New Data Structure for Representing Sorted Lists. | Kurt Mehlhorn |
| 1979 | GI | Konzepte der Komplexittstheorie illustriert am Beispiel des Sortierens. | Kurt Mehlhorn |
| 1979 | MFCS | Searching, Sorting and Information Theory. | Kurt Mehlhorn |
| 1979 | MFCS | Some Remarks on Boolean Sums. | Kurt Mehlhorn |
| 1978 | ICALP | Codes: Unequal Probabilities, Unequal Letter Costs (Extended Abstract). | Doris Altenkamp, Kurt Mehlhorn |
| 1977 | ICALP | Dynamic Binary Search. | Kurt Mehlhorn |
| 1976 | GI | Binary Search Trees: Average and Worst Case Behavior. | Reiner Gttler, Kurt Mehlhorn, Wolfgang Schneider, Norbert Wernet |
| 1976 | GI | Top Down Parsing of Macro Grammars. | Manfred Heydthausen, Kurt Mehlhorn |
| 1976 | ICALP | Lower Bounds for the Space Complexity of Context-Free Recognition. | Helmut Alt, Kurt Mehlhorn |
| 1975 | MFCS | Monotone Switching Circuits and Boolean Matrix Product. | Kurt Mehlhorn, Zvi Galil |
| 1974 | ICALP | The "Almost All" Theory of Subrecursive Degrees is Decidable. | Kurt Mehlhorn |
| 1974 | STOC | Polynomial and Abstract Subrecursive Classes | Kurt Mehlhorn |
| 1973 | FOCS | On the Size of Sets of Computable Functions | Kurt Mehlhorn |