Mihalis Yannakakis

301 papers A* 94A 15B 16C 6Misc 1Journal 149Unranked 20

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Fair Data-Exchange Mechanisms. CoRR Rashida Hakim, Christos H. Papadimitriou, Mihalis Yannakakis
2026	J	`jnl`	Quadratic Speedup for Computing Contraction Fixed Points. CoRR Xi Chen, Yuhao Li, Mihalis Yannakakis
2026	J	`jnl`	Reducing Tarski to Unique Tarski (In the Black-Box Model). SIAM J. Comput. Xi Chen, Yuhao Li, Mihalis Yannakakis
2025	J	`jnl`	Computational Complexity of the Hylland-Zeckhauser Mechanism for One-Sided Matching Markets. SIAM J. Comput. Vijay V. Vazirani, Mihalis Yannakakis
2025	J	`jnl`	Computing a Fixed Point of Contraction Maps in Polynomial Queries. J. ACM Xi Chen, Yuhao Li, Mihalis Yannakakis
2024	A*	`conf`	Computing a Fixed Point of Contraction Maps in Polynomial Queries. STOC Xi Chen, Yuhao Li, Mihalis Yannakakis
2024	J	`jnl`	Computing a Fixed Point of Contraction Maps in Polynomial Queries. CoRR Xi Chen, Yuhao Li, Mihalis Yannakakis
2024	J	`jnl`	Computing a Fixed Point of Contraction Maps in Polynomial Queries. Electron. Colloquium Comput. Complex. Xi Chen, Yuhao Li, Mihalis Yannakakis
2024	A*	`conf`	Smoothed Complexity of SWAP in Local Graph Partitioning. SODA Xi Chen, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis
2024	J	`jnl`	The Fairness-Quality Trade-off in Clustering. CoRR Rashida Hakim, Ana-Andreea Stoica, Christos H. Papadimitriou, Mihalis Yannakakis
2024	A*	`conf`	The Fairness-Quality Tradeoff in Clustering. NeurIPS Rashida Hakim, Ana-Andreea Stoica, Christos H. Papadimitriou, Mihalis Yannakakis
2023	A	`conf`	Extremal Combinatorics, Iterated Pigeonhole Arguments and Generalizations of PPP. ITCS Amol Pasarkar, Christos H. Papadimitriou, Mihalis Yannakakis
2023	A	`conf`	Reducing Tarski to Unique Tarski (In the Black-Box Model). CCC Xi Chen, Yuhao Li, Mihalis Yannakakis
2023	J	`jnl`	Reducing Tarski to Unique Tarski (in the Black-box Model). Electron. Colloquium Comput. Complex. Xi Chen, Yuhao Li, Mihalis Yannakakis
2023	J	`jnl`	Smoothed Complexity of SWAP in Local Graph Partitioning. CoRR Xi Chen, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis
2023	A*	`conf`	The Smoothed Complexity of Policy Iteration for Markov Decision Processes. STOC Miranda Christ, Mihalis Yannakakis
2022	J	`jnl`	Center-Embedding and Constituency in the Brain and a New Characterization of Context-Free Languages. CoRR Daniel Mitropolsky, Adiba Ejaz, Mirah Shi, Mihalis Yannakakis, Christos H. Papadimitriou
2022	A*	`conf`	Computational Hardness of the Hylland-Zeckhauser Scheme. SODA Thomas Chen, Xi Chen, Binghui Peng, Mihalis Yannakakis
2022	J	`jnl`	Extremal combinatorics, iterated pigeonhole arguments, and generalizations of PPP. CoRR Amol Pasarkar, Mihalis Yannakakis, Christos H. Papadimitriou
2022	J	`jnl`	On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer. SIAM J. Comput. Xi Chen, Ilias Diakonikolas, Anthi Orfanou, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis
2022	J	`jnl`	Technical Perspective: Structure and Complexity of Bag Consistency. SIGMOD Rec. Mihalis Yannakakis
2022	J	`jnl`	The Smoothed Complexity of Policy Iteration for Markov Decision Processes. CoRR Miranda Christ, Mihalis Yannakakis
2021	A	`conf`	Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets. ITCS Vijay V. Vazirani, Mihalis Yannakakis
2021	J	`jnl`	Computational Hardness of the Hylland-Zeckhauser Scheme. CoRR Thomas Chen, Xi Chen, Binghui Peng, Mihalis Yannakakis
2021	B	`conf`	Epinoia: Intent Checker for Stateful Networks. ICCCN Huazhe Wang, Puneet Sharma, Faraz Ahmed, Joon-Myung Kang, Chen Qian, Mihalis Yannakakis
2021	—	`conf`	The Platform Design Problem. WINE Christos Harilaos Papadimitriou, Kiran Vodrahalli, Mihalis Yannakakis
2020	J	`jnl`	Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets. CoRR Vijay V. Vazirani, Mihalis Yannakakis
2020	J	`jnl`	Doubly Balanced Connected Graph Partitioning. ACM Trans. Algorithms Saleh Soltan, Mihalis Yannakakis, Gil Zussman
2020	A*	`conf`	Homa: An Efficient Topology and Route Management Approach in SD-WAN Overlays. INFOCOM Diman Zad Tootaghaj, Faraz Ahmed, Puneet Sharma, Mihalis Yannakakis
2020	J	`jnl`	Planar Graphs that Need Four Pages. CoRR Mihalis Yannakakis
2020	J	`jnl`	Planar graphs that need four pages. J. Comb. Theory B Mihalis Yannakakis
2020	J	`jnl`	Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations. Math. Oper. Res. Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
2020	A*	`conf`	Smoothed complexity of local max-cut and binary max-CSP. STOC Xi Chen, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis, Xinzhi Zhang
2020	A	`conf`	Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria. ITCS Kousha Etessami, Christos H. Papadimitriou, Aviad Rubinstein, Mihalis Yannakakis
2020	J	`jnl`	The Platform Design Problem. CoRR Christos H. Papadimitriou, Kiran Vodrahalli, Mihalis Yannakakis
2019	Misc	`conf`	Alembic: Automated Model Inference for Stateful Network Functions. NSDI Soo-Jin Moon, Jeffrey Helt, Yifei Yuan, Yves Bieri, Sujata Banerjee, Vyas Sekar, Wenfei Wu, Mihalis Yannakakis, Ying Zhang
2019	A*	`conf`	Fixed Point Computation Problems and Facets of Complexity (Invited Talk). ICALP Mihalis Yannakakis
2019	J	`jnl`	REACT to Cyber Attacks on Power Grids. IEEE Trans. Netw. Sci. Eng. Saleh Soltan, Mihalis Yannakakis, Gil Zussman
2019	A*	`conf`	Reachability for Branching Concurrent Stochastic Games. ICALP Kousha Etessami, Emanuel Martinov, Alistair Stewart, Mihalis Yannakakis
2019	J	`jnl`	Recursive stochastic games with positive rewards. Theor. Comput. Sci. Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis
2019	J	`jnl`	Smoothed complexity of local Max-Cut and binary Max-CSP. CoRR Xi Chen, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis, Xinzhi Zhang
2019	J	`jnl`	Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria. CoRR Kousha Etessami, Christos H. Papadimitriou, Aviad Rubinstein, Mihalis Yannakakis
2019	J	`jnl`	The Complexity of Finding Electron. Colloquium Comput. Complex. Sanjana Kolisetty, Linh Le, Ilya Volkovich, Mihalis Yannakakis
2019	—	`conf`	The Complexity of Finding S-Factors in Regular Graphs. FSTTCS Sanjana Kolisetty, Linh Le, Ilya Volkovich, Mihalis Yannakakis
2018	J	`jnl`	Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes. Inf. Comput. Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
2018	A*	`conf`	On the Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer. SODA Xi Chen, George Matikas, Dimitris Paparas, Mihalis Yannakakis
2018	—	`conf`	Passive Static Equilibrium with Frictional Contacts and Application to Grasp Stability Analysis. Robotics: Science and Systems Maximilian Haas-Heger, Christos H. Papadimitriou, Mihalis Yannakakis, Garud Iyengar, Matei T. Ciocarlie
2018	J	`jnl`	Passive Static Equilibrium with Frictional Contacts and Application to Grasp Stability Analysis. CoRR Maximilian Haas-Heger, Christos H. Papadimitriou, Mihalis Yannakakis, Garud Iyengar, Matei T. Ciocarlie
2018	J	`jnl`	Power Grid State Estimation Following a Joint Cyber and Physical Attack. IEEE Trans. Control. Netw. Syst. Saleh Soltan, Mihalis Yannakakis, Gil Zussman
2018	J	`jnl`	REACT to Cyber-Physical Attacks on Power grids (Extended Abstract). SIGMETRICS Perform. Evaluation Rev. Saleh Soltan, Mihalis Yannakakis, Gil Zussman
2018	J	`jnl`	Reachability for Branching Concurrent Stochastic Games. CoRR Kousha Etessami, Emanuel Martinov, Alistair Stewart, Mihalis Yannakakis
2018	J	`jnl`	The complexity of optimal multidimensional pricing for a unit-demand buyer. Games Econ. Behav. Xi Chen, Ilias Diakonikolas, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis
2017	J	`jnl`	A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes. SIAM J. Comput. Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
2017	A*	`conf`	Doubly Balanced Connected Graph Partitioning. SODA Saleh Soltan, Mihalis Yannakakis, Gil Zussman
2017	J	`jnl`	On the Complexity of Bundle-Pricing and Simple Mechanisms. CoRR Xi Chen, George Matikas, Dimitris Paparas, Mihalis Yannakakis
2017	J	`jnl`	REACT to Cyber Attacks on Power Grids. CoRR Saleh Soltan, Mihalis Yannakakis, Gil Zussman
2017	J	`jnl`	The Complexity of Non-Monotone Markets. J. ACM Xi Chen, Dimitris Paparas, Mihalis Yannakakis
2016	J	`jnl`	Doubly Balanced Connected Graph Partitioning. CoRR Saleh Soltan, Mihalis Yannakakis, Gil Zussman
2016	J	`jnl`	How Good is the Chord Algorithm? SIAM J. Comput. Constantinos Daskalakis, Ilias Diakonikolas, Mihalis Yannakakis
2015	—	`conf`	Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes. ICALP (2) Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
2015	J	`jnl`	Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes. CoRR Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
2015	A*	`conf`	Joint Cyber and Physical Attacks on Power Grids: Graph Theoretical Approaches for Information Recovery. SIGMETRICS Saleh Soltan, Mihalis Yannakakis, Gil Zussman
2015	A*	`conf`	On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms. FOCS Xi Chen, Ilias Diakonikolas, Anthi Orfanou, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis
2015	J	`jnl`	Recursive Markov Decision Processes and Recursive Stochastic Games. J. ACM Kousha Etessami, Mihalis Yannakakis
2015	J	`jnl`	Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata. J. ACM Alistair Stewart, Kousha Etessami, Mihalis Yannakakis
2014	J	`jnl`	A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing. ACM Trans. Comput. Theory Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
2014	A*	`conf`	The Complexity of Optimal Multidimensional Pricing. SODA Xi Chen, Ilias Diakonikolas, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis
2013	J	`jnl`	A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing CoRR Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
2013	J	`jnl`	A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing. Electron. Colloquium Comput. Complex. Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
2013	A	`conf`	Analysis of Boolean Programs. TACAS Patrice Godefroid, Mihalis Yannakakis
2013	J	`jnl`	How good is the Chord algorithm? CoRR Constantinos Daskalakis, Ilias Diakonikolas, Mihalis Yannakakis
2013	J	`jnl`	Stochastic Context-Free Grammars, Regular Languages, and Newton's Method CoRR Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
2013	—	`conf`	Stochastic Context-Free Grammars, Regular Languages, and Newton's Method. ICALP (2) Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
2013	J	`jnl`	The Complexity of Optimal Multidimensional Pricing. CoRR Xi Chen, Ilias Diakonikolas, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis
2013	A*	`conf`	The complexity of non-monotone markets. STOC Xi Chen, Dimitris Paparas, Mihalis Yannakakis
2013	A*	`conf`	Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata. CAV Alistair Stewart, Kousha Etessami, Mihalis Yannakakis
2013	J	`jnl`	Upper bounds for Newton's method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata CoRR Alistair Stewart, Kousha Etessami, Mihalis Yannakakis
2012	B	`conf`	Computation of Least Fixed Points. MFCS Mihalis Yannakakis
2012	J	`jnl`	Model Checking of Recursive Probabilistic Systems. ACM Trans. Comput. Log. Kousha Etessami, Mihalis Yannakakis
2012	J	`jnl`	Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations CoRR Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
2012	—	`conf`	Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations. ICALP (1) Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
2012	J	`jnl`	Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars CoRR Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
2012	A*	`conf`	Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars. STOC Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
2012	J	`jnl`	The Complexity of Non-Monotone Markets CoRR Xi Chen, Dimitris Paparas, Mihalis Yannakakis
2011	J	`jnl`	Market equilibrium under separable, piecewise-linear, concave utilities. J. ACM Vijay V. Vazirani, Mihalis Yannakakis
2011	A	`conf`	Temporal Synthesis for Bounded Systems and Environments. STACS Orna Kupferman, Yoad Lustig, Moshe Y. Vardi, Mihalis Yannakakis
2010	J	`jnl`	An impossibility theorem for price-adjustment mechanisms. Proc. Natl. Acad. Sci. USA Christos H. Papadimitriou, Mihalis Yannakakis
2010	C	`conf`	Computation of Equilibria and Stable Solutions. SSS Mihalis Yannakakis
2010	A*	`conf`	How Good is the Chord Algorithm?. SODA Constantinos Daskalakis, Ilias Diakonikolas, Mihalis Yannakakis
2010	A	`conf`	Market Equilibrium under Separable, Piecewise-Linear, Concave Utilities. ICS Vijay V. Vazirani, Mihalis Yannakakis
2010	J	`jnl`	On the Complexity of Nash Equilibria and Other Fixed Points. SIAM J. Comput. Kousha Etessami, Mihalis Yannakakis
2010	J	`jnl`	Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. Perform. Evaluation Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis
2009	B	`conf`	Computational Aspects of Equilibria. SAGT Mihalis Yannakakis
2009	J	`jnl`	Equilibria, fixed points, and complexity classes. Comput. Sci. Rev. Mihalis Yannakakis
2009	J	`jnl`	Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. J. ACM Kousha Etessami, Mihalis Yannakakis
2009	J	`jnl`	Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems. SIAM J. Comput. Ilias Diakonikolas, Mihalis Yannakakis
2008	C	`conf`	Automata, Probability, and Recursion. CIAA Mihalis Yannakakis
2008	J	`jnl`	Equilibria, Fixed Points, and Complexity Classes CoRR Mihalis Yannakakis
2008	A	`conf`	Equilibria, Fixed Points, and Complexity Classes. STACS Mihalis Yannakakis
2008	J	`jnl`	Multi-Objective Model Checking of Markov Decision Processes CoRR Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Vardi, Mihalis Yannakakis
2008	J	`jnl`	Multi-Objective Model Checking of Markov Decision Processes. Log. Methods Comput. Sci. Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Vardi, Mihalis Yannakakis
2008	—	`conf`	Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. QEST Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis
2008	J	`jnl`	Recursive Concurrent Stochastic Games CoRR Kousha Etessami, Mihalis Yannakakis
2008	J	`jnl`	Recursive Concurrent Stochastic Games. Log. Methods Comput. Sci. Kousha Etessami, Mihalis Yannakakis
2008	—	`conf`	Recursive Stochastic Games with Positive Rewards. ICALP (1) Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis
2008	J	`jnl`	Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems CoRR Ilias Diakonikolas, Mihalis Yannakakis
2008	A*	`conf`	Succinct approximate convex pareto curves. SODA Ilias Diakonikolas, Mihalis Yannakakis
2007	A	`conf`	Multi-objective Model Checking of Markov Decision Processes. TACAS Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Vardi, Mihalis Yannakakis
2007	A*	`conf`	On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract). FOCS Kousha Etessami, Mihalis Yannakakis
2007	—	`conf`	Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems. APPROX-RANDOM Ilias Diakonikolas, Mihalis Yannakakis
2006	A	`conf`	A note on broadcast encryption key management with applications to large scale emergency alert systems. IPDPS Guoqiang Shu, David Lee, Mihalis Yannakakis
2006	J	`jnl`	Adaptive Model Checking. Log. J. IGPL Alex Groce, Doron A. Peled, Mihalis Yannakakis
2006	B	`conf`	Analysis of Recursive Probabilistic Models. ATVA Mihalis Yannakakis
2006	A	`conf`	Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games. STACS Kousha Etessami, Mihalis Yannakakis
2006	—	`conf`	Recursion and Probability. IFIP TCS Mihalis Yannakakis
2006	—	`conf`	Recursive Concurrent Stochastic Games. ICALP (2) Kousha Etessami, Mihalis Yannakakis
2006	—	`conf`	Succinct Approximation of Trade-Off Curves. WINE Mihalis Yannakakis
2005	A	`conf`	Algorithmic Verification of Recursive Probabilistic State Machines. TACAS Kousha Etessami, Mihalis Yannakakis
2005	J	`jnl`	Analysis of recursive state machines. ACM Trans. Program. Lang. Syst. Rajeev Alur, Michael Benedikt, Kousha Etessami, Patrice Godefroid, Thomas W. Reps, Mihalis Yannakakis
2005	—	`conf`	Checking LTL Properties of Recursive Markov Chains. QEST Mihalis Yannakakis, Kousha Etessami
2005	J	`jnl`	Efficiently computing succinct trade-off curves. Theor. Comput. Sci. Sergei Vassilvitskii, Mihalis Yannakakis
2005	B	`conf`	Probability and Recursion. ISAAC Kousha Etessami, Mihalis Yannakakis
2005	J	`jnl`	Realizability and verification of MSC graphs. Theor. Comput. Sci. Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
2005	A	`conf`	Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations. STACS Kousha Etessami, Mihalis Yannakakis
2005	A*	`conf`	Recursive Markov Decision Processes and Recursive Stochastic Games. ICALP Kousha Etessami, Mihalis Yannakakis
2005	A*	`conf`	Testing hierarchical systems. SODA Damon Mosk-Aoyama, Mihalis Yannakakis
2004	A*	`conf`	Efficiently Computing Succinct Trade-Off Curves. ICALP Sergei Vassilvitskii, Mihalis Yannakakis
2004	J	`jnl`	Guest Editors' foreword. J. Comput. Syst. Sci. Sampath Kannan, Mihalis Yannakakis
2004	J	`jnl`	Multiway cuts in node weighted graphs. J. Algorithms Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
2004	B	`conf`	Protocol System Integration, Interface and Interoperability. OPODIS David Lee, Christine Liu, Mihalis Yannakakis
2004	A*	`conf`	Testing, Optimizaton, and Games. ICALP Mihalis Yannakakis
2004	A*	`conf`	Testing, Optimizaton, and Games. LICS Mihalis Yannakakis
2003	B	`conf`	Compression of Partially Ordered Strings. CONCUR Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, Sudipto Guha, Mihalis Yannakakis
2003	J	`jnl`	Inference of Message Sequence Charts. IEEE Trans. Software Eng. Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
2003	J	`jnl`	Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. Syst. Sci. Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis
2002	A*	`conf`	AMC: An Adaptive Model Checker. CAV Alex Groce, Doron A. Peled, Mihalis Yannakakis
2002	A	`conf`	Adaptive Model Checking. TACAS Alex Groce, Doron A. Peled, Mihalis Yannakakis
2002	J	`jnl`	Black Box Checking. J. Autom. Lang. Comb. Doron A. Peled, Moshe Y. Vardi, Mihalis Yannakakis
2002	J	`jnl`	Closed Partition Lattice and Machine Decomposition. IEEE Trans. Computers David Lee, Mihalis Yannakakis
2002	J	`jnl`	Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing. SIAM Rev. Edward G. Coffman Jr., Costas Courcoubetis, Michael R. Garey, David S. Johnson, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis
2002	B	`conf`	Testing and Checking of Finite State Systems. LATIN Mihalis Yannakakis
2001	A*	`conf`	Analysis of Recursive State Machines. CAV Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
2001	B	`conf`	Approximation of Multiobjective Optimization Problems. WADS Mihalis Yannakakis
2001	J	`jnl`	Model checking of hierarchical state machines. ACM Trans. Program. Lang. Syst. Rajeev Alur, Mihalis Yannakakis
2001	A*	`conf`	Multiobjective Query Optimization. PODS Christos H. Papadimitriou, Mihalis Yannakakis
2001	A*	`ed.`	Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece STOC Jeffrey Scott Vitter, Paul G. Spirakis, Mihalis Yannakakis
2001	A*	`conf`	Realizability and Verification of MSC Graphs. ICALP Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
2000	J	`jnl`	Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings. SIAM J. Discret. Math. Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis
2000	C	`conf`	From Rule-based to Automata-based Testing. FORTE Kousha Etessami, Mihalis Yannakakis
2000	—	`conf`	Hierarchical State Machines. IFIP TCS Mihalis Yannakakis
2000	A*	`conf`	Inference of message sequence charts. ICSE Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
2000	A*	`conf`	On the Approximability of Trade-offs and Optimal Access of Web Sources. FOCS Christos H. Papadimitriou, Mihalis Yannakakis
2000	J	`jnl`	Reminiscences on Influential Papers. SIGMOD Rec. Kenneth A. Ross, Charu C. Aggarwal, Alfons Kemper, Sunita Sarawagi, S. Sudarshan, Mihalis Yannakakis
1999	A*	`conf`	A Convex Relaxation for the Asymmetric TSP. SODA Santosh S. Vempala, Mihalis Yannakakis
1999	C	`conf`	Black Box Checking. FORTE Doron A. Peled, Moshe Y. Vardi, Mihalis Yannakakis
1999	A*	`conf`	Communicating Hierarchical State Machines. ICALP Rajeev Alur, Sampath Kannan, Mihalis Yannakakis
1999	B	`conf`	Model Checking of Message Sequence Charts. CONCUR Rajeev Alur, Mihalis Yannakakis
1999	A*	`conf`	Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems. STOC Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis
1999	J	`jnl`	On the Complexity of Database Queries. J. Comput. Syst. Sci. Christos H. Papadimitriou, Mihalis Yannakakis
1998	J	`jnl`	Markov decision processes and regular events. IEEE Trans. Autom. Control. Costas Courcoubetis, Mihalis Yannakakis
1998	—	`conf`	Model Checking of Hierarchical State Machines. SIGSOFT FSE Rajeev Alur, Mihalis Yannakakis
1998	A*	`conf`	On the Complexity of Protein Folding (Extended Abstract). STOC Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis
1998	J	`jnl`	On the Complexity of Protein Folding. J. Comput. Biol. Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis
1998	B	`conf`	On the complexity of protein folding (abstract). RECOMB Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis
1998	C	`conf`	Protocol Feature Interactions. FORTE Thomas F. La Porta, David Lee, Yow-Jian Lin, Mihalis Yannakakis
1998	B	`conf`	Testing for Finite State Systems. CSL Mihalis Yannakakis, David Lee
1997	J	`jnl`	An Efficient Algorithm for Minimizing Real-Time Transition Systems. Formal Methods Syst. Des. Mihalis Yannakakis, David Lee
1997	B	`conf`	Existence of Reduction Hierarchies. CSL Orna Kupferman, Robert P. Kurshan, Mihalis Yannakakis
1997	A*	`conf`	On the Complexity of Database Queries. PODS Christos H. Papadimitriou, Mihalis Yannakakis
1997	J	`jnl`	Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees. Algorithmica Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
1997	J	`jnl`	Tie-Breaking Semantics and Structural Totality. J. Comput. Syst. Sci. Christos H. Papadimitriou, Mihalis Yannakakis
1996	J	`jnl`	Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications. SIAM J. Comput. Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
1996	J	`jnl`	On Limited Nondeterminism and the Complexity of the V-C Dimension. J. Comput. Syst. Sci. Christos H. Papadimitriou, Mihalis Yannakakis
1996	—	`conf`	On nested depth first search. The Spin Verification System Gerard J. Holzmann, Doron A. Peled, Mihalis Yannakakis
1996	B	`conf`	Optimization problems from feature testing of communication protocols. ICNP David Lee, Mihalis Yannakakis
1996	J	`jnl`	Perspectives on database theory. SIGACT News Mihalis Yannakakis
1996	J	`jnl`	Principles and methods of testing finite state machines-a survey. Proc. IEEE David Lee, Mihalis Yannakakis
1996	A*	`conf`	Searching a Fixed Graph. ICALP Elias Koutsoupias, Christos H. Papadimitriou, Mihalis Yannakakis
1995	A*	`conf`	Distinguishing tests for nondeterministic and probabilistic machines. STOC Rajeev Alur, Costas Courcoubetis, Mihalis Yannakakis
1995	J	`jnl`	On Datalog vs. Polynomial Time. J. Comput. Syst. Sci. Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis
1995	A*	`conf`	Perspectives on Database Theory. FOCS Mihalis Yannakakis
1995	A*	`ed.`	Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 22-25, 1995, San Jose, California, USA Mihalis Yannakakis, Serge Abiteboul
1995	J	`jnl`	Testing Finite State Machines: Fault Detection. J. Comput. Syst. Sci. Mihalis Yannakakis, David Lee
1995	J	`jnl`	The Complexity of Probabilistic Verification. J. ACM Costas Courcoubetis, Mihalis Yannakakis
1995	J	`jnl`	Timing Verification by Successive Approximation Inf. Comput. Rajeev Alur, Alon Itai, Robert P. Kurshan, Mihalis Yannakakis
1994	J	`jnl`	Linear Approximation of Shortest Superstrings. J. ACM Avrim Blum, Tao Jiang, Ming Li, John Tromp, Mihalis Yannakakis
1994	A*	`conf`	Multiway Cuts in Directed and Node Weighted Graphs. ICALP Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
1994	A*	`conf`	On complexity as bounded rationality (extended abstract). STOC Christos H. Papadimitriou, Mihalis Yannakakis
1994	J	`jnl`	On the Approximation of Maximum Satisfiability. J. Algorithms Mihalis Yannakakis
1994	J	`jnl`	On the Hardness of Approximating Minimization Problems. J. ACM Carsten Lund, Mihalis Yannakakis
1994	C	`conf`	Some Open Problems in Approximation. CIAC Mihalis Yannakakis
1994	J	`jnl`	Testing Finite-State Machines: State Identification and Verification. IEEE Trans. Computers David Lee, Mihalis Yannakakis
1994	J	`jnl`	The Complexity of Multiterminal Cuts. SIAM J. Comput. Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
1993	A*	`conf`	An Efficient Algorithm for Minimizing Real-time Transition Systems. CAV Mihalis Yannakakis, David Lee
1993	A*	`conf`	Approximate max-flow min-(multi)cut theorems and their applications. STOC Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
1993	J	`jnl`	Computing the Throughput of a Network with Dedicated Lines. Discret. Appl. Math. Christos H. Papadimitriou, Paolo Serafini, Mihalis Yannakakis
1993	A*	`conf`	Linear programming without the matrix. STOC Christos H. Papadimitriou, Mihalis Yannakakis
1993	—	`conf`	On Limited Nondeterminism and the Complexity of the V.C Dimension (Extended Abstract). SCT Christos H. Papadimitriou, Mihalis Yannakakis
1993	A*	`conf`	On the hardness of approximating minimization problems. STOC Carsten Lund, Mihalis Yannakakis
1993	A*	`conf`	Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover. ICALP Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
1993	B	`conf`	Recent Developments on the Approximability of Combinatorial Problems. ISAAC Mihalis Yannakakis
1993	A*	`conf`	The Approximation of Maximum Subgraph Problems. ICALP Carsten Lund, Mihalis Yannakakis
1993	J	`jnl`	The Traveling Salesman Problem with Distances One and Two. Math. Oper. Res. Christos H. Papadimitriou, Mihalis Yannakakis
1992	J	`jnl`	Memory-Efficient Algorithms for the Verification of Temporal Properties. Formal Methods Syst. Des. Costas Courcoubetis, Moshe Y. Vardi, Pierre Wolper, Mihalis Yannakakis
1992	J	`jnl`	Minimum and Maximum Delay Problems in Real-Time Systems. Formal Methods Syst. Des. Costas Courcoubetis, Mihalis Yannakakis
1992	A*	`conf`	On the Approximation of Maximum Satisfiability. SODA Mihalis Yannakakis
1992	A*	`conf`	Online Minimization of Transition Systems (Extended Abstract) STOC David Lee, Mihalis Yannakakis
1992	A*	`conf`	Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract). ICALP Vijay V. Vazirani, Mihalis Yannakakis
1992	A*	`conf`	The Complexity of Multiway Cuts (Extended Abstract) STOC Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
1992	A*	`conf`	Tie-Breaking Semantics and Structural Totality. PODS Christos H. Papadimitriou, Mihalis Yannakakis
1992	A*	`conf`	Timing Verification by Successive Approximation. CAV Rajeev Alur, Alon Itai, Robert P. Kurshan, Mihalis Yannakakis
1991	J	`jnl`	Expressing Combinatorial Optimization Problems by Linear Programs. J. Comput. Syst. Sci. Mihalis Yannakakis
1991	A*	`conf`	Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study STOC Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Lyle A. McGeoch, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis
1991	J	`jnl`	High-Probability Parallel Transitive-Closure Algorithms. SIAM J. Comput. Jeffrey D. Ullman, Mihalis Yannakakis
1991	A*	`conf`	Linear Approximation of Shortest Superstrings STOC Avrim Blum, Tao Jiang, Ming Li, John Tromp, Mihalis Yannakakis
1991	J	`jnl`	Modularity of Cycles and Paths in Graphs. J. ACM Esther M. Arkin, Christos H. Papadimitriou, Mihalis Yannakakis
1991	A*	`conf`	On Datalog vs. Polynomial Time. PODS Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis
1991	A*	`conf`	On the Value of Information in Distributed Decision-Making (Extended Abstract). PODC Christos H. Papadimitriou, Mihalis Yannakakis
1991	J	`jnl`	Optimization, Approximation, and Complexity Classes. J. Comput. Syst. Sci. Christos H. Papadimitriou, Mihalis Yannakakis
1991	J	`jnl`	Shortest Paths Without a Map. Theor. Comput. Sci. Christos H. Papadimitriou, Mihalis Yannakakis
1991	J	`jnl`	Simple Local Search Problems That are Hard to Solve. SIAM J. Comput. Alejandro A. Schäffer, Mihalis Yannakakis
1991	A*	`conf`	Testing Finite State Machines (Extended Abstract) STOC Mihalis Yannakakis, David Lee
1991	J	`jnl`	The Input/Output Complexity of Transitive Closure. Ann. Math. Artif. Intell. Jeffrey D. Ullman, Mihalis Yannakakis
1990	A*	`conf`	Graph-Theoretic Methods in Database Theory. PODS Mihalis Yannakakis
1990	B	`conf`	High-Probability Parallel Transitive Closure Algorithms. SPAA Jeffrey D. Ullman, Mihalis Yannakakis
1990	A*	`conf`	Markov Decision Processes and Regular Events (Extended Abstract). ICALP Costas Courcoubetis, Mihalis Yannakakis
1990	A*	`conf`	Memory Efficient Algorithms for the Verification of Temporal Properties. CAV Costas Courcoubetis, Moshe Y. Vardi, Pierre Wolper, Mihalis Yannakakis
1990	—	`conf`	Memory Efficient Algorithms for the Verification of Temporal Properties. CAV (DIMACS/AMS volume) Costas Courcoubetis, Moshe Y. Vardi, Pierre Wolper, Mihalis Yannakakis
1990	J	`jnl`	On recognizing integer polyhedra. Comb. Christos H. Papadimitriou, Mihalis Yannakakis
1990	A*	`conf`	On the Complexity of Local Search (Extended Abstract) STOC Christos H. Papadimitriou, Alejandro A. Schäffer, Mihalis Yannakakis
1990	A	`conf`	The Analysis of Local Search Problems and Their Heuristics. STACS Mihalis Yannakakis
1990	—	`conf`	The Input/Output Complexity of Transitive Closure. SIGMOD Conference Jeffrey D. Ullman, Mihalis Yannakakis
1990	J	`jnl`	Towards an Architecture-Independent Analysis of Parallel Algorithms. SIAM J. Comput. Christos H. Papadimitriou, Mihalis Yannakakis
1989	J	`jnl`	Deleting Completed Transactions. J. Comput. Syst. Sci. Thanasis Hadzilacos, Mihalis Yannakakis
1989	J	`jnl`	Embedding Planar Graphs in Four Pages. J. Comput. Syst. Sci. Mihalis Yannakakis
1989	J	`jnl`	Optimal Scheduling of Products with Two Subassemblies on a Single Machine. Oper. Res. Edward G. Coffman Jr., Ardavan Nozari, Mihalis Yannakakis
1989	J	`jnl`	Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs. Discret. Appl. Math. Vijay V. Vazirani, Mihalis Yannakakis
1989	A*	`conf`	Shortest Paths Without a Map. ICALP Christos H. Papadimitriou, Mihalis Yannakakis
1988	A*	`conf`	Expressing Combinatorial Optimization Problems by Linear Programs (Extended Abstract) STOC Mihalis Yannakakis
1988	J	`jnl`	How Easy is Local Search? J. Comput. Syst. Sci. David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis
1988	J	`jnl`	On Generating All Maximal Independent Sets. Inf. Process. Lett. David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis
1988	A*	`conf`	Optimization, Approximation, and Complexity Classes (Extended Abstract) STOC Christos H. Papadimitriou, Mihalis Yannakakis
1988	A*	`conf`	Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs. ICALP Vijay V. Vazirani, Mihalis Yannakakis
1988	A*	`ed.`	Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 21-23, 1988, Austin, Texas, USA Chris Edmondson-Yurkanan, Mihalis Yannakakis
1988	A*	`conf`	Towards an Architecture-Independent Analysis of Parallel Algorithms (Extended Abstract) STOC Christos H. Papadimitriou, Mihalis Yannakakis
1988	A*	`conf`	Verifying Temporal Properties of Finite-State Probabilistic Programs FOCS Costas Courcoubetis, Mihalis Yannakakis
1987	J	`jnl`	The Complexity of Reliable Concurrency Control. SIAM J. Comput. Christos H. Papadimitriou, Mihalis Yannakakis
1987	J	`jnl`	The Maximum k-Colorable Subgraph Problem for Chordal Graphs. Inf. Process. Lett. Mihalis Yannakakis, Fanica Gavril
1986	J	`jnl`	A Note on Succinct Representations of Graphs Inf. Control. Christos H. Papadimitriou, Mihalis Yannakakis
1986	J	`jnl`	Deadlock-Freedom (and Safety) of Transactions in a Distributed Database. J. Comput. Syst. Sci. Ouri Wolfson, Mihalis Yannakakis
1986	A*	`conf`	Deleting Completed Transactions. PODS Thanasis Hadzilacos, Mihalis Yannakakis
1986	A*	`conf`	Four Pages are Necessary and Sufficient for Planar Graphs (Extended Abstract) STOC Mihalis Yannakakis
1986	—	`conf`	Linear and Book Embeddings of Graphs. Aegean Workshop on Computing Mihalis Yannakakis
1986	J	`jnl`	Querying Weak Instances. Adv. Comput. Res. Mihalis Yannakakis
1985	J	`jnl`	A Polynomial Algorithm for the Min-Cut Linear Arrangement of Trees J. ACM Mihalis Yannakakis
1985	J	`jnl`	Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. SIAM J. Comput. Robert Endre Tarjan, Mihalis Yannakakis
1985	A*	`conf`	Deadlock-Freedom (and Safety) of Transactions in a Distributed Database. PODS Ouri Wolfson, Mihalis Yannakakis
1985	A*	`conf`	How Easy Is Local Search? (Extended Abstract) FOCS David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis
1985	J	`jnl`	On a Class of Totally Unimodular Matrices. Math. Oper. Res. Mihalis Yannakakis
1985	A*	`conf`	The Complexity of Reliable Concurrency Control. PODS Christos H. Papadimitriou, Mihalis Yannakakis
1984	J	`jnl`	Independent Database Schemas. J. Comput. Syst. Sci. Marc H. Graham, Mihalis Yannakakis
1984	A*	`conf`	On Monotone Formulae with Restricted Depth (Preliminary Version) STOC Maria M. Klawe, Wolfgang J. Paul, Nicholas Pippenger, Mihalis Yannakakis
1984	J	`jnl`	Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum. Math. Oper. Res. Edward G. Coffman Jr., Mihalis Yannakakis
1984	A*	`conf`	Querying Weak Instances. PODS Mihalis Yannakakis
1984	J	`jnl`	Serializability by Locking. J. ACM Mihalis Yannakakis
1984	J	`jnl`	Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. SIAM J. Comput. Robert Endre Tarjan, Mihalis Yannakakis
1984	J	`jnl`	The Complexity of Facets (and Some Facets of Complexity). J. Comput. Syst. Sci. Christos H. Papadimitriou, Mihalis Yannakakis
1983	A*	`conf`	A Polynomial Algorithm for the Min Cut Linear Arrangement of Trees (Extended Abstract) FOCS Mihalis Yannakakis
1983	A*	`conf`	Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract). ICALP Mihalis Yannakakis, Paris C. Kanellakis, Stavros S. Cosmadakis, Christos H. Papadimitriou
1983	A*	`conf`	On Notions of Information Transfer in VLSI Circuits STOC Alfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis
1983	J	`jnl`	On the Desirability of Acyclic Database Schemes J. ACM Catriel Beeri, Ronald Fagin, David Maier, Mihalis Yannakakis
1983	J	`jnl`	Tools for Template Dependencies. SIAM J. Comput. Ronald Fagin, David Maier, Jeffrey D. Ullman, Mihalis Yannakakis
1982	J	`jnl`	A Theory of Safe Locking Policies in Database Systems. J. ACM Mihalis Yannakakis
1982	J	`jnl`	Algebraic Dependencies. J. Comput. Syst. Sci. Mihalis Yannakakis, Christos H. Papadimitriou
1982	J	`jnl`	Freedom from Deadlock of Safe Locking Policies. SIAM J. Comput. Mihalis Yannakakis
1982	A*	`conf`	Independent Database Schemas. PODS Marc H. Graham, Mihalis Yannakakis
1982	A*	`conf`	The Complexity of Facets (and Some Facets of Complexity) STOC Christos H. Papadimitriou, Mihalis Yannakakis
1982	J	`jnl`	The complexity of restricted spanning tree problems. J. ACM Christos H. Papadimitriou, Mihalis Yannakakis
1981	A*	`conf`	Algorithms for Acyclic Database Schemes VLDB Mihalis Yannakakis
1981	J	`jnl`	Edge-Deletion Problems. SIAM J. Comput. Mihalis Yannakakis
1981	A*	`conf`	Issues of Correctness in Database Concurrency Control by Locking STOC Mihalis Yannakakis
1981	J	`jnl`	Node-Deletion Problems on Bipartite Graphs. SIAM J. Comput. Mihalis Yannakakis
1981	J	`jnl`	On Minimal Eulerian Graphs. Inf. Process. Lett. Christos H. Papadimitriou, Mihalis Yannakakis
1981	J	`jnl`	On the Complexity of Testing Implications of Functional and Join Dependencies. J. ACM David Maier, Yehoshua Sagiv, Mihalis Yannakakis
1981	A*	`conf`	Properties of Acyclic Database Schemes STOC Catriel Beeri, Ronald Fagin, David Maier, Alberto O. Mendelzon, Jeffrey D. Ullman, Mihalis Yannakakis
1981	J	`jnl`	The Clique Problem for Planar Graphs. Inf. Process. Lett. Christos H. Papadimitriou, Mihalis Yannakakis
1981	J	`jnl`	The Complexity of Testing Whether a Graph is a Superconcentrator. Inf. Process. Lett. Manuel Blum, Richard M. Karp, Oliver Vornberger, Christos H. Papadimitriou, Mihalis Yannakakis
1981	A*	`conf`	Worst-Case Ratios for Planar Graphs and the Method of Induction on Faces (Extended Abstract) FOCS Christos H. Papadimitriou, Mihalis Yannakakis
1980	A*	`conf`	Algebraic Dependencies (Extended Abstract) FOCS Mihalis Yannakakis, Christos H. Papadimitriou
1980	J	`jnl`	Equivalences Among Relational Expressions with the Union and Difference Operators. J. ACM Yehoshua Sagiv, Mihalis Yannakakis
1980	A*	`conf`	On a Class of Totally Unimodular Matrices FOCS Mihalis Yannakakis
1980	J	`jnl`	Testing the Universal Instance Assumption. Inf. Process. Lett. Peter Honeyman, Richard E. Ladner, Mihalis Yannakakis
1980	J	`jnl`	The Node-Deletion Problem for Hereditary Properties is NP-Complete. J. Comput. Syst. Sci. John M. Lewis, Mihalis Yannakakis
1979	A*	`conf`	Locking Policies: Safety and Freedom from Deadlock FOCS Mihalis Yannakakis, Christos H. Papadimitriou, H. T. Kung
1979	A*	`conf`	Modeling Communications Protocols by Automata FOCS Alfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis
1979	J	`jnl`	Scheduling Interval-Ordered Tasks. SIAM J. Comput. Christos H. Papadimitriou, Mihalis Yannakakis
1979	A*	`conf`	The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract). ICALP Christos H. Papadimitriou, Mihalis Yannakakis
1979	J	`jnl`	The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems. J. ACM Mihalis Yannakakis
1979	J	`jnl`	Topological Characterization of Families of Graphs Generated by Certain Types of Graph Grammars Inf. Control. Mihalis Yannakakis, Theodosios Pavlidis
1978	A*	`conf`	Equivalence among Relational Expressions with the Union and Difference Operation. VLDB Yehoshua Sagiv, Mihalis Yannakakis
1978	A*	`conf`	Node- and Edge-Deletion NP-Complete Problems STOC Mihalis Yannakakis