Author of the publication

The approximation of maximum subgraph problems

, and . Automata, Languages and Programming, page 40--51. Berlin, Heidelberg, Springer Berlin Heidelberg, (1993)

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.

 

Other publications of authors with the same name

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)Recursive stochastic games with positive rewards., , and . Theor. Comput. Sci., (2019)Market Equilibrium under Separable, Piecewise-Linear, Concave Utilities., and . ICS, page 156-165. Tsinghua University Press, (2010)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)Linear Approximation of Shortest Superstrings, , , and . J. ACM, 41 (4): 630-647 (1994)Node- and Edge-Deletion NP-Complete Problems. STOC, page 253-264. ACM, (1978)