Mihalis Yannakakis - Concepedia

Author

Mihalis Yannakakis

AT&T (United States)ORCID

Also Known As

M Yannakakis, M. Yannakakis, MIHALIS YANNAKAKIS, Mihalis Yannakakis, Milhalis Yannakakis, Yannakakis, Mihalis

334

Publications

30.6K

Citations

H-Index

189

Concepts

All Affiliations

AT&T (United States)Nokia (United States)Columbia University University of Edinburgh Stanford University

About

Mihalis Yannakakis is an author at AT&T (United States) specializing in engineering, computer science, and computational complexity.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	68	127	22K
2	Education	15	16	3.5K
3	Business	14	18	1.3K
4	Law	2	2	97
5	Language Studies	1	1	24

Mihalis Yannakakis

166

Publications

27.2K

Citations

H-Index

Page 1

	Year	Citations
Optimization, approximation, and complexity classes Christos H. Papadimitriou, Mihalis Yannakakis Journal of Computer and System Sciences EngineeringComplexity ClassesAnalysis Of AlgorithmComputational ComplexityApproximation Method	1991	1.6K
Principles and methods of testing finite state machines-a survey D. Lee, Mihalis Yannakakis Proceedings of the IEEE EngineeringVerificationModel VerificationFormal VerificationModel-based Testing	1996	1.2K
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs Robert E. Tarjan, Mihalis Yannakakis SIAM Journal on Computing Graph SparsityEngineeringGraph ChordalityNetwork AnalysisEducation	1984	1K
On the hardness of approximating minimization problems Carsten Lund, Mihalis Yannakakis Journal of the ACM	1994	882
On the Desirability of Acyclic Database Schemes Catriel Beeri, Ronald Fagin, David Maier, Journal of the ACM	1983	797
On generating all maximal independent sets David S. Johnson, Mihalis Yannakakis, Christos H. Papadimitriou Information Processing Letters Mathematical ProgrammingEngineeringCombinatorial DesignExtremal Set TheoryExtremal Combinatorics	1988	760
How easy is local search? David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis Journal of Computer and System Sciences Search TechnologyLocal SearchEngineeringInformation RetrievalSearch Technique	1988	707
Computing the Minimum Fill-In is NP-Complete Mihalis Yannakakis SIAM Journal on Algebraic and Discrete Methods Mathematical ProgrammingGraph SparsityGraph ChordalEngineeringPlanar Graph	1981	702
The Complexity of Multiterminal Cuts Elias Dahlhaus, D. S. Johnson, Christos H. Papadimitriou, SIAM Journal on Computing Mathematical ProgrammingComputational Complexity TheoryEngineeringPlanar GraphComputational Complexity	1994	659
The complexity of probabilistic verification Costas Courcoubetis, Mihalis Yannakakis Journal of the ACM EngineeringVerificationComputational ComplexityProbabilistic ComputationFormal Verification	1995	555

Page 1