Kurt Mehlhorn

Kurt Mehlhorn is a renowned Adjunct Professor at the Max Planck Institute for Informatics and holds an honorary professorship at Saarland University. He leads the 'Algorithms and Complexity' department at MPI, where he has mentored numerous PhD students and postdocs, many of whom now hold academic positions globally.

• Education: Not explicitly detailed in the text, but his career has spanned foundational contributions to computer science.
• Affiliations: Max Planck Institute for Informatics (since its founding), Universität des Saarlandes (honorary), and multiple academic societies.

His research focuses on algorithms, data structures, computational geometry, parallel computing, and algorithmic economics. He pioneered projects like LEDA, a foundational library for efficient algorithms and data structures, influencing tools like CGAL and STXXL. His work bridges algorithm correctness and efficiency, impacting fields from genome sequencing to VLSI design.

Recent articles emphasize fair division (EFX allocations), market equilibria, and algorithmic game theory, reflecting his enduring influence on theoretical and applied computer science.

• Awards: Erasmus Medal (2014), Leibniz Prize, Konrad-Zuse Medal, and honorary doctorates from Magdeburg, Waterloo, and Aarhus.
• Labs/Teams: Leads MPI's Algorithms and Complexity group; collaborates with institutions like DFKI and the Center for IT-Security, Privacy, and Accountability on Saarland's interdisciplinary campus.