Optimization, approximation, and complexity classes C Papadimitriou, M Yannakakis Proceedings of the twentieth annual ACM symposium on Theory of computing …, 1988 | 2350 | 1988 |

Principles and methods of testing finite state machines-a survey D Lee, M Yannakakis Proceedings of the IEEE 84 (8), 1090-1123, 1996 | 1695 | 1996 |

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs RE Tarjan, M Yannakakis SIAM Journal on computing 13 (3), 566-579, 1984 | 1452 | 1984 |

On the hardness of approximating minimization problems C Lund, M Yannakakis Journal of the ACM (JACM) 41 (5), 960-981, 1994 | 1428 | 1994 |

Computing the minimum fill-in is NP-complete M Yannakakis SIAM Journal on Algebraic Discrete Methods 2 (1), 77-79, 1981 | 1157 | 1981 |

On generating all maximal independent sets DS Johnson, M Yannakakis, CH Papadimitriou Information Processing Letters 27 (3), 119-123, 1988 | 1012 | 1988 |

On the desirability of acyclic database schemes C Beeri, R Fagin, D Maier, M Yannakakis Journal of the ACM (JACM) 30 (3), 479-513, 1983 | 1005 | 1983 |

How easy is local search? DS Johnson, CH Papadimitriou, M Yannakakis Journal of computer and system sciences 37 (1), 79-100, 1988 | 961 | 1988 |

Memory-efficient algorithms for the verification of temporal properties C Courcoubetis, M Vardi, P Wolper, M Yannakakis Formal methods in system design 1, 275-288, 1992 | 862 | 1992 |

The complexity of multiterminal cuts E Dahlhaus, DS Johnson, CH Papadimitriou, PD Seymour, M Yannakakis SIAM Journal on Computing 23 (4), 864-894, 1994 | 841 | 1994 |

The complexity of probabilistic verification C Courcoubetis, M Yannakakis Journal of the ACM (JACM) 42 (4), 857-907, 1995 | 740 | 1995 |

Towards an architecture-independent analysis of parallel algorithms C Papadimitriou, M Yannakakis Proceedings of the twentieth annual ACM symposium on Theory of computing …, 1988 | 679 | 1988 |

Algorithms for acyclic database schemes M Yannakakis VLDB 81, 82-94, 1981 | 671 | 1981 |

Shortest paths without a map CH Papadimitriou, M Yannakakis Theoretical Computer Science 84 (1), 127-150, 1991 | 669 | 1991 |

Node-and edge-deletion NP-complete problems M Yannakakis Proceedings of the tenth annual ACM symposium on Theory of computing, 253-264, 1978 | 650 | 1978 |

Expressing combinatorial optimization problems by linear programs M Yannakakis Proceedings of the twentieth annual ACM symposium on Theory of computing …, 1988 | 648 | 1988 |

On the approximability of trade-offs and optimal access of web sources CH Papadimitriou, M Yannakakis Proceedings 41st annual symposium on foundations of computer science, 86-92, 2000 | 597 | 2000 |

On the complexity of protein folding P Crescenzi, D Goldman, C Papadimitriou, A Piccolboni, M Yannakakis Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998 | 565 | 1998 |

The traveling salesman problem with distances one and two CH Papadimitriou, M Yannakakis Mathematics of Operations Research 18 (1), 1-11, 1993 | 564 | 1993 |

The node-deletion problem for hereditary properties is NP-complete JM Lewis, M Yannakakis Journal of Computer and System Sciences 20 (2), 219-230, 1980 | 556 | 1980 |