Kurt Mehlhorn

Kurt Mehlhorn
Name	Kurt Mehlhorn
Birth date	1954-11-11
Birth place	Gelsenkirchen, North Rhine-Westphalia
Nationality	German
Fields	Computer science, Algorithms, Data structures, Computational geometry, Computer algebra
Alma mater	University of Bonn, University of Saarland
Doctoral advisor	Wilfried Brauer
Known for	Algorithm engineering, LEDA, Computational complexity

Kurt Mehlhorn is a German computer scientist noted for foundational work in algorithms, data structures, and algorithm engineering. He has led major research groups, developed influential software, and contributed to theoretical and practical aspects of computer science through collaborations with European and international institutions. His career spans roles at universities, research centers, and professional societies linked to computational theory and applications.

Early life and education

Mehlhorn was born in Gelsenkirchen and educated in the German academic system, undertaking studies at the University of Bonn and the University of Saarland, where he completed doctoral research under Wilfried Brauer. His formation intersected with developments at institutions such as the Max Planck Society, the German Research Foundation, and interactions with researchers from the Technical University of Munich and RWTH Aachen University. During his formative years he encountered influential figures and groups from the Institut für Informatik, the European Research Consortium, and collaborators connected to the International Congress of Mathematicians and the Association for Computing Machinery.

Research and contributions

Mehlhorn's research spans algorithm design, data structures, computational geometry, graph algorithms, computer algebra, and algorithm engineering. His work built on theories from Donald Knuth, Edsger W. Dijkstra, Robert Tarjan, and Jack Edmonds, and contributed techniques related to work by Michael Garey, David S. Johnson, Richard Karp, and Leslie Valiant. Mehlhorn advanced practical algorithm engineering following principles similar to those promoted by John H. Reif, Ronald Fagin, and Thomas H. Cormen, emphasizing implementations alongside asymptotic analysis. He pioneered development of robust libraries and tools, integrating concepts from Günter Hotz, Erich W. Weisstein, and collaborators at the Max Planck Institute for Informatics and Saarland University.

His contributions include improved algorithms for shortest paths, minimum spanning trees, matching, flow problems, geometric searching, and symbolic computation, interacting with work by Andrew Yao, Sanjeev Arora, Avi Wigderson, Noga Alon, and Rudolf Euler-era inspirations in algorithmic combinatorics. He promoted rigorous experimental evaluation consistent with methodologies advanced by Donald Knuth and later practitioners at International Symposium on Experimental Algorithms and Symposium on Discrete Algorithms.

Academic career and positions

Mehlhorn held professorships and leadership positions at institutions such as Saarland University and research posts connected to the Max Planck Society. He founded and directed research groups affiliated with the Max Planck Institute for Informatics and headed centers that collaborated with the University of California, Berkeley, Massachusetts Institute of Technology, Stanford University, ETH Zurich, University of Cambridge, and University of Oxford. He served on program committees for conferences including the International Colloquium on Automata, Languages and Programming, the Symposium on Theory of Computing, the European Symposium on Algorithms, and the International Conference on Computer Aided Verification. Mehlhorn contributed to advisory boards of organizations such as the German Informatics Society, the European Research Council, and the Deutsches Forschungsnetz.

Awards and honors

Mehlhorn's achievements have been recognized by awards and memberships including election to academies and prizes from national and international bodies. He is associated with honors comparable to those bestowed by the Association for Computing Machinery, the European Academy of Sciences, the German National Academy of Sciences Leopoldina, and the Max Planck Society. He received distinctions linked to institutions such as the German Research Foundation, the Alexander von Humboldt Foundation, and German federal recognitions that parallel awards from the Bundesministerium für Bildung und Forschung and regional honors from Saarland authorities.

Selected publications and software

Mehlhorn authored and coauthored textbooks, monographs, and software systems that have been widely used in research and teaching. Notable written works align with coauthors such as Peter Sanders, Sergio Rajsbaum, Svenja Straßburg, Michael Waidner, and reflect themes present in publications by Jon Kleinberg, Éva Tardos, Christos Papadimitriou, and Sanjoy Dasgupta. He led development of LEDA, a comprehensive library for combinatorial and geometric computing, comparable in impact to libraries like those from Boost C++ Libraries, CGAL, and tools originating at Bell Labs. His software and algorithms are showcased at conferences such as the Symposium on Computational Geometry, the International Symposium on Experimental Algorithms, and in journals associated with the IEEE Computer Society and ACM.

Selected works include algorithmic texts, surveys, and implemented libraries that influenced curricula at Saarland University, ETH Zurich, TU Darmstadt, and other European computer science departments. His outputs interfaced with projects at Deutsche Forschungsgemeinschaft-funded centers and collaborative EU initiatives like those coordinated through the European Commission and the Framework Programme.

Personal life and legacy

Mehlhorn's mentorship produced generations of researchers placed at institutions including MPI Saarbrücken, Universität des Saarlandes, Carnegie Mellon University, Princeton University, Harvard University, and industrial research labs such as IBM Research, Microsoft Research, Google Research, and Siemens. His legacy includes contributions to curricula at the University of Bonn and impact on professional societies like the IEEE, the ACM, and the German Informatics Society, as well as influence on algorithmic practice in industry projects from SAP and Bosch. He remains a pivotal figure linking theoretical developments from pioneers like Kurt Gödel, Alan Turing, Alonzo Church to modern algorithm engineering and applied computer science.

Category:German computer scientists Category:1954 births Category:Living people