Node- and Edge-Deletion NP-Complete Problems - Mihalis Yannakakis (STOC, 1978)

Equivalence among Relational Expressions with the Union and Difference Operation. - Yehoshua Sagiv; Mihalis Yannakakis (VLDB, 1978)

Modeling Communications Protocols by Automata - Alfred V. Aho; Jeffrey D. Ullman; Mihalis Yannakakis (FOCS, 1979)

Locking Policies: Safety and Freedom from Deadlock - Mihalis Yannakakis; Christos H. Papadimitriou; H. T. Kung 001 (FOCS, 1979)

The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract). - Christos H. Papadimitriou; Mihalis Yannakakis (ICALP, 1979)

The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems. - Mihalis Yannakakis (J. ACM, 1979)

Scheduling Interval-Ordered Tasks. - Christos H. Papadimitriou; Mihalis Yannakakis (SIAM J. Comput., 1979)

Topological Characterization of Families of Graphs Generated by Certain Types of Graph Grammars - Mihalis Yannakakis; Theodosios Pavlidis (Inf. Control., 1979)

Algebraic Dependencies (Extended Abstract) - Mihalis Yannakakis; Christos H. Papadimitriou (FOCS, 1980)

Testing the Universal Instance Assumption. - Peter Honeyman; Richard E. Ladner; Mihalis Yannakakis (Inf. Process. Lett., 1980)

Equivalences Among Relational Expressions with the Union and Difference Operators. - Yehoshua Sagiv; Mihalis Yannakakis (J. ACM, 1980)

The Node-Deletion Problem for Hereditary Properties is NP-Complete. - John M. Lewis; Mihalis Yannakakis (J. Comput. Syst. Sci., 1980)

Worst-Case Ratios for Planar Graphs and the Method of Induction on Faces (Extended Abstract) - Christos H. Papadimitriou; Mihalis Yannakakis (FOCS, 1981)

Properties of Acyclic Database Schemes - Catriel Beeri; Ronald Fagin; David Maier 001; Alberto O. Mendelzon; Jeffrey D. Ullman; Mihalis Yannakakis (STOC, 1981)

Issues of Correctness in Database Concurrency Control by Locking - Mihalis Yannakakis (STOC, 1981)

Algorithms for Acyclic Database Schemes - Mihalis Yannakakis (VLDB, 1981)

The Complexity of Testing Whether a Graph is a Superconcentrator. - Manuel Blum 001; Richard M. Karp; Oliver Vornberger; Christos H. Papadimitriou; Mihalis Yannakakis (Inf. Process. Lett., 1981)

On Minimal Eulerian Graphs. - Christos H. Papadimitriou; Mihalis Yannakakis (Inf. Process. Lett., 1981)

The Clique Problem for Planar Graphs. - Christos H. Papadimitriou; Mihalis Yannakakis (Inf. Process. Lett., 1981)

On the Complexity of Testing Implications of Functional and Join Dependencies. - David Maier 001; Yehoshua Sagiv; Mihalis Yannakakis (J. ACM, 1981)

Edge-Deletion Problems. - Mihalis Yannakakis (SIAM J. Comput., 1981)

Node-Deletion Problems on Bipartite Graphs. - Mihalis Yannakakis (SIAM J. Comput., 1981)

The complexity of restricted spanning tree problems. - Christos H. Papadimitriou; Mihalis Yannakakis (J. ACM, 1982)

A Theory of Safe Locking Policies in Database Systems. - Mihalis Yannakakis (J. ACM, 1982)

Algebraic Dependencies. - Mihalis Yannakakis; Christos H. Papadimitriou (J. Comput. Syst. Sci., 1982)

Freedom from Deadlock of Safe Locking Policies. - Mihalis Yannakakis (SIAM J. Comput., 1982)

A Polynomial Algorithm for the Min Cut Linear Arrangement of Trees (Extended Abstract) - Mihalis Yannakakis (FOCS, 1983)

Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract). - Mihalis Yannakakis; Paris C. Kanellakis; Stavros S. Cosmadakis; Christos H. Papadimitriou (ICALP, 1983)

On Notions of Information Transfer in VLSI Circuits - Alfred V. Aho; Jeffrey D. Ullman; Mihalis Yannakakis (STOC, 1983)

Tools for Template Dependencies. - Ronald Fagin; David Maier 001; Jeffrey D. Ullman; Mihalis Yannakakis (SIAM J. Comput., 1983)

On the Desirability of Acyclic Database Schemes - Catriel Beeri; Ronald Fagin; David Maier 001; Mihalis Yannakakis (J. ACM, 1983)

On Monotone Formulae with Restricted Depth (Preliminary Version) - Maria M. Klawe; Wolfgang J. Paul; Nicholas Pippenger; Mihalis Yannakakis (STOC, 1984)

Serializability by Locking. - Mihalis Yannakakis (J. ACM, 1984)

Independent Database Schemas. - Marc H. Graham; Mihalis Yannakakis (J. Comput. Syst. Sci., 1984)

The Complexity of Facets (and Some Facets of Complexity). - Christos H. Papadimitriou; Mihalis Yannakakis (J. Comput. Syst. Sci., 1984)

Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum. - Edward G. Coffman Jr.; Mihalis Yannakakis (Math. Oper. Res., 1984)

Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. - Robert Endre Tarjan; Mihalis Yannakakis (SIAM J. Comput., 1984)

How Easy Is Local Search? (Extended Abstract) - David S. Johnson 001; Christos H. Papadimitriou; Mihalis Yannakakis (FOCS, 1985)

On a Class of Totally Unimodular Matrices. - Mihalis Yannakakis (Math. Oper. Res., 1985)

Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. - Robert Endre Tarjan; Mihalis Yannakakis (SIAM J. Comput., 1985)

A Polynomial Algorithm for the Min-Cut Linear Arrangement of Trees - Mihalis Yannakakis (J. ACM, 1985)

Linear and Book Embeddings of Graphs. - Mihalis Yannakakis (Aegean Workshop on Computing, 1986)

Four Pages are Necessary and Sufficient for Planar Graphs (Extended Abstract) - Mihalis Yannakakis (STOC, 1986)

Querying Weak Instances. - Mihalis Yannakakis (Adv. Comput. Res., 1986)

Deadlock-Freedom (and Safety) of Transactions in a Distributed Database. - Ouri Wolfson; Mihalis Yannakakis (J. Comput. Syst. Sci., 1986)

A Note on Succinct Representations of Graphs - Christos H. Papadimitriou; Mihalis Yannakakis (Inf. Control., 1986)

The Maximum k-Colorable Subgraph Problem for Chordal Graphs. - Mihalis Yannakakis; Fanica Gavril (Inf. Process. Lett., 1987)

The Complexity of Reliable Concurrency Control. - Christos H. Papadimitriou; Mihalis Yannakakis (SIAM J. Comput., 1987)

Verifying Temporal Properties of Finite-State Probabilistic Programs - Costas Courcoubetis; Mihalis Yannakakis (FOCS, 1988)

Optimization, Approximation, and Complexity Classes (Extended Abstract) - Christos H. Papadimitriou; Mihalis Yannakakis (STOC, 1988)

Towards an Architecture-Independent Analysis of Parallel Algorithms (Extended Abstract) - Christos H. Papadimitriou; Mihalis Yannakakis (STOC, 1988)

Expressing Combinatorial Optimization Problems by Linear Programs (Extended Abstract) - Mihalis Yannakakis (STOC, 1988)

On Generating All Maximal Independent Sets. - David S. Johnson 001; Christos H. Papadimitriou; Mihalis Yannakakis (Inf. Process. Lett., 1988)

How Easy is Local Search? - David S. Johnson 001; Christos H. Papadimitriou; Mihalis Yannakakis (J. Comput. Syst. Sci., 1988)

Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs. - Vijay V. Vazirani; Mihalis Yannakakis (Discret. Appl. Math., 1989)

Optimal Scheduling of Products with Two Subassemblies on a Single Machine. - Edward G. Coffman Jr.; Ardavan Nozari; Mihalis Yannakakis (Oper. Res., 1989)

Deleting Completed Transactions. - Thanasis Hadzilacos; Mihalis Yannakakis (J. Comput. Syst. Sci., 1989)

Embedding Planar Graphs in Four Pages. - Mihalis Yannakakis (J. Comput. Syst. Sci., 1989)

Markov Decision Processes and Regular Events (Extended Abstract). - Costas Courcoubetis; Mihalis Yannakakis (ICALP, 1990)

Graph-Theoretic Methods in Database Theory. - Mihalis Yannakakis (PODS, 1990)

The Analysis of Local Search Problems and Their Heuristics. - Mihalis Yannakakis (STACS, 1990)

On the Complexity of Local Search (Extended Abstract) - Christos H. Papadimitriou; Alejandro A. Schäffer; Mihalis Yannakakis (STOC, 1990)

On recognizing integer polyhedra. - Christos H. Papadimitriou; Mihalis Yannakakis (Comb., 1990)

Towards an Architecture-Independent Analysis of Parallel Algorithms. - Christos H. Papadimitriou; Mihalis Yannakakis (SIAM J. Comput., 1990)

On the Value of Information in Distributed Decision-Making (Extended Abstract). - Christos H. Papadimitriou; Mihalis Yannakakis (PODC, 1991)

Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study - Edward G. Coffman Jr.; Costas Courcoubetis; M. R. Garey; David S. Johnson 001; Lyle A. McGeoch; Peter W. Shor; Richard R. Weber 003; Mihalis Yannakakis (STOC, 1991)

Testing Finite State Machines (Extended Abstract) - Mihalis Yannakakis; David Lee 001 (STOC, 1991)

The Input/Output Complexity of Transitive Closure. - Jeffrey D. Ullman; Mihalis Yannakakis (Ann. Math. Artif. Intell., 1991)

Modularity of Cycles and Paths in Graphs. - Esther M. Arkin; Christos H. Papadimitriou; Mihalis Yannakakis (J. ACM, 1991)

Optimization, Approximation, and Complexity Classes. - Christos H. Papadimitriou; Mihalis Yannakakis (J. Comput. Syst. Sci., 1991)

Expressing Combinatorial Optimization Problems by Linear Programs. - Mihalis Yannakakis (J. Comput. Syst. Sci., 1991)

Simple Local Search Problems That are Hard to Solve. - Alejandro A. Schäffer; Mihalis Yannakakis (SIAM J. Comput., 1991)

High-Probability Parallel Transitive-Closure Algorithms. - Jeffrey D. Ullman; Mihalis Yannakakis (SIAM J. Comput., 1991)

Shortest Paths Without a Map. - Christos H. Papadimitriou; Mihalis Yannakakis (Theor. Comput. Sci., 1991)

Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract). - Vijay V. Vazirani; Mihalis Yannakakis (ICALP, 1992)

The Complexity of Multiway Cuts (Extended Abstract) - Elias Dahlhaus; David S. Johnson 001; Christos H. Papadimitriou; Paul D. Seymour; Mihalis Yannakakis (STOC, 1992)

Online Minimization of Transition Systems (Extended Abstract) - David Lee 001; Mihalis Yannakakis (STOC, 1992)

Memory-Efficient Algorithms for the Verification of Temporal Properties. - Costas Courcoubetis; Moshe Y. Vardi; Pierre Wolper; Mihalis Yannakakis (Formal Methods Syst. Des., 1992)

Minimum and Maximum Delay Problems in Real-Time Systems. - Costas Courcoubetis; Mihalis Yannakakis (Formal Methods Syst. Des., 1992)

On Limited Nondeterminism and the Complexity of the V.C Dimension (Extended Abstract). - Christos H. Papadimitriou; Mihalis Yannakakis (SCT, 1993)

Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover. - Naveen Garg 001; Vijay V. Vazirani; Mihalis Yannakakis (ICALP, 1993)

The Approximation of Maximum Subgraph Problems. - Carsten Lund; Mihalis Yannakakis (ICALP, 1993)

Recent Developments on the Approximability of Combinatorial Problems. - Mihalis Yannakakis (ISAAC, 1993)

Linear programming without the matrix. - Christos H. Papadimitriou; Mihalis Yannakakis (STOC, 1993)

Computing the Throughput of a Network with Dedicated Lines. - Christos H. Papadimitriou; Paolo Serafini; Mihalis Yannakakis (Discret. Appl. Math., 1993)

The Traveling Salesman Problem with Distances One and Two. - Christos H. Papadimitriou; Mihalis Yannakakis (Math. Oper. Res., 1993)

Some Open Problems in Approximation. - Mihalis Yannakakis (CIAC, 1994)

Multiway Cuts in Directed and Node Weighted Graphs. - Naveen Garg 001; Vijay V. Vazirani; Mihalis Yannakakis (ICALP, 1994)

On complexity as bounded rationality (extended abstract). - Christos H. Papadimitriou; Mihalis Yannakakis (STOC, 1994)

Linear Approximation of Shortest Superstrings. - Avrim Blum; Tao Jiang 001; Ming Li 001; John Tromp; Mihalis Yannakakis (J. ACM, 1994)

On the Hardness of Approximating Minimization Problems. - Carsten Lund; Mihalis Yannakakis (J. ACM, 1994)

On the Approximation of Maximum Satisfiability. - Mihalis Yannakakis (J. Algorithms, 1994)

The Complexity of Multiterminal Cuts. - Elias Dahlhaus; David S. Johnson 001; Christos H. Papadimitriou; Paul D. Seymour; Mihalis Yannakakis (SIAM J. Comput., 1994)

Testing Finite-State Machines: State Identification and Verification. - David Lee 001; Mihalis Yannakakis (IEEE Trans. Computers, 1994)

Distinguishing tests for nondeterministic and probabilistic machines. - Rajeev Alur; Costas Courcoubetis; Mihalis Yannakakis (STOC, 1995)

The Complexity of Probabilistic Verification. - Costas Courcoubetis; Mihalis Yannakakis (J. ACM, 1995)

On Datalog vs. Polynomial Time. - Foto N. Afrati; Stavros S. Cosmadakis; Mihalis Yannakakis (J. Comput. Syst. Sci., 1995)

Testing Finite State Machines: Fault Detection. - Mihalis Yannakakis; David Lee 001 (J. Comput. Syst. Sci., 1995)

Timing Verification by Successive Approximation - Rajeev Alur; Alon Itai; Robert P. Kurshan; Mihalis Yannakakis (Inf. Comput., 1995)

On nested depth first search. - Gerard J. Holzmann; Doron A. Peled; Mihalis Yannakakis (The Spin Verification System, 1996)

Searching a Fixed Graph. - Elias Koutsoupias; Christos H. Papadimitriou; Mihalis Yannakakis (ICALP, 1996)

Optimization problems from feature testing of communication protocols. - David Lee 001; Mihalis Yannakakis (ICNP, 1996)

On Limited Nondeterminism and the Complexity of the V-C Dimension. - Christos H. Papadimitriou; Mihalis Yannakakis (J. Comput. Syst. Sci., 1996)

Principles and methods of testing finite state machines-a survey. - David Lee 001; Mihalis Yannakakis (Proc. IEEE, 1996)

Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications. - Naveen Garg 001; Vijay V. Vazirani; Mihalis Yannakakis (SIAM J. Comput., 1996)

Perspectives on database theory. - Mihalis Yannakakis (SIGACT News, 1996)

Existence of Reduction Hierarchies. - Orna Kupferman; Robert P. Kurshan; Mihalis Yannakakis (CSL, 1997)

Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees. - Naveen Garg 001; Vijay V. Vazirani; Mihalis Yannakakis (Algorithmica, 1997)

An Efficient Algorithm for Minimizing Real-Time Transition Systems. - Mihalis Yannakakis; David Lee 001 (Formal Methods Syst. Des., 1997)

Tie-Breaking Semantics and Structural Totality. - Christos H. Papadimitriou; Mihalis Yannakakis (J. Comput. Syst. Sci., 1997)

Testing for Finite State Systems. - Mihalis Yannakakis; David Lee 001 (CSL, 1998)

Protocol Feature Interactions. - Thomas F. La Porta; David Lee 001; Yow-Jian Lin; Mihalis Yannakakis (FORTE, 1998)

On the complexity of protein folding (abstract). - Pierluigi Crescenzi; Deborah Goldman; Christos H. Papadimitriou; Antonio Piccolboni; Mihalis Yannakakis (RECOMB, 1998)

On the Complexity of Protein Folding (Extended Abstract). - Pierluigi Crescenzi; Deborah Goldman; Christos H. Papadimitriou; Antonio Piccolboni; Mihalis Yannakakis (STOC, 1998)

On the Complexity of Protein Folding. - Pierluigi Crescenzi; Deborah Goldman; Christos H. Papadimitriou; Antonio Piccolboni; Mihalis Yannakakis (J. Comput. Biol., 1998)

Markov decision processes and regular events. - Costas Courcoubetis; Mihalis Yannakakis (IEEE Trans. Autom. Control., 1998)

Model Checking of Message Sequence Charts. - Rajeev Alur; Mihalis Yannakakis (CONCUR, 1999)

Communicating Hierarchical State Machines. - Rajeev Alur; Sampath Kannan; Mihalis Yannakakis (ICALP, 1999)

A Convex Relaxation for the Asymmetric TSP. - Santosh S. Vempala; Mihalis Yannakakis (SODA, 1999)

On the Complexity of Database Queries. - Christos H. Papadimitriou; Mihalis Yannakakis (J. Comput. Syst. Sci., 1999)

On the Approximability of Trade-offs and Optimal Access of Web Sources. - Christos H. Papadimitriou; Mihalis Yannakakis (FOCS, 2000)

From Rule-based to Automata-based Testing. - Kousha Etessami; Mihalis Yannakakis (FORTE, 2000)

Hierarchical State Machines. - Mihalis Yannakakis (IFIP TCS, 2000)

Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings. - Edward G. Coffman Jr.; Costas Courcoubetis; M. R. Garey; David S. Johnson 001; Peter W. Shor; Richard R. Weber 003; Mihalis Yannakakis (SIAM J. Discret. Math., 2000)

Reminiscences on Influential Papers. - Kenneth A. Ross; Charu C. Aggarwal; Alfons Kemper; Sunita Sarawagi; S. Sudarshan 001; Mihalis Yannakakis (SIGMOD Rec., 2000)

Analysis of Recursive State Machines. - Rajeev Alur; Kousha Etessami; Mihalis Yannakakis (CAV, 2001)

Multiobjective Query Optimization. - Christos H. Papadimitriou; Mihalis Yannakakis (PODS, 2001)

Approximation of Multiobjective Optimization Problems. - Mihalis Yannakakis (WADS, 2001)

Model checking of hierarchical state machines. - Rajeev Alur; Mihalis Yannakakis (ACM Trans. Program. Lang. Syst., 2001)

AMC: An Adaptive Model Checker. - Alex Groce; Doron A. Peled; Mihalis Yannakakis (CAV, 2002)

Testing and Checking of Finite State Systems. - Mihalis Yannakakis (LATIN, 2002)

Black Box Checking. - Doron A. Peled; Moshe Y. Vardi; Mihalis Yannakakis (J. Autom. Lang. Comb., 2002)

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing. - Edward G. Coffman Jr.; Costas Courcoubetis; Michael R. Garey; David S. Johnson 001; Peter W. Shor; Richard R. Weber 003; Mihalis Yannakakis (SIAM Rev., 2002)

Closed Partition Lattice and Machine Decomposition. - David Lee 001; Mihalis Yannakakis (IEEE Trans. Computers, 2002)

Compression of Partially Ordered Strings. - Rajeev Alur; Swarat Chaudhuri; Kousha Etessami; Sudipto Guha; Mihalis Yannakakis (CONCUR, 2003)

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. - Venkatesan Guruswami; Sanjeev Khanna; Rajmohan Rajaraman; F. Bruce Shepherd; Mihalis Yannakakis (J. Comput. Syst. Sci., 2003)

Inference of Message Sequence Charts. - Rajeev Alur; Kousha Etessami; Mihalis Yannakakis (IEEE Trans. Software Eng., 2003)

Testing, Optimizaton, and Games. - Mihalis Yannakakis (LICS, 2004)

Protocol System Integration, Interface and Interoperability. - David Lee 001; Christine Liu; Mihalis Yannakakis (OPODIS, 2004)

Multiway cuts in node weighted graphs. - Naveen Garg 001; Vijay V. Vazirani; Mihalis Yannakakis (J. Algorithms, 2004)

Guest Editors' foreword. - Sampath Kannan; Mihalis Yannakakis (J. Comput. Syst. Sci., 2004)

Probability and Recursion. - Kousha Etessami; Mihalis Yannakakis (ISAAC, 2005)

Checking LTL Properties of Recursive Markov Chains. - Mihalis Yannakakis; Kousha Etessami (QEST, 2005)

Testing hierarchical systems. - Damon Mosk-Aoyama; Mihalis Yannakakis (SODA, 2005)

Algorithmic Verification of Recursive Probabilistic State Machines. - Kousha Etessami; Mihalis Yannakakis (TACAS, 2005)

Realizability and verification of MSC graphs. - Rajeev Alur; Kousha Etessami; Mihalis Yannakakis (Theor. Comput. Sci., 2005)

Efficiently computing succinct trade-off curves. - Sergei Vassilvitskii; Mihalis Yannakakis (Theor. Comput. Sci., 2005)

Analysis of recursive state machines. - Rajeev Alur; Michael Benedikt; Kousha Etessami; Patrice Godefroid; Thomas W. Reps; Mihalis Yannakakis (ACM Trans. Program. Lang. Syst., 2005)

Analysis of Recursive Probabilistic Models. - Mihalis Yannakakis (ATVA, 2006)

Recursion and Probability. - Mihalis Yannakakis (IFIP TCS, 2006)

A note on broadcast encryption key management with applications to large scale emergency alert systems. - Guoqiang Shu; David Lee 001; Mihalis Yannakakis (IPDPS, 2006)

Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games. - Kousha Etessami; Mihalis Yannakakis (STACS, 2006)

Succinct Approximation of Trade-Off Curves. - Mihalis Yannakakis (WINE, 2006)

Adaptive Model Checking. - Alex Groce; Doron A. Peled; Mihalis Yannakakis (Log. J. IGPL, 2006)

Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems. - Ilias Diakonikolas; Mihalis Yannakakis (APPROX-RANDOM, 2007)

On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract). - Kousha Etessami; Mihalis Yannakakis (FOCS, 2007)

Succinct approximate convex pareto curves. - Ilias Diakonikolas; Mihalis Yannakakis (SODA, 2008)

Automata, Probability, and Recursion. - Mihalis Yannakakis (CIAA, 2008)

Multi-Objective Model Checking of Markov Decision Processes. - Kousha Etessami; Marta Z. Kwiatkowska; Moshe Y. Vardi; Mihalis Yannakakis (Log. Methods Comput. Sci., 2008)

Recursive Concurrent Stochastic Games. - Kousha Etessami; Mihalis Yannakakis (Log. Methods Comput. Sci., 2008)

Computational Aspects of Equilibria. - Mihalis Yannakakis (SAGT, 2009)

Equilibria, fixed points, and complexity classes. - Mihalis Yannakakis (Comput. Sci. Rev., 2009)

Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. - Kousha Etessami; Mihalis Yannakakis (J. ACM, 2009)

Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems. - Ilias Diakonikolas; Mihalis Yannakakis (SIAM J. Comput., 2009)

Computation of Equilibria and Stable Solutions. - Mihalis Yannakakis (SSS, 2010)

Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. - Kousha Etessami; Dominik Wojtczak; Mihalis Yannakakis (Perform. Evaluation, 2010)

An impossibility theorem for price-adjustment mechanisms. - Christos H. Papadimitriou; Mihalis Yannakakis (Proc. Natl. Acad. Sci. USA, 2010)

On the Complexity of Nash Equilibria and Other Fixed Points. - Kousha Etessami; Mihalis Yannakakis (SIAM J. Comput., 2010)

Temporal Synthesis for Bounded Systems and Environments. - Orna Kupferman; Yoad Lustig; Moshe Y. Vardi; Mihalis Yannakakis (STACS, 2011)

Market equilibrium under separable, piecewise-linear, concave utilities. - Vijay V. Vazirani; Mihalis Yannakakis (J. ACM, 2011)

Computation of Least Fixed Points. - Mihalis Yannakakis (MFCS, 2012)

Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars. - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (STOC, 2012)

Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (CoRR, 2012)

Model Checking of Recursive Probabilistic Systems. - Kousha Etessami; Mihalis Yannakakis (ACM Trans. Comput. Log., 2012)

Stochastic Context-Free Grammars, Regular Languages, and Newton's Method. - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (ICALP (2), 2013)

Analysis of Boolean Programs. - Patrice Godefroid; Mihalis Yannakakis (TACAS, 2013)

A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing. - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (Electron. Colloquium Comput. Complex., 2013)

The Complexity of Optimal Multidimensional Pricing. - Xi Chen 001; Ilias Diakonikolas; Dimitris Paparas; Xiaorui Sun; Mihalis Yannakakis (SODA, 2014)

On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms. - Xi Chen 001; Ilias Diakonikolas; Anthi Orfanou; Dimitris Paparas; Xiaorui Sun; Mihalis Yannakakis (FOCS, 2015)

Joint Cyber and Physical Attacks on Power Grids: Graph Theoretical Approaches for Information Recovery. - Saleh Soltan; Mihalis Yannakakis; Gil Zussman (SIGMETRICS, 2015)

Recursive Markov Decision Processes and Recursive Stochastic Games. - Kousha Etessami; Mihalis Yannakakis (J. ACM, 2015)

Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata. - Alistair Stewart; Kousha Etessami; Mihalis Yannakakis (J. ACM, 2015)

How Good is the Chord Algorithm? - Constantinos Daskalakis; Ilias Diakonikolas; Mihalis Yannakakis (SIAM J. Comput., 2016)

On the Complexity of Bundle-Pricing and Simple Mechanisms. - Xi Chen 001; George Matikas; Dimitris Paparas; Mihalis Yannakakis (CoRR, 2017)

The Complexity of Non-Monotone Markets. - Xi Chen 001; Dimitris Paparas; Mihalis Yannakakis (J. ACM, 2017)

A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes. - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (SIAM J. Comput., 2017)

Passive Static Equilibrium with Frictional Contacts and Application to Grasp Stability Analysis. - Maximilian Haas-Heger; Christos H. Papadimitriou; Mihalis Yannakakis; Garud Iyengar; Matei T. Ciocarlie (Robotics: Science and Systems, 2018)

On the Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer. - Xi Chen 001; George Matikas; Dimitris Paparas; Mihalis Yannakakis (SODA, 2018)

The complexity of optimal multidimensional pricing for a unit-demand buyer. - Xi Chen 001; Ilias Diakonikolas; Dimitris Paparas; Xiaorui Sun; Mihalis Yannakakis (Games Econ. Behav., 2018)

Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes. - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (Inf. Comput., 2018)

REACT to Cyber-Physical Attacks on Power grids (Extended Abstract). - Saleh Soltan; Mihalis Yannakakis; Gil Zussman (SIGMETRICS Perform. Evaluation Rev., 2018)

Power Grid State Estimation Following a Joint Cyber and Physical Attack. - Saleh Soltan; Mihalis Yannakakis; Gil Zussman (IEEE Trans. Control. Netw. Syst., 2018)

The Complexity of Finding S-Factors in Regular Graphs. - Sanjana Kolisetty; Linh Le; Ilya Volkovich; Mihalis Yannakakis (FSTTCS, 2019)

Reachability for Branching Concurrent Stochastic Games. - Kousha Etessami; Emanuel Martinov; Alistair Stewart; Mihalis Yannakakis (ICALP, 2019)

Fixed Point Computation Problems and Facets of Complexity (Invited Talk). - Mihalis Yannakakis (ICALP, 2019)

Alembic: Automated Model Inference for Stateful Network Functions. - Soo-Jin Moon; Jeffrey Helt; Yifei Yuan; Yves Bieri; Sujata Banerjee; Vyas Sekar; Wenfei Wu; Mihalis Yannakakis; Ying Zhang 022 (NSDI, 2019)

The Complexity of Finding S-factors in Regular Graphs. - Sanjana Kolisetty; Linh Le; Ilya Volkovich; Mihalis Yannakakis (Electron. Colloquium Comput. Complex., 2019)

Recursive stochastic games with positive rewards. - Kousha Etessami; Dominik Wojtczak; Mihalis Yannakakis (Theor. Comput. Sci., 2019)

REACT to Cyber Attacks on Power Grids. - Saleh Soltan; Mihalis Yannakakis; Gil Zussman (IEEE Trans. Netw. Sci. Eng., 2019)

Homa: An Efficient Topology and Route Management Approach in SD-WAN Overlays. - Diman Zad Tootaghaj; Faraz Ahmed; Puneet Sharma; Mihalis Yannakakis (INFOCOM, 2020)

Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria. - Kousha Etessami; Christos H. Papadimitriou; Aviad Rubinstein; Mihalis Yannakakis (ITCS, 2020)

Smoothed complexity of local max-cut and binary max-CSP. - Xi Chen 001; Chenghao Guo; Emmanouil V. Vlatakis-Gkaragkounis; Mihalis Yannakakis; Xinzhi Zhang 002 (STOC, 2020)

Planar graphs that need four pages. - Mihalis Yannakakis (J. Comb. Theory B, 2020)

Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations. - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (Math. Oper. Res., 2020)

Doubly Balanced Connected Graph Partitioning. - Saleh Soltan; Mihalis Yannakakis; Gil Zussman (ACM Trans. Algorithms, 2020)

Epinoia: Intent Checker for Stateful Networks. - Huazhe Wang; Puneet Sharma; Faraz Ahmed; Joon-Myung Kang; Chen Qian 001; Mihalis Yannakakis (ICCCN, 2021)

Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets. - Vijay V. Vazirani; Mihalis Yannakakis (ITCS, 2021)

The Platform Design Problem. - Christos Harilaos Papadimitriou; Kiran Vodrahalli; Mihalis Yannakakis (WINE, 2021)

Computational Hardness of the Hylland-Zeckhauser Scheme. - Thomas Chen; Xi Chen 001; Binghui Peng; Mihalis Yannakakis (SODA, 2022)

Center-Embedding and Constituency in the Brain and a New Characterization of Context-Free Languages. - Daniel Mitropolsky; Adiba Ejaz; Mirah Shi; Mihalis Yannakakis; Christos H. Papadimitriou (CoRR, 2022)

On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer. - Xi Chen 001; Ilias Diakonikolas; Anthi Orfanou; Dimitris Paparas; Xiaorui Sun; Mihalis Yannakakis (SIAM J. Comput., 2022)

Technical Perspective: Structure and Complexity of Bag Consistency. - Mihalis Yannakakis (SIGMOD Rec., 2022)

Extremal Combinatorics, Iterated Pigeonhole Arguments and Generalizations of PPP. - Amol Pasarkar; Christos H. Papadimitriou; Mihalis Yannakakis (ITCS, 2023)

The Smoothed Complexity of Policy Iteration for Markov Decision Processes. - Miranda Christ; Mihalis Yannakakis (STOC, 2023)

Reducing Tarski to Unique Tarski (in the Black-box Model). - Xi Chen 001; Yuhao Li 002; Mihalis Yannakakis (Electron. Colloquium Comput. Complex., 2023)

The Fairness-Quality Tradeoff in Clustering. - Rashida Hakim; Ana-Andreea Stoica; Christos H. Papadimitriou; Mihalis Yannakakis (NeurIPS, 2024)

Smoothed Complexity of SWAP in Local Graph Partitioning. - Xi Chen 001; Chenghao Guo; Emmanouil V. Vlatakis-Gkaragkounis; Mihalis Yannakakis (SODA, 2024)

The Fairness-Quality Trade-off in Clustering. - Rashida Hakim; Ana-Andreea Stoica; Christos H. Papadimitriou; Mihalis Yannakakis (CoRR, 2024)

Computing a Fixed Point of Contraction Maps in Polynomial Queries. - Xi Chen 001; Yuhao Li 002; Mihalis Yannakakis (Electron. Colloquium Comput. Complex., 2024)

Computational Complexity of the Hylland-Zeckhauser Mechanism for One-Sided Matching Markets. - Vijay V. Vazirani; Mihalis Yannakakis (SIAM J. Comput., 2025)