Iannis Tourlakis

Publication Activity (10 Years)

Years Active: 2000-2011
Publications (10 Years): 0

Publications

Mikhail Alekhnovich, Sanjeev Arora, Iannis Tourlakis
Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy. Comput. Complex. 20 (4) (2011)
Konstantinos Georgiou, Avner Magen, Toniann Pitassi, Iannis Tourlakis
Integrality Gaps of 2-o(1) for Vertex Cover SDPs in the Lov[a-acute]sz--Schrijver Hierarchy. SIAM J. Comput. 39 (8) (2010)
Konstantinos Georgiou, Avner Magen, Iannis Tourlakis
On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities. FSTTCS (2009)
Konstantinos Georgiou, Avner Magen, Iannis Tourlakis
Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities. IPCO (2008)
Konstantinos Georgiou, Avner Magen, Toniann Pitassi, Iannis Tourlakis
Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy. FOCS (2007)
Iannis Tourlakis
New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy. Computational Complexity Conference (2006)
Konstantinos Georgiou, Avner Magen, Toniann Pitassi, Iannis Tourlakis
Tight integrality gaps for Vertex Cover SDPs in the Lovasz-Schrijver hierarchy. Electron. Colloquium Comput. Complex. 13 (152) (2006)
Sanjeev Arora, Béla Bollobás, László Lovász, Iannis Tourlakis
Proving Integrality Gaps without Knowing the Linear Program. Theory Comput. 2 (2) (2006)
Iannis Tourlakis
Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy. APPROX-RANDOM (2005)
Michael Alekhnovich, Sanjeev Arora, Iannis Tourlakis
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy. STOC (2005)
Mikhail Alecknovich, Sanjeev Arora, Iannis Tourlakis
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy Electron. Colloquium Comput. Complex. (117) (2004)
Iannis Tourlakis
Time-Space Tradeoffs for SAT on Nonuniform Machines. J. Comput. Syst. Sci. 63 (2) (2001)
Iannis Tourlakis
Time-Space Lower Bounds for SAT on Uniform and Non-Uniform Machines. Computational Complexity Conference (2000)