World's Best Scientists 2026 revealed!
Mihalis Yannakakis

Mihalis Yannakakis

D-Index & Metrics

Computer Science

D-Index
102
Citations
44170
World Ranking
338
National Ranking
184

Mihalis Yannakakis 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 Mihalis Yannakakis 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: 262 publications — 65th percentile

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

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

Mihalis Yannakakis 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 Mihalis Yannakakis 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: 102 D-Index — 98th percentile

98% 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

  • 2020 - Fellow of the American Academy of Arts and Sciences
  • 2018 - Member of the National Academy of Sciences
  • 2013 - Member of Academia Europaea
  • 2011 - Member of the National Academy of Engineering For contributions to algorithms and computational complexity.
  • 1998 - ACM Fellow For seminal contributions to the foundations of computer science, the principles of database systems, and the links between complexity theory and combinatorial optimization.

Overview

Mihalis Yannakakis is affiliated with Columbia University in the United States. Their research spans several fields within computer science and decision sciences, focusing on theoretical and applied aspects of algorithms and computational complexity.

The scientist's work covers multiple subfields of study, including Management Science and Operations Research, Computational Theory and Mathematics, Economics and Econometrics, Computer Networks and Communications, and Artificial Intelligence.

Mihalis Yannakakis has contributed to a broad range of topics such as:

  • Game Theory and Voting Systems
  • Auction Theory and Applications
  • Game Theory and Applications
  • Advanced Graph Theory Research
  • Data Management and Algorithms
  • Constraint Satisfaction and Optimization
  • Logic, Reasoning, and Knowledge

Frequent coauthors include:

  • Christos H. Papadimitriou
  • Vijay V. Vazirani
  • Xi Chen
  • Tai C. Chen

Their research has been published in a variety of venues, with notable frequency in:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • SIAM Journal on Computing
  • ACM Transactions on Algorithms
  • ACM SIGMOD Record

Recent publications demonstrate a focus on computational complexity and algorithmic game theory:

  • "Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria," 2020, published by Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets," 2020, published by Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets," 2020, published on arXiv (Cornell University)
  • "Doubly Balanced Connected Graph Partitioning," 2020, published in ACM Transactions on Algorithms
  • "On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer," 2022, published in SIAM Journal on Computing

Their achievements include several distinctions such as being named a Fellow of the American Academy of Arts and Sciences in 2020, membership in the National Academy of Sciences since 2018, membership in Academia Europaea starting in 2013, and election to the National Academy of Engineering in 2011 for contributions to algorithms and computational complexity.

Additionally, Mihalis Yannakakis has been recognized as an ACM Fellow since 1998 for work connecting complexity theory, combinatorial optimization, and the principles of database systems.

Best Publications

  • Optimization, approximation, and complexity classes

    Christos H. Papadimitriou;Mihalis Yannakakis

  • Principles and methods of testing finite state machines-a survey

    D. Lee;M. Yannakakis

  • On the hardness of approximating minimization problems

    Carsten Lund;Mihalis Yannakakis

  • Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

    Robert E. Tarjan;Mihalis Yannakakis

  • Computing the Minimum Fill-in is NP^Complete

    Mihalis Yannakakis

  • On generating all maximal independent sets

    David S. Johnson;Christos H. Papadimitriou

  • On the Desirability of Acyclic Database Schemes

    Catriel Beeri;Ronald Fagin;David Maier;Mihalis Yannakakis

  • How easy is local search

    David S. Johnson;Christos H. Papadimitriou;Mihalis Yannakakis

  • The Complexity of Multiterminal Cuts

    E. Dahlhaus;D. S. Johnson;C. H. Papadimitriou;P. D. Seymour

  • Memory Efficient Algorithms for the Verification of Temporal Properties

    Costas Courcoubetis;Moshe Y. Vardi;Pierre Wolper;Mihalis Yannakakis

  • Shortest paths without a map

    Christos H. Papadimitriou;Mihalis Yannakakis

  • Expressing combinatorial optimization problems by Linear Programs

    Mihalis Yannakakis

  • Towards an architecture-independent analysis of parallel algorithms

    Christos H. Papadimitriou;Mihalis Yannakakis

  • The complexity of probabilistic verification

    Costas Courcoubetis;Mihalis Yannakakis

  • The Node-Deletion Problem for Hereditary Properties Is NP-Complete

    John M. Lewis;Mihalis Yannakakis

  • Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations

    Kousha Etessami;Mihalis Yannakakis

  • Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications

    Naveen Garg;Vijay V. Vazirani;Mihalis Yannakakis

  • Node-and edge-deletion NP-complete problems

    Mihalis Yannakakis

  • Algorithms for acyclic database schemes

    Mihalis Yannakakis

  • Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems

    Ilias Diakonikolas;Mihalis Yannakakis

Frequent Co-Authors

Christos H. Papadimitriou
Christos H. Papadimitriou Columbia University
Kousha Etessami
Kousha Etessami University of Edinburgh
Rajeev Alur
Rajeev Alur University of Pennsylvania
Ilias Diakonikolas
Ilias Diakonikolas University of Wisconsin–Madison
Vijay V. Vazirani
Vijay V. Vazirani University of California, Irvine
Xi Chen
Xi Chen Columbia University
Costas Courcoubetis
Costas Courcoubetis Chinese University of Hong Kong, Shenzhen
Jeffrey D. Ullman
Jeffrey D. Ullman Stanford University
Doron Peled
Doron Peled Bar-Ilan University
Gil Zussman
Gil Zussman Columbia 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

Exploring computer science in the USA opens doors to diverse online degree options that suit various interests and career ambitions. One of the most important factors when researching your options is ensuring your chosen program is online degree programs accredited. Accreditation ensures your degree is recognized by employers and meets academic standards.

For those passionate about gaming and design, a masters in game design online can help develop skills in both creative and technical areas, paving the way for careers in the fast-growing video game industry. If you are more interested in digital safety and security, an online cybersecurity degree offers practical training for roles in protecting networks and data.

Additionally, if you're inclined towards the construction and management sector, a bachelors construction management can position you for leadership roles in building and project supervision. Each of these pathways shows the wide range of specialized online degrees that can expand your tech-focused career possibilities.

Best Scientists Citing Mihalis Yannakakis

Trending Scientists

Recently Published Articles