Kurt Mehlhorn
Orcid: 0000-0003-4020-4334Affiliations:
- Max Planck Institute for Informatics, Saarbrücken, Germany
According to our database1,
Kurt Mehlhorn
authored at least 347 papers
between 1973 and 2024.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 1999, "For important contributions in complexity theory and in the design, analysis, and practice of combinatorial and geometric algorithms.".
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on acm.org
-
on viaf.org
-
on orcid.org
-
on id.loc.gov
-
on gi.de
-
on d-nb.info
-
on isni.org
-
on andrej.com
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
2023
Proceedings of the 24th ACM Conference on Economics and Computation, 2023
Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023
2022
J. Artif. Intell. Res., 2022
CoRR, 2022
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022
2021
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021
2020
2019
Discret. Appl. Math., 2019
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019
Springer, ISBN: 978-3-030-25208-3, 2019
2018
Corrigendum to "Faster algorithms for computing Hong's bound on absolute positiveness" [J. Symb. Comput. 45 (2010) 677-683].
J. Symb. Comput., 2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018
2017
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017
2016
Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design.
Theory Comput. Syst., 2016
Comput. Sci. Rev., 2016
An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions.
CoRR, 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Proceedings of the Logics in Artificial Intelligence - 15th European Conference, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
2015
From approximate factorization to root isolation with application to cylindrical algebraic decomposition.
J. Symb. Comput., 2015
Inf. Comput., 2015
Algorithmica, 2015
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
Proceedings of the Algorithms - ESA 2015, 2015
Proceedings of the Algorithms, Probability, Networks, and Games, 2015
Towards an open online repository of P. polycephalum networks and their corresponding graph representations.
Proceedings of the BICT 2015, 2015
2014
Algorithmica, 2014
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014
Proceedings of the Algorithm Theory - SWAT 2014, 2014
Proceedings of the NASA Formal Methods - 6th International Symposium, NFM 2014, Houston, TX, USA, April 29, 2014
eXamen.press, Springer, ISBN: 978-3-642-05471-6, 2014
2013
J. Graph Theory, 2013
Computing Real Roots of Real Polynomials - An Efficient Method Based on Descartes' Rule of Signs and Newton Iteration.
CoRR, 2013
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013
Proceedings of the Space-Efficient Data Structures, 2013
Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, 2013
2012
Theor. Comput. Sci., 2012
Electron. Colloquium Comput. Complex., 2012
Dagstuhl Reports, 2012
Algorithmica, 2012
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012
2011
J. Symb. Comput., 2011
Comput. Geom., 2011
Algorithmica, 2011
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011
Proceedings of the Algorithms - ESA 2011, 2011
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011
Proceedings of the Algorithms Unplugged, 2011
2010
Math. Comput. Sci., 2010
J. Symb. Comput., 2010
Proceedings of the Mathematical Software, 2010
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010
2009
Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics, 2009
Comput. Sci. Rev., 2009
Note on the paper "K-vertex guarding simple polygons" [Computational Geometry 42 (4) (May 2009) 352-361].
Comput. Geom., 2009
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009
Proceedings of the Algorithms, 2009
2008
Proceedings of the Taschenbuch der Algorithmen, 2008
Comput. Geom., 2008
An [(<i>O</i>)\tilde](<i>m</i><sup>2</sup><i>n</i>)\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs.
Algorithmica, 2008
Springer, ISBN: 978-3-540-77977-3, 2008
2007
Strongly stable matchings in time <i>O</i>(<i>nm</i>) and extension to the hospitals-residents problem.
ACM Trans. Algorithms, 2007
Theory Comput. Syst., 2007
Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments.
Comput. Geom., 2007
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007
Proceedings of the Algorithms, 2007
Proceedings of the Combinatorial Optimization and Applications, 2007
2006
SIAM J. Comput., 2006
Int. J. Comput. Geom. Appl., 2006
Proceedings of the Computational Science and Its Applications, 2006
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006
Proceedings of the Reliable Implementation of Real Number Algorithms: Theory and Practice, 08.01., 2006
2005
Comput. Geom., 2005
Proceedings of the STACS 2005, 2005
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005
Proceedings of the Graph Drawing, 13th International Symposium, 2005
Proceedings of the Algorithms, 2005
Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005
2004
Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem.
Proceedings of the STACS 2004, 2004
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004
Proceedings of the Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004, 2004
2003
Int. J. Comput. Geom. Appl., 2003
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms.
Algorithmica, 2003
Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003
Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation.
Proceedings of the Algorithms, 2003
2002
Implementation of O(n m log n) Weighted Matchings in General Graphs: The Power of Data Structures.
ACM J. Exp. Algorithmics, 2002
Inf. Process. Lett., 2002
Comput. Geom., 2002
Proceedings of the Algorithms, 2002
Proceedings of the Algorithms, 2002
Proceedings of the Algorithms, 2002
2001
SIAM J. Comput., 2001
Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems.
Int. J. Comput. Geom. Appl., 2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Exact geometric computation.
Proceedings of the 5th Hellenic-European Conference on Computer Mathematics and its Applications (HERCMA-01), 2001
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms.
Proceedings of the Algorithms, 2001
Proceedings of the Informatics - 10 Years Back. 10 Years Ahead., 2001
Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001
Proceedings of the Symbolic Algebraic Methods and Verification Methods, 2001
2000
Random Struct. Algorithms, 2000
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals.
Algorithmica, 2000
Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures.
Proceedings of the Algorithm Engineering, 2000
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000
Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2000
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000
Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics, 2000
1999
Inf. Process. Lett., 1999
Inf. Process. Lett., 1999
Comput. Geom., 1999
Proceedings of the Algorithm Engineering, 1999
Proceedings of the Algorithm Engineering, 1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999
Cambridge University Press, ISBN: 0-521-56329-1, 1999
1998
A computational basis for higher-dimensional computational geometry and applications.
Comput. Geom., 1998
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998
From Algorithms to Working Programs on the Use of Program Checking in LEDA.
Proceedings of the Fundamentals - Foundations of Computer Science, 1998
Proceedings of the External Memory Algorithms, 1998
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998
1997
Random Struct. Algorithms, 1997
Algorithmica, 1997
A Robust and Efficient Implementation of a Sweep Line Algorithm for the Straight Line Segment Intersection Problem.
Proceedings of the Workshop on Algorithm Engineering, 1997
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997
Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997
1996
Algorithmica, 1996
Algorithmica, 1996
Algorithmica, 1996
Proceedings of the Applied Computational Geormetry, 1996
1995
Inf. Comput., February, 1995
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995
1994
SIAM J. Comput., 1994
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994
The Implementation of Geometric Algorithms.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994
How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results.
Proceedings of the Algorithms, 1994
1993
Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection.
Comput. Geom., 1993
Comput. Geom., 1993
A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993
Proceedings of the STACS 93, 1993
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993
Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993
Komplexitätstheorie und Algorithmik.
Proceedings of the Informatik: Grundlagen - Amwendungen, 1993
1992
Inf. Comput., November, 1992
Inf. Process. Lett., 1992
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.
Algorithmica, 1992
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992
Algorithm Design and Software Libraries: Recent Developments in the LEDA Project.
Proceedings of the Algorithms, Software, Architecture, 1992
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992
Proceedings of the Data Structures and Efficient Algorithms, 1992
Proceedings of the Informatik, Festschrift zum 60. Geburtstag von Günter Hotz, 1992
1991
SIAM J. Comput., 1991
Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n).
Inf. Process. Lett., 1991
1990
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990
Inf. Process. Lett., 1990
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990
Proceedings of the Algorithms, 1990
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990
Data Structures.
Proceedings of the Handbook of Theoretical Computer Science, 1990
1989
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989
1988
SIAM J. Comput., 1988
Inf. Process. Lett., 1988
Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees.
Inf. Process. Lett., 1988
Discret. Comput. Geom., 1988
Proceedings of the SWAT 88, 1988
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988
Proceedings of the Computational Geometry and its Applications, 1988
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988
1987
SIAM J. Comput., 1987
1986
Über Verdrahtungsalgorithmen.
Inform. Spektrum, 1986
Inf. Control., 1986
Algorithmica, 1986
Proceedings of the STACS 86, 1986
Proceedings of the VLSI Algorithms and Architectures, 1986
1985
Inf. Process. Lett., 1985
Proceedings of the Fundamentals of Computation Theory, 1985
Proceedings of the First Annual Symposium on Computational Geometry, 1985
Proceedings of the First Annual Symposium on Computational Geometry, 1985
1984
Integr., 1984
Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories.
Acta Informatica, 1984
On Optimal VLSI-Circuits for the Basic Arithmetic Functions.
Proceedings of the CAAP'84, 1984
Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry
EATCS Monographs on Theoretical Computer Science 3, Springer, ISBN: 978-3-642-69900-9, 1984
EATCS Monographs on Theoretical Computer Science 2, Springer, ISBN: 978-3-642-69897-2, 1984
EATCS Monographs on Theoretical Computer Science 1, Springer, ISBN: 978-3-642-69672-5, 1984
1983
Inf. Control., 1983
Granularity of Memory in Parallel Computation.
Proceedings of the WG '83, 1983
Proceedings of the Fundamentals of Computation Theory, 1983
Proceedings of the Fundamentals of Computation Theory, 1983
1982
SIAM J. Comput., 1982
Inf. Process. Lett., 1982
Inf. Control., 1982
Las Vegas Is better than Determinism in VLSI and Distributed Computing (Extended Abstract)
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982
1981
Lower Bounds on the Efficiency of Transforming Static Data sSructures into Dynamic Structures.
Math. Syst. Theory, 1981
Lower Bounds on the Efficiency of Transforming Static Data Structures into Dynamic Structures.
Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981
Proceedings of the Automata, 1981
1980
IEEE Trans. Inf. Theory, 1980
Theor. Comput. Sci., 1980
Binary Search Trees: Average and Worst Case Behavior.
J. Inf. Process. Cybern., 1980
Proceedings of the Graphtheoretic Concepts in Computer Science, 1980
Proceedings of the Automata, 1980
1979
RAIRO Theor. Informatics Appl., 1979
Proceedings of the Theoretical Computer Science, 1979
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979
Proceedings of the GI - 9. Jahrestagung, Bonn, 1.-5. Oktober 1979, Proceedings, 1979
1978
Effiziente Algorithmen: Ein Beispiel.
Inform. Spektrum, 1978
Proceedings of the Automata, 1978
1977
SIAM J. Comput., 1977
Effiziente Algorithmen
Teubner, ISBN: 3-519-02343-1, 1977
1976
An Improved Lower Bound on the Formula Complexity of Context-free Recognition.
J. Inf. Process. Cybern., 1976
Lower Bounds for the Space Complexity of Context-Free Recognition.
Proceedings of the Third International Colloquium on Automata, 1976
Proceedings of the GI - 6. Jahrestagung, Stuttgart, 29. September, 1976
Proceedings of the GI - 6. Jahrestagung, Stuttgart, 29. September, 1976
1975
SIGACT News, 1975
Proceedings of the Automata Theory and Formal Languages, 1975
1974
Polynomial and Abstract Subrecursive Classes.
PhD thesis, 1974
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974
1973
Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973