Author of the publication

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

New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy.. CCC, page 170-182. IEEE Computer Society, (2006)Time-Space Tradeoffs for SAT on Nonuniform Machines.. J. Comput. Syst. Sci., 63 (2): 268-287 (2001)On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities., , and . FSTTCS, volume 4 of LIPIcs, page 203-214. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2009)Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy, , and . Electron. Colloquium Comput. Complex., (2004)Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy.. APPROX-RANDOM, volume 3624 of Lecture Notes in Computer Science, page 233-244. Springer, (2005)Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy., , and . Comput. Complex., 20 (4): 615-648 (2011)Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy., , and . STOC, page 294-303. ACM, (2005)Tight integrality gaps for Vertex Cover SDPs in the Lovasz-Schrijver hierarchy., , , and . Electron. Colloquium Comput. Complex., (2006)Integrality Gaps of 2-o(1) for Vertex Cover SDPs in the Lova-acutesz--Schrijver Hierarchy., , , and . SIAM J. Comput., 39 (8): 3553-3570 (2010)Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities., , and . IPCO, volume 5035 of Lecture Notes in Computer Science, page 140-153. Springer, (2008)