2026 Kurt Mehlhorn: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	86	772	745	28	28	569	28413

Research.com Recognitions

2025 - Research.com Computer Science in Germany Leader Award
2023 - Research.com Computer Science in Germany Leader Award
2022 - Research.com Computer Science in Germany Leader Award
2016 - European Association for Theoretical Computer Science (EATCS) Fellow For his influential contribution to the whole field of algorithmics over the past decades. In addition to key theoretical contributions, he has brought basic research closer to practice
2015 - Member of the National Academy of Sciences
2014 - Member of the National Academy of Engineering For contributions to algorithm design and the development of the LEDA software library.
2010 - ACM Paris Kanellakis Theory and Practice Award For contributions to algorithm engineering by creating the LEDA library for algorithmic problem solving.
2004 - German National Academy of Sciences Leopoldina - Deutsche Akademie der Naturforscher Leopoldina – Nationale Akademie der Wissenschaften Informatics
1999 - ACM Fellow For important contributions in complexity theory and in the design, analysis, and practice of combinatorial and geometric algorithms.
1995 - Member of Academia Europaea
Fellow of the Indian National Academy of Engineering (INAE)
Fellow of the Indian National Academy of Engineering (INAE)
Fellow of the Indian National Academy of Engineering (INAE)

Overview

Kurt Mehlhorn is affiliated with the Max Planck Institute for Informatics in Germany. Their research spans various aspects of computer science, with a particular focus on computational theory, mathematics, and related interdisciplinary fields.

The scientist has contributed extensively to the field of computer science, producing 27 publications mainly in computational theory and mathematics, economics and econometrics, management science and operations research, biomedical engineering, and computer networks and communications.

The main research topics covered in their work include:

Game Theory and Voting Systems
Auction Theory and Applications
Complexity and Algorithms in Graphs
Slime Mold and Myxomycetes Research
Topological and Geometric Data Analysis
Biocrusts and Microbial Ecology
Economic theories and models

They have published frequently in the following venues:

arXiv (Cornell University)
Theoretical Computer Science
Mathematics of Operations Research
Proceedings of the AAAI Conference on Artificial Intelligence
Physical review. E

Notable recent papers include:

EFX Exists for Three Agents, 2023, Journal of the ACM
Maximizing Nash Social Welfare in 2-Value Instances, 2022, Proceedings of the AAAI Conference on Artificial Intelligence
Physarum-inspired multi-commodity flow dynamics, 2022, Theoretical Computer Science
EFX Exists for Three Agents, 2020, arXiv (Cornell University)
Satiation in Fisher Markets and Approximation of Nash Social Welfare, 2023, Mathematics of Operations Research

Their frequent coauthors are Hannaneh Akrami, Golnoosh Shahkarami, Jugal Garg, Frederic Folz, and Giovanna Morigi.

Kurt Mehlhorn has received several awards and distinctions over the course of their career, including:

European Association for Theoretical Computer Science (EATCS) Fellow, 2016, for influential contributions to algorithmics and bridging basic research with practice
Member of the National Academy of Sciences, 2015
Member of the National Academy of Engineering, 2014, for work on algorithm design and the LEDA software library
ACM Paris Kanellakis Theory and Practice Award, 2010, for contributions to algorithm engineering via the LEDA library
Member of the German National Academy of Sciences Leopoldina, 2004
ACM Fellow, 1999, for contributions in complexity theory and combinatorial and geometric algorithms
Member of Academia Europaea, 1995
Fellow of the Indian National Academy of Engineering (INAE)

Best Publications

LEDA: A Platform for Combinatorial and Geometric Computing

Kurt Mehlhorn;Stefan Näher

1990
Citations
Weisfeiler-Lehman Graph Kernels

Nino Shervashidze;Pascal Schweitzer;Erik Jan van Leeuwen;Kurt Mehlhorn

1904
Citations
Data Structures and Algorithms 1: Sorting and Searching

Kurt Mehlhorn

1507
Citations
Faster Algorithms for the Shortest Path Problem

Ravindra K. Ahuja;Kurt Mehlhorn;James Orlin;Robert E. Tarjan

957
Citations
Efficient Graphlet Kernels for Large Graph Comparison

Nino Sherashidze;S. V. N. Vishwanathan;Tobias H. Petri;Kurt Mehlhorn

929
Citations
The LEDA Platform of Combinatorial and Geometric Computing

Kurt Mehlhorn;Stefan Näher;Christian Uhrig

625
Citations
Dynamic Perfect Hashing: Upper and Lower Bounds

Martin Dietzfelbinger;Anna Karlin;Kurt Mehlhorn;Friedhelm Meyer auf der Heide

608
Citations
Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness

Kurt Mehlhorn;Wilfried Brauer;Grzegorz Rozenberg;Arto Salomaa

602
Citations
Algorithms and Data Structures: The Basic Toolbox

Kurt Mehlhorn;Peter Sanders

573
Citations
Data Structures and Algorithms 3 : Multi-dimensional Searching and Computational Geometry

Kurt Mehlhorn

540
Citations
A faster approximation algorithm for the Steiner problem in graphs

Kurt Mehlhorn

465
Citations
Congruence, similarity, and symmetries of geometric objects

H. Alt;K. Mehlhorn;H. Wagener;E. Welzl

352
Citations
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories

Kurt Mehlhorn;Uzi Vishkin

311
Citations
Popular matchings

David J. Abraham;Robert W. Irving;Telikepalli Kavitha;Kurt Mehlhorn

296
Citations
Four results on randomized incremental constructions

Kenneth L. Clarkson;Kurt Mehlhorn;Raimund Seidel

292
Citations
A new data structure for representing sorted lists

Scott Huddleston;Kurt Mehlhorn

279
Citations
Las Vegas Is better than Determinism in VLSI and Distributed Computing

Kurt Mehlhorn;Erik M. Schmidt

274
Citations
Data Structures and Algorithms 1

Kurt Mehlhorn

269
Citations
Classroom examples of robustness problems in geometric computations

Lutz Kettner;Kurt Mehlhorn;Sylvain Pion;Stefan Schirra

258
Citations
Computing a maximum cardinality matching in a bipartite graph in time O n 1.5 m/ log n

H. Alt;N. Blum;K. Mehlhorn;M. Paul

252
Citations
Convergence, Similarity and Symmetries of Geometric Objects

Helmut Alt;Kurt Mehlhorn;Hubert Wagener;Emo Welzl

0
Citations

Frequent Co-Authors

Peter Sanders Karlsruhe Institute of Technology

Michael Kaufmann University of Tübingen

Torben Hagerup University of Augsburg

Emo Welzl ETH Zurich

Dan Halperin Tel Aviv University

Reinhard Wilhelm Saarland University

Robert E. Tarjan Princeton University

Raimund Seidel Saarland University

Franco P. Preparata Brown University

Chee Yap New York University

External Links

Wikipedia of Kurt Mehlhorn Personal website of Kurt Mehlhorn Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Pursuing a degree in Computer Science opens the door to many related fields that offer flexible, online study options. Students interested in data privacy and digital security may consider cybersecurity online degrees to gain in-demand skills for protecting information systems. With threats constantly evolving, cybersecurity experts are needed everywhere.

For those who want to blend technology with practical management, a construction management masters degree online can prepare graduates to supervise complex projects and integrate smart building technologies. The construction industry increasingly relies on tech-savvy leaders to drive efficiency and innovation.

If your interests combine law, technology, and justice, consider a criminal justice degree online. This pathway can lead to careers in cybersecurity law enforcement, digital forensics, and policy planning.

Finally, those with a knack for numbers and analytics may find rewarding roles in finance or auditing with the best online accounting program. As businesses adopt more digital systems, tech-savvy accounting professionals are in high demand.