Mihalis Yannakakis Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
197Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Computational Aspects of Equilibria. SAGT 2009: 2-13
196Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Equilibria, fixed points, and complexity classes. Computer Science Review 3(2): 71-85 (2009)
195Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKousha Etessami, Mihalis Yannakakis: Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. J. ACM 56(1): (2009)
194Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIlias Diakonikolas, Mihalis Yannakakis: Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems. SIAM J. Comput. 39(4): 1340-1371 (2009)
2008
193Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Automata, Probability, and Recursion. CIAA 2008: 23-32
192Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKousha Etessami, Dominik Wojtczak, Mihalis Yannakakis: Recursive Stochastic Games with Positive Rewards. ICALP (1) 2008: 711-723
191Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKousha Etessami, Dominik Wojtczak, Mihalis Yannakakis: Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. QEST 2008: 243-253
190Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIlias Diakonikolas, Mihalis Yannakakis: Succinct approximate convex pareto curves. SODA 2008: 74-83
189Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Equilibria, Fixed Points, and Complexity Classes. STACS 2008: 19-38
188Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Equilibria, Fixed Points, and Complexity Classes CoRR abs/0802.2831: (2008)
187Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIlias Diakonikolas, Mihalis Yannakakis: Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems CoRR abs/0805.2646: (2008)
186Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKousha Etessami, Mihalis Yannakakis: Recursive Concurrent Stochastic Games CoRR abs/0810.3581: (2008)
185Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Vardi, Mihalis Yannakakis: Multi-Objective Model Checking of Markov Decision Processes CoRR abs/0810.5728: (2008)
184Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Vardi, Mihalis Yannakakis: Multi-Objective Model Checking of Markov Decision Processes. Logical Methods in Computer Science 4(4): (2008)
183Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKousha Etessami, Mihalis Yannakakis: Recursive Concurrent Stochastic Games. Logical Methods in Computer Science 4(4): (2008)
2007
182Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIlias Diakonikolas, Mihalis Yannakakis: Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems. APPROX-RANDOM 2007: 74-88
181Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKousha Etessami, Mihalis Yannakakis: On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract). FOCS 2007: 113-123
180Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Vardi, Mihalis Yannakakis: Multi-objective Model Checking of Markov Decision Processes. TACAS 2007: 50-65
2006
179Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Analysis of Recursive Probabilistic Models. ATVA 2006: 1-5
178Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKousha Etessami, Mihalis Yannakakis: Recursive Concurrent Stochastic Games. ICALP (2) 2006: 324-335
177Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Recursion and Probability. IFIP TCS 2006: 13
176Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuoqiang Shu, David Lee, Mihalis Yannakakis: A note on broadcast encryption key management with applications to large scale emergency alert systems. IPDPS 2006
175Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKousha Etessami, Mihalis Yannakakis: Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games. STACS 2006: 634-645
174Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Succinct Approximation of Trade-Off Curves. WINE 2006: 149
173Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlex Groce, Doron Peled, Mihalis Yannakakis: Adaptive Model Checking. Logic Journal of the IGPL 14(5): 729-744 (2006)
2005
172Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKousha Etessami, Mihalis Yannakakis: Recursive Markov Decision Processes and Recursive Stochastic Games. ICALP 2005: 891-903
171Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKousha Etessami, Mihalis Yannakakis: Probability and Recursion. ISAAC 2005: 2-4
170Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis, Kousha Etessami: Checking LTL Properties of Recursive Markov Chains. QEST 2005: 155-165
169Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDamon Mosk-Aoyama, Mihalis Yannakakis: Testing hierarchical systems. SODA 2005: 1126-1135
168Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKousha Etessami, Mihalis Yannakakis: Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations. STACS 2005: 340-352
167Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKousha Etessami, Mihalis Yannakakis: Algorithmic Verification of Recursive Probabilistic State Machines. TACAS 2005: 253-270
166Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRajeev Alur, Michael Benedikt, Kousha Etessami, Patrice Godefroid, Thomas W. Reps, Mihalis Yannakakis: Analysis of recursive state machines. ACM Trans. Program. Lang. Syst. 27(4): 786-818 (2005)
165Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRajeev Alur, Kousha Etessami, Mihalis Yannakakis: Realizability and verification of MSC graphs. Theor. Comput. Sci. 331(1): 97-114 (2005)
164Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSergei Vassilvitskii, Mihalis Yannakakis: Efficiently computing succinct trade-off curves. Theor. Comput. Sci. 348(2-3): 334-356 (2005)
2004
163Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSergei Vassilvitskii, Mihalis Yannakakis: Efficiently Computing Succinct Trade-Off Curves. ICALP 2004: 1201-1213
162Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Testing, Optimizaton, and Games. ICALP 2004: 28-45
161Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Testing, Optimizaton, and Games. LICS 2004: 78-88
160Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Lee, Christine Liu, Mihalis Yannakakis: Protocol System Integration, Interface and Interoperability. OPODIS 2004: 1-19
159Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNaveen Garg, Vijay V. Vazirani, Mihalis Yannakakis: Multiway cuts in node weighted graphs. J. Algorithms 50(1): 49-61 (2004)
158Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSampath Kannan, Mihalis Yannakakis: Guest Editors' foreword. J. Comput. Syst. Sci. 68(2): 237 (2004)
2003
157Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRajeev Alur, Swarat Chaudhuri, Kousha Etessami, Sudipto Guha, Mihalis Yannakakis: Compression of Partially Ordered Strings. CONCUR 2003: 42-56
156Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRajeev Alur, Kousha Etessami, Mihalis Yannakakis: Inference of Message Sequence Charts. IEEE Trans. Software Eng. 29(7): 623-633 (2003)
155Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVenkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. Syst. Sci. 67(3): 473-496 (2003)
2002
154Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlex Groce, Doron Peled, Mihalis Yannakakis: AMC: An Adaptive Model Checker. CAV 2002: 521-525
153Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Testing and Checking of Finite State Systems. LATIN 2002: 14
152Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlex Groce, Doron Peled, Mihalis Yannakakis: Adaptive Model Checking. TACAS 2002: 357-370
151Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Lee, Mihalis Yannakakis: Closed Partition Lattice and Machine Decomposition. IEEE Trans. Computers 51(2): 216-228 (2002)
150no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDoron Peled, Moshe Y. Vardi, Mihalis Yannakakis: Black Box Checking. Journal of Automata, Languages and Combinatorics 7(2): 225-246 (2002)
2001
149Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRajeev Alur, Kousha Etessami, Mihalis Yannakakis: Analysis of Recursive State Machines. CAV 2001: 207-220
148Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRajeev Alur, Kousha Etessami, Mihalis Yannakakis: Realizability and Verification of MSC Graphs. ICALP 2001: 797-808
147Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: Multiobjective Query Optimization. PODS 2001
146Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Approximation of Multiobjective Optimization Problems. WADS 2001: 1
145Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRajeev Alur, Mihalis Yannakakis: Model checking of hierarchical state machines. ACM Trans. Program. Lang. Syst. 23(3): 273-303 (2001)
2000
144no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: On the Approximability of Trade-offs and Optimal Access of Web Sources. FOCS 2000: 86-92
143no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKousha Etessami, Mihalis Yannakakis: From Rule-based to Automata-based Testing. FORTE 2000: 53-68
142Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRajeev Alur, Kousha Etessami, Mihalis Yannakakis: Inference of message sequence charts. ICSE 2000: 304-313
141Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Hierarchical State Machines. IFIP TCS 2000: 315-330
140Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis: Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings. SIAM J. Discrete Math. 13(3): 384-402 (2000)
139Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKenneth A. Ross, Charu C. Aggarwal, Alfons Kemper, Sunita Sarawagi, S. Sudarshan, Mihalis Yannakakis: Reminiscences on Influential Papers. SIGMOD Record 29(3): 52-54 (2000)
1999
138Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRajeev Alur, Mihalis Yannakakis: Model Checking of Message Sequence Charts. CONCUR 1999: 114-129
137no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDoron Peled, Moshe Y. Vardi, Mihalis Yannakakis: Black Box Checking. FORTE 1999: 225-240
136Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRajeev Alur, Sampath Kannan, Mihalis Yannakakis: Communicating Hierarchical State Machines. ICALP 1999: 169-178
135Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSantosh Vempala, Mihalis Yannakakis: A Convex Relaxation for the Asymmetric TSP. SODA 1999: 975-976
134Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVenkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis: Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems. STOC 1999: 19-28
133no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: On the Complexity of Database Queries. J. Comput. Syst. Sci. 58(3): 407-427 (1999)
1998
132Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis, David Lee: Testing for Finite State Systems. CSL 1998: 29-44
131no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas F. La Porta, David Lee, Yow-Jian Lin, Mihalis Yannakakis: Protocol Feature Interactions. FORTE 1998: 59-74
130Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis: On the complexity of protein folding (abstract). RECOMB 1998: 61-62
129Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRajeev Alur, Mihalis Yannakakis: Model Checking of Hierarchical State Machines. SIGSOFT FSE 1998: 175-188
128Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis: On the Complexity of Protein Folding (Extended Abstract). STOC 1998: 597-603
127no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis: On the Complexity of Protein Folding. Journal of Computational Biology 5(3): 423-466 (1998)
1997
126Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOrna Kupferman, Robert P. Kurshan, Mihalis Yannakakis: Existence of Reduction Hierarchies. CSL 1997: 327-340
125Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: On the Complexity of Database Queries. PODS 1997: 12-19
124no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNaveen Garg, Vijay V. Vazirani, Mihalis Yannakakis: Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees. Algorithmica 18(1): 3-20 (1997)
123no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis, David Lee: An Efficient Algorithm for Minimizing Real-Time Transition Systems. Formal Methods in System Design 11(2): 113-136 (1997)
122no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: Tie-Breaking Semantics and Structural Totality. J. Comput. Syst. Sci. 54(1): 48-60 (1997)
1996
121Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElias Koutsoupias, Christos H. Papadimitriou, Mihalis Yannakakis: Searching a Fixed Graph. ICALP 1996: 280-289
120Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Lee, Mihalis Yannakakis: Optimization problems from feature testing of communication protocols. ICNP 1996: 66-75
119no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: On Limited Nondeterminism and the Complexity of the V-C Dimension. J. Comput. Syst. Sci. 53(2): 161-170 (1996)
118no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNaveen Garg, Vijay V. Vazirani, Mihalis Yannakakis: Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications. SIAM J. Comput. 25(2): 235-251 (1996)
117Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Perspectives on database theory. SIGACT News 27(3): 25-49 (1996)
1995
116no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Perspectives on Database Theory. FOCS 1995: 224-246
115Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRajeev Alur, Costas Courcoubetis, Mihalis Yannakakis: Distinguishing tests for nondeterministic and probabilistic machines. STOC 1995: 363-372
114no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRajeev Alur, Alon Itai, Robert P. Kurshan, Mihalis Yannakakis: Timing Verification by Successive Approximation Inf. Comput. 118(1): 142-157 (1995)
113Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas Courcoubetis, Mihalis Yannakakis: The Complexity of Probabilistic Verification. J. ACM 42(4): 857-907 (1995)
112no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis, David Lee: Testing Finite State Machines: Fault Detection. J. Comput. Syst. Sci. 50(2): 209-227 (1995)
111no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFoto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis: On Datalog vs. Polynomial Time. J. Comput. Syst. Sci. 51(2): 177-196 (1995)
1994
110Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Some Open Problems in Approximation. CIAC 1994: 33-39
109Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNaveen Garg, Vijay V. Vazirani, Mihalis Yannakakis: Multiway Cuts in Directed and Node Weighted Graphs. ICALP 1994: 487-498
108Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: On complexity as bounded rationality (extended abstract). STOC 1994: 726-733
107no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Lee, Mihalis Yannakakis: Testing Finite-State Machines: State Identification and Verification. IEEE Trans. Computers 43(3): 306-320 (1994)
106Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAvrim Blum, Tao Jiang, Ming Li, John Tromp, Mihalis Yannakakis: Linear Approximation of Shortest Superstrings. J. ACM 41(4): 630-647 (1994)
105Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarsten Lund, Mihalis Yannakakis: On the Hardness of Approximating Minimization Problems. J. ACM 41(5): 960-981 (1994)
104no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: On the Approximation of Maximum Satisfiability. J. Algorithms 17(3): 475-502 (1994)
103no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis: The Complexity of Multiterminal Cuts. SIAM J. Comput. 23(4): 864-894 (1994)
1993
102Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis, David Lee: An Efficient Algorithm for Minimizing Real-time Transition Systems. CAV 1993: 210-224
101Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarsten Lund, Mihalis Yannakakis: The Approximation of Maximum Subgraph Problems. ICALP 1993: 40-51
100Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNaveen Garg, Vijay V. Vazirani, Mihalis Yannakakis: Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover. ICALP 1993: 64-75
99Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Recent Developments on the Approximability of Combinatorial Problems. ISAAC 1993: 363-368
98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: Linear programming without the matrix. STOC 1993: 121-129
97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarsten Lund, Mihalis Yannakakis: On the hardness of approximating minimization problems. STOC 1993: 286-293
96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNaveen Garg, Vijay V. Vazirani, Mihalis Yannakakis: Approximate max-flow min-(multi)cut theorems and their applications. STOC 1993: 698-707
95no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: On Limited Nondeterminism and the Complexity of the V.C Dimension (Extended Abstract). Structure in Complexity Theory Conference 1993: 12-18
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Paolo Serafini, Mihalis Yannakakis: Computing the Throughput of a Network with Dedicated Lines. Discrete Applied Mathematics 42(2): 271-278 (1993)
1992
93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRajeev Alur, Alon Itai, Robert P. Kurshan, Mihalis Yannakakis: Timing Verification by Successive Approximation. CAV 1992: 137-150
92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVijay V. Vazirani, Mihalis Yannakakis: Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract). ICALP 1992: 366-377
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: Tie-Breaking Semantics and Structural Totality. PODS 1992: 16-22
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: On the Approximation of Maximum Satisfiability. SODA 1992: 1-9
89no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis: The Complexity of Multiway Cuts (Extended Abstract) STOC 1992: 241-251
88no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Lee, Mihalis Yannakakis: Online Minimization of Transition Systems (Extended Abstract) STOC 1992: 264-274
87no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas Courcoubetis, Moshe Y. Vardi, Pierre Wolper, Mihalis Yannakakis: Memory-Efficient Algorithms for the Verification of Temporal Properties. Formal Methods in System Design 1(2/3): 275-288 (1992)
86no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas Courcoubetis, Mihalis Yannakakis: Minimum and Maximum Delay Problems in Real-Time Systems. Formal Methods in System Design 1(4): 385-415 (1992)
1991
85no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: On the Value of Information in Distributed Decision-Making (Extended Abstract). PODC 1991: 61-64
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFoto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis: On Datalog vs. Polynomial Time. PODS 1991: 13-25
83no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Lyle A. McGeoch, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis: Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study STOC 1991: 230-240
82no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAvrim Blum, Tao Jiang, Ming Li, John Tromp, Mihalis Yannakakis: Linear Approximation of Shortest Superstrings STOC 1991: 328-336
81no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis, David Lee: Testing Finite State Machines (Extended Abstract) STOC 1991: 476-485
80no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJeffrey D. Ullman, Mihalis Yannakakis: The Input/Output Complexity of Transitive Closure. Ann. Math. Artif. Intell. 3(2-4): 331-360 (1991)
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEsther M. Arkin, Christos H. Papadimitriou, Mihalis Yannakakis: Modularity of Cycles and Paths in Graphs. J. ACM 38(2): 255-274 (1991)
78no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: Optimization, Approximation, and Complexity Classes. J. Comput. Syst. Sci. 43(3): 425-440 (1991)
77no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Expressing Combinatorial Optimization Problems by Linear Programs. J. Comput. Syst. Sci. 43(3): 441-466 (1991)
76no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJeffrey D. Ullman, Mihalis Yannakakis: High-Probability Parallel Transitive-Closure Algorithms. SIAM J. Comput. 20(1): 100-125 (1991)
75no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlejandro A. Schäffer, Mihalis Yannakakis: Simple Local Search Problems That are Hard to Solve. SIAM J. Comput. 20(1): 56-87 (1991)
74no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: Shortest Paths Without a Map. Theor. Comput. Sci. 84(1): 127-150 (1991)
1990
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas Courcoubetis, Moshe Y. Vardi, Pierre Wolper, Mihalis Yannakakis: Memory Efficient Algorithms for the Verification of Temporal Properties. CAV 1990: 233-242
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas Courcoubetis, Mihalis Yannakakis: Markov Decision Processes and Regular Events (Extended Abstract). ICALP 1990: 336-349
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Graph-Theoretic Methods in Database Theory. PODS 1990: 230-242
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJeffrey D. Ullman, Mihalis Yannakakis: The Input/Output Complexity of Transitive Closure. SIGMOD Conference 1990: 44-53
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJeffrey D. Ullman, Mihalis Yannakakis: High-Probability Parallel Transitive Closure Algorithms. SPAA 1990: 200-209
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: The Analysis of Local Search Problems and Their Heuristics. STACS 1990: 298-311
67no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Alejandro A. Schäffer, Mihalis Yannakakis: On the Complexity of Local Search (Extended Abstract) STOC 1990: 438-445
66no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: On recognizing integer polyhedra. Combinatorica 10(1): 107-109 (1990)
65no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: Towards an Architecture-Independent Analysis of Parallel Algorithms. SIAM J. Comput. 19(2): 322-328 (1990)
1989
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: Shortest Paths Without a Map. ICALP 1989: 610-620
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVijay V. Vazirani, Mihalis Yannakakis: Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs. Discrete Applied Mathematics 25(1-2): 179-190 (1989)
62no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Embedding Planar Graphs in Four Pages. J. Comput. Syst. Sci. 38(1): 36-67 (1989)
61no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThanasis Hadzilacos, Mihalis Yannakakis: Deleting Completed Transactions. J. Comput. Syst. Sci. 38(2): 360-379 (1989)
1988
60no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas Courcoubetis, Mihalis Yannakakis: Verifying Temporal Properties of Finite-State Probabilistic Programs FOCS 1988: 338-345
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVijay V. Vazirani, Mihalis Yannakakis: Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs. ICALP 1988: 667-681
58no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Expressing Combinatorial Optimization Problems by Linear Programs (Extended Abstract) STOC 1988: 223-228
57no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: Optimization, Approximation, and Complexity Classes (Extended Abstract) STOC 1988: 229-234
56no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: Towards an Architecture-Independent Analysis of Parallel Algorithms (Extended Abstract) STOC 1988: 510-513
55no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis: On Generating All Maximal Independent Sets. Inf. Process. Lett. 27(3): 119-123 (1988)
54no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis: How Easy is Local Search? J. Comput. Syst. Sci. 37(1): 79-100 (1988)
1987
53no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis, Fanica Gavril: The Maximum k-Colorable Subgraph Problem for Chordal Graphs. Inf. Process. Lett. 24(2): 133-137 (1987)
52no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: The Complexity of Reliable Concurrency Control. SIAM J. Comput. 16(3): 538-553 (1987)
1986
51no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Linear and Book Embeddings of Graphs. Aegean Workshop on Computing 1986: 226-235
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThanasis Hadzilacos, Mihalis Yannakakis: Deleting Completed Transactions. PODS 1986: 43-46
49no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Four Pages are Necessary and Sufficient for Planar Graphs (Extended Abstract) STOC 1986: 104-108
48no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Querying Weak Instances. Advances in Computing Research 3: 185-211 (1986)
47no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: A Note on Succinct Representations of Graphs Information and Control 71(3): 181-185 (1986)
46no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOuri Wolfson, Mihalis Yannakakis: Deadlock-Freedom (and Safety) of Transactions in a Distributed Database. J. Comput. Syst. Sci. 33(2): 161-178 (1986)
1985
45no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis: How Easy Is Local Search? (Extended Abstract) FOCS 1985: 39-42
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOuri Wolfson, Mihalis Yannakakis: Deadlock-Freedom (and Safety) of Transactions in a Distributed Database. PODS 1985: 105-112
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: The Complexity of Reliable Concurrency Control. PODS 1985: 230-234
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: A Polynomial Algorithm for the Min-Cut Linear Arrangement of Trees J. ACM 32(4): 950-988 (1985)
41no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert Endre Tarjan, Mihalis Yannakakis: Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. SIAM J. Comput. 14(1): 254-255 (1985)
1984
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Querying Weak Instances. PODS 1984: 275-280
39no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaria M. Klawe, Wolfgang J. Paul, Nicholas Pippenger, Mihalis Yannakakis: On Monotone Formulae with Restricted Depth (Preliminary Version) STOC 1984: 480-487
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Serializability by Locking. J. ACM 31(2): 227-244 (1984)
37no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc H. Graham, Mihalis Yannakakis: Independent Database Schemas. J. Comput. Syst. Sci. 28(1): 121-141 (1984)
36no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: The Complexity of Facets (and Some Facets of Complexity). J. Comput. Syst. Sci. 28(2): 244-259 (1984)
35no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert Endre Tarjan, Mihalis Yannakakis: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. SIAM J. Comput. 13(3): 566-579 (1984)
1983
34no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: A Polynomial Algorithm for the Min Cut Linear Arrangement of Trees (Extended Abstract) FOCS 1983: 274-281
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis, Paris C. Kanellakis, Stavros S. Cosmadakis, Christos H. Papadimitriou: Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract). ICALP 1983: 712-722
32no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis: On Notions of Information Transfer in VLSI Circuits STOC 1983: 133-139
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCatriel Beeri, Ronald Fagin, David Maier, Mihalis Yannakakis: On the Desirability of Acyclic Database Schemes J. ACM 30(3): 479-513 (1983)
30no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRonald Fagin, David Maier, Jeffrey D. Ullman, Mihalis Yannakakis: Tools for Template Dependencies. SIAM J. Comput. 12(1): 36-59 (1983)
1982
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc H. Graham, Mihalis Yannakakis: Independent Database Schemas. PODS 1982: 199-204
28no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: The Complexity of Facets (and Some Facets of Complexity) STOC 1982: 255-260
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: The complexity of restricted spanning tree problems. J. ACM 29(2): 285-309 (1982)
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: A Theory of Safe Locking Policies in Database Systems. J. ACM 29(3): 718-740 (1982)
25no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis, Christos H. Papadimitriou: Algebraic Dependencies. J. Comput. Syst. Sci. 25(1): 2-41 (1982)
24no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Freedom from Deadlock of Safe Locking Policies. SIAM J. Comput. 11(2): 391-408 (1982)
1981
23no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: Worst-Case Ratios for Planar Graphs and the Method of Induction on Faces (Extended Abstract) FOCS 1981: 358-363
22no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCatriel Beeri, Ronald Fagin, David Maier, Alberto O. Mendelzon, Jeffrey D. Ullman, Mihalis Yannakakis: Properties of Acyclic Database Schemes STOC 1981: 355-362
21no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Issues of Correctness in Database Concurrency Control by Locking STOC 1981: 363-367
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Algorithms for Acyclic Database Schemes VLDB 1981: 82-94
19no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: On Minimal Eulerian Graphs. Inf. Process. Lett. 12(4): 203-205 (1981)
18no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: The Clique Problem for Planar Graphs. Inf. Process. Lett. 13(4/5): 131-133 (1981)
17no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLManuel Blum, Richard M. Karp, Oliver Vornberger, Christos H. Papadimitriou, Mihalis Yannakakis: The Complexity of Testing Whether a Graph is a Superconcentrator. Inf. Process. Lett. 13(4/5): 164-167 (1981)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Maier, Yehoshua Sagiv, Mihalis Yannakakis: On the Complexity of Testing Implications of Functional and Join Dependencies. J. ACM 28(4): 680-695 (1981)
15no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Edge-Deletion Problems. SIAM J. Comput. 10(2): 297-309 (1981)
14no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Node-Deletion Problems on Bipartite Graphs. SIAM J. Comput. 10(2): 310-327 (1981)
1980
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: On a Class of Totally Unimodular Matrices FOCS 1980: 10-16
12no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis, Christos H. Papadimitriou: Algebraic Dependencies (Extended Abstract) FOCS 1980: 328-332
11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Honeyman, Richard E. Ladner, Mihalis Yannakakis: Testing the Universal Instance Assumption. Inf. Process. Lett. 10(1): 14-19 (1980)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYehoshua Sagiv, Mihalis Yannakakis: Equivalences Among Relational Expressions with the Union and Difference Operators. J. ACM 27(4): 633-655 (1980)
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohn M. Lewis, Mihalis Yannakakis: The Node-Deletion Problem for Hereditary Properties is NP-Complete. J. Comput. Syst. Sci. 20(2): 219-230 (1980)
1979
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis: Modeling Communications Protocols by Automata FOCS 1979: 267-273
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis, Christos H. Papadimitriou, H. T. Kung: Locking Policies: Safety and Freedom from Deadlock FOCS 1979: 286-297
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract). ICALP 1979: 460-470
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis, Theodosios Pavlidis: Topological Characterization of Families of Graphs Generated by Certain Types of Graph Grammars Information and Control 42(1): 72-86 (1979)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems. J. ACM 26(4): 618-630 (1979)
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Mihalis Yannakakis: Scheduling Interval-Ordered Tasks. SIAM J. Comput. 8(3): 405-409 (1979)
1978
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihalis Yannakakis: Node- and Edge-Deletion NP-Complete Problems STOC 1978: 253-264
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYehoshua Sagiv, Mihalis Yannakakis: Equivalence among Relational Expressions with the Union and Difference Operation. VLDB 1978: 535-548

Coauthor Index

1Foto N. Afrati [84] [111]
2Charu C. Aggarwal [139]
3Alfred V. Aho [8] [32]
4Rajeev Alur [93] [114] [115] [129] [136] [138] [142] [145] [148] [149] [156] [157] [165] [166]
5Esther M. Arkin [79]
6Catriel Beeri [22] [31]
7Michael Benedikt [166]
8Avrim Blum [82] [106]
9Manuel Blum [17]
10Swarat Chaudhuri [157]
11Edward G. Coffman Jr. [83] [140]
12Stavros S. Cosmadakis [33] [84] [111]
13Costas Courcoubetis [60] [72] [73] [83] [86] [87] [113] [115] [140]
14Pierluigi Crescenzi (Pilu Crescenzi) [127] [128] [130]
15Elias Dahlhaus [89] [103]
16Ilias Diakonikolas [182] [187] [190] [194]
17Kousha Etessami [142] [143] [148] [149] [156] [157] [165] [166] [167] [168] [170] [171] [172] [175] [178] [180] [181] [183] [184] [185] [186] [191] [192] [195]
18Ronald Fagin [22] [30] [31]
19M. R. Garey (Michael R. Garey) [83] [140]
20Naveen Garg [96] [100] [109] [118] [124] [159]
21Fanica Gavril [53]
22Patrice Godefroid [166]
23Deborah Goldman [127] [128] [130]
24Marc H. Graham [29] [37]
25Alex Groce [152] [154] [173]
26Sudipto Guha [157]
27Venkatesan Guruswami [134] [155]
28Thanasis Hadzilacos [50] [61]
29Peter Honeyman [11]
30Alon Itai [93] [114]
31Tao Jiang [82] [106]
32David S. Johnson [45] [54] [55] [83] [89] [103] [140]
33Paris C. Kanellakis [33]
34Sampath Kannan [136] [158]
35Richard M. Karp [17]
36Alfons Kemper [139]
37Sanjeev Khanna [134] [155]
38Maria M. Klawe [39]
39Elias Koutsoupias [121]
40H. T. Kung [7]
41Orna Kupferman [126]
42Robert P. Kurshan [93] [114] [126]
43Marta Z. Kwiatkowska [180] [184] [185]
44Richard E. Ladner [11]
45David Lee [81] [88] [102] [107] [112] [120] [123] [131] [132] [151] [160] [176]
46John M. Lewis [9]
47Ming Li [82] [106]
48Yow-Jian Lin [131]
49Christine Liu [160]
50Carsten Lund [97] [101] [105]
51David Maier [16] [22] [30] [31]
52Lyle A. McGeoch [83]
53Alberto O. Mendelzon [22]
54Damon Mosk-Aoyama [169]
55Christos H. Papadimitriou [3] [6] [7] [12] [17] [18] [19] [23] [25] [27] [28] [33] [36] [43] [45] [47] [52] [54] [55] [56] [57] [64] [65] [66] [67] [74] [78] [79] [85] [89] [91] [94] [95] [98] [103] [108] [119] [121] [122] [125] [127] [128] [130] [133] [144] [147]
56Wolfgang J. Paul [39]
57Theodosios Pavlidis (Theo Pavlidis) [5]
58Doron Peled [137] [150] [152] [154] [173]
59Antonio Piccolboni [127] [128] [130]
60Nicholas Pippenger [39]
61Thomas F. La Porta (Tom La Porta) [131]
62Rajmohan Rajaraman [134] [155]
63Thomas W. Reps [166]
64Kenneth A. Ross [139]
65Yehoshua Sagiv [1] [10] [16]
66Sunita Sarawagi [139]
67Alejandro A. Schäffer [67] [75]
68Paolo Serafini [94]
69Paul D. Seymour [89] [103]
70F. Bruce Shepherd [134] [155]
71Peter W. Shor [83] [140]
72Guoqiang Shu [176]
73S. Sudarshan [139]
74Robert Endre Tarjan [35] [41]
75John Tromp [82] [106]
76Jeffrey D. Ullman [8] [22] [30] [32] [69] [70] [76] [80]
77Moshe Y. Vardi [73] [87] [137] [150] [180] [184] [185]
78Sergei Vassilvitskii [163] [164]
79Vijay V. Vazirani [59] [63] [92] [96] [100] [109] [118] [124] [159]
80Santosh Vempala [135]
81Oliver Vornberger [17]
82Richard R. Weber [83] [140]
83Dominik Wojtczak [191] [192]
84Ouri Wolfson [44] [46]
85Pierre Wolper [73] [87]

Colors in the list of coauthors

Copyright © Fri Mar 12 12:56:28 2010 by Michael Ley (ley@uni-trier.de)