Mihalis Yannakakis
Mihalis Yannakakis publishes mostly in Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications, on topics such as Formal Methods in Verification, Complexity and Algorithms in Graphs and Advanced Graph Theory Research.
- World rank
- #12,594 of 7,710,434 ranked researchers
- Rank in United States
- #4,384 of 1,627,098
- Works
- 324
- Citations
- 31k
- Citations per work
- 95.6
What does Mihalis Yannakakis research?
Mihalis Yannakakis's work is mostly in Computer Science (69%), Decision Sciences (4%).
Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.
The fields and subfields, with their numbers
- Physical Sciences22569.4%
- Computer Science22569.4%
- Everything else8526.2%
- Social Sciences144.4%
- Decision Sciences144.4%
- 1Computational Theory and Mathematics29% of their works
- 2Artificial Intelligence16% of their works
- 3Computer Networks and Communications16% of their works
- 4Software6% of their works
- 5Management Science and Operations Research4% of their works
- 6Computer Graphics and Computer-Aided Design3% of their works
Research topics
Which keywords describe Mihalis Yannakakis's research?
The keywords of their largest research topics: Approximation Algorithms, Algorithmic Applications, Model Checking, Symbolic Model Checker, Combinatorial Optimization, Complexity Theory, Graph Theory and Parameterized Complexity.
- Mesh Generation
- Data Stream Management
- Software Fault Localization
- Machine Learning
- Online Algorithms
- Parameterized Complexity
- Complexity Theory
- Symbolic Model Checker
- Algorithmic Applications
- Approximation Algorithms
- Model Checking
- Combinatorial Optimization
- Graph Theory
- Mobile Robots
- Active Learning
- Automated Testing
- Continuous Queries
- Delaunay Triangulations
Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.
All 18 words, with their numbers
- Approximation Algorithms1513 topics
- Algorithmic Applications1222 topics
- Model Checking781 topic
- Symbolic Model Checker781 topic
- Combinatorial Optimization621 topic
- Complexity Theory621 topic
- Graph Theory601 topic
- Parameterized Complexity601 topic
- Mobile Robots431 topic
- Online Algorithms431 topic
- Active Learning421 topic
- Machine Learning421 topic
- Automated Testing341 topic
- Software Fault Localization341 topic
- Continuous Queries301 topic
- Data Stream Management301 topic
- Delaunay Triangulations291 topic
- Mesh Generation291 topic
Where does Mihalis Yannakakis work?
Mihalis Yannakakis's main affiliation in the publication record is Columbia University, United States.
How many publications and citations does Mihalis Yannakakis have?
OpenAlex counts 324 works and 30,963 citations for Mihalis Yannakakis, an h-index of 86, ranking #12,594 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.
Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.
Discussion
Ask a question or share a note about Mihalis Yannakakis. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.