World's Best Scientists 2026 revealed!
Award Badge
Computer Science
Germany
2025

D-Index & Metrics

Computer Science

D-Index
86
Citations
28413
World Ranking
772
National Ranking
28

Kurt Mehlhorn publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Kurt Mehlhorn sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 569 publications — 95th percentile

95% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Kurt Mehlhorn D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Kurt Mehlhorn sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 86 D-Index — 95th percentile

95% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

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)
  • 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

  • Weisfeiler-Lehman Graph Kernels

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

  • Data Structures and Algorithms 1: Sorting and Searching

    Kurt Mehlhorn

  • Faster Algorithms for the Shortest Path Problem

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

  • Efficient Graphlet Kernels for Large Graph Comparison

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

  • The LEDA Platform of Combinatorial and Geometric Computing

    Kurt Mehlhorn;Stefan Näher;Christian Uhrig

  • Dynamic Perfect Hashing: Upper and Lower Bounds

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

  • Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness

    Kurt Mehlhorn;Wilfried Brauer;Grzegorz Rozenberg;Arto Salomaa

  • Algorithms and Data Structures: The Basic Toolbox

    Kurt Mehlhorn;Peter Sanders

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

    Kurt Mehlhorn

  • A faster approximation algorithm for the Steiner problem in graphs

    Kurt Mehlhorn

  • Congruence, similarity, and symmetries of geometric objects

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

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

    Kurt Mehlhorn;Uzi Vishkin

  • Popular matchings

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

  • Four results on randomized incremental constructions

    Kenneth L. Clarkson;Kurt Mehlhorn;Raimund Seidel

  • A new data structure for representing sorted lists

    Scott Huddleston;Kurt Mehlhorn

  • Las Vegas Is better than Determinism in VLSI and Distributed Computing

    Kurt Mehlhorn;Erik M. Schmidt

  • Data Structures and Algorithms 1

    Kurt Mehlhorn

  • Classroom examples of robustness problems in geometric computations

    Lutz Kettner;Kurt Mehlhorn;Sylvain Pion;Stefan Schirra

  • 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

  • Convergence, Similarity and Symmetries of Geometric Objects

    Helmut Alt;Kurt Mehlhorn;Hubert Wagener;Emo Welzl

Frequent Co-Authors

Peter Sanders
Peter Sanders Karlsruhe Institute of Technology
Michael Kaufmann
Michael Kaufmann University of Tübingen
Torben Hagerup
Torben Hagerup University of Augsburg
Emo Welzl
Emo Welzl ETH Zurich
Dan Halperin
Dan Halperin Tel Aviv University
Reinhard Wilhelm
Reinhard Wilhelm Saarland University
Robert E. Tarjan
Robert E. Tarjan Princeton University
Raimund Seidel
Raimund Seidel Saarland University
Franco P. Preparata
Franco P. Preparata Brown University
Chee Yap
Chee Yap New York University

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

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

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.

Best Scientists Citing Kurt Mehlhorn

Trending Scientists

Recently Published Articles