( en | de | ru )

 

Disambiguation of "Yannakakis, Mihalis"

Author of the publication

copydeleteadd this publication to your clipboard
A Note on Succinct Representations of Graphs

, and . Inf. Control., 71 (3): 181-185 (December 1986)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mihalis Nicolaou

 

Other publications of authors with the same name

Node- and Edge-Deletion NP-Complete Problems. STOC, page 253-264. ACM, (1978)Probability and Recursion., and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 2-4. Springer, (2005)Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria., , , and . ITCS, volume 151 of LIPIcs, page 18:1-18:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Searching a fixed graph, , and . Automata, Languages and Programming: 23rd International Colloquium, ICALP'96 Paderborn, Germany, July 8--12, 1996 Proceedings 23, page 280--289. Springer, (1996)Scheduling Interval-Ordered Tasks., and . SIAM J. Comput., 8 (3): 405-409 (1979)Freedom from Deadlock of Safe Locking Policies.. SIAM J. Comput., 11 (2): 391-408 (1982)Node-Deletion Problems on Bipartite Graphs.. SIAM J. Comput., 10 (2): 310-327 (1981)Edge-Deletion Problems.. SIAM J. Comput., 10 (2): 297-309 (1981)The Complexity of Reliable Concurrency Control., and . SIAM J. Comput., 16 (3): 538-553 (1987)Center-Embedding and Constituency in the Brain and a New Characterization of Context-Free Languages., , , , and . CoRR, (2022)