Properties (39)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:physicist
|
| gptkbp:academicAdvisor |
gptkb:Richard_Karp
|
| gptkbp:affiliation |
gptkb:Columbia_University
|
| gptkbp:awards |
Fellow of the IEEE
Fellow_of_the_ACM |
| gptkbp:education |
gptkb:University_of_California,_Berkeley
|
| gptkbp:field |
Computer Science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Mihalis Yannakakis
|
| gptkbp:knownFor |
Algorithmic Game Theory
|
| gptkbp:notableFeature |
gptkb:Mihalis_Yannakakis
|
| gptkbp:publications |
Graph Coloring Problems
Approximation Schemes for NP-Hard Problems On the Complexity of the Steiner Tree Problem Approximation_Algorithms_for_NP-Hard_Problems On_the_Complexity_of_the_Traveling_Salesman_Problem Computational_Complexity_of_Graph_Problems On_the_Complexity_of_the_Knapsack_Problem On_the_Complexity_of_the_Maximum_Clique_Problem On_the_Complexity_of_the_Maximum_Flow_Problem On_the_Complexity_of_the_Maximum_Matching_Problem On_the_Complexity_of_the_Minimum_Cut_Problem The_Complexity_of_the_Dominating_Set_Problem The_Complexity_of_the_Feedback_Vertex_Set_Problem The_Complexity_of_the_Maximum_Cut_Problem The_Complexity_of_the_Minimum_Bisection_Problem The_Complexity_of_the_Minimum_Cut_Problem The_Complexity_of_the_Minimum_Steiner_Tree_Problem The_Complexity_of_the_Minimum_Vertex_Cover_Problem The_Complexity_of_the_Set_Cover_Problem The_Complexity_of_the_Vertex_Cover_Problem The_Complexity_of_the_Minimum_Feedback_Arc_Set_Problem On_the_Complexity_of_the_Minimum_Feedback_Arc_Set_Problem On_the_Complexity_of_the_Minimum_Dominating_Set_Problem The_Complexity_of_the_Minimum_Spanning_Tree_Problem On_the_Complexity_of_the_Maximum_Independent_Set_Problem |
| gptkbp:researchInterest |
Artificial Intelligence
Optimization Computational Complexity Graph Theory |