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

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