|
gptkbp:instanceOf
|
gptkb:person
|
|
gptkbp:almaMater
|
gptkb:Princeton_University
|
|
gptkbp:award
|
gptkb:ACM_Fellow
gptkb:AAAI_Fellow
gptkb:Knuth_Prize
gptkb:EATCS_Award
|
|
gptkbp:birthYear
|
1953
|
|
gptkbp:citizenship
|
gptkb:Greece
gptkb:United_States
|
|
gptkbp:doctoralAdvisor
|
gptkb:Christos_Papadimitriou
|
|
gptkbp:field
|
gptkb:complexity_theory
theoretical computer science
optimization
graph theory
algorithm design
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Mihalis Yannakakis
|
|
gptkbp:memberOf
|
gptkb:American_Academy_of_Arts_and_Sciences
gptkb:National_Academy_of_Engineering
gptkb:Academy_of_Europe
|
|
gptkbp:nationality
|
gptkb:Greek
|
|
gptkbp:notableWork
|
work on approximation algorithms
work on communication complexity
work on constraint satisfaction problems
work on database theory
Yannakakis’s algorithm for finding maximum matching in bipartite graphs
|
|
gptkbp:occupation
|
gptkb:computer_scientist
|
|
gptkbp:workInstitution
|
gptkb:Bell_Labs
gptkb:Columbia_University
gptkb:Stanford_University
gptkb:University_of_Athens
|
|
gptkbp:bfsParent
|
gptkb:Richard_M._Karp
|
|
gptkbp:bfsLayer
|
4
|