Time-Space Lower Bounds for SAT on Uniform and Non-Uniform Machines. - Iannis Tourlakis (CCC, 2000)

Time-Space Tradeoffs for SAT on Nonuniform Machines. - Iannis Tourlakis (J. Comput. Syst. Sci., 2001)

Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy. - Iannis Tourlakis (APPROX-RANDOM, 2005)

New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy. - Iannis Tourlakis (CCC, 2006)

Tight integrality gaps for Vertex Cover SDPs in the Lovasz-Schrijver hierarchy. - Konstantinos Georgiou; Avner Magen; Toniann Pitassi; Iannis Tourlakis (Electron. Colloquium Comput. Complex., 2006)

Proving Integrality Gaps without Knowing the Linear Program. - Sanjeev Arora; Béla Bollobás; László Lovász 001; Iannis Tourlakis (Theory Comput., 2006)

Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy. - Konstantinos Georgiou; Avner Magen; Toniann Pitassi; Iannis Tourlakis (FOCS, 2007)

Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities. - Konstantinos Georgiou; Avner Magen; Iannis Tourlakis (IPCO, 2008)

On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities. - Konstantinos Georgiou; Avner Magen; Iannis Tourlakis (FSTTCS, 2009)

Integrality Gaps of 2-o(1) for Vertex Cover SDPs in the Lov[a-acute]sz–Schrijver Hierarchy. - Konstantinos Georgiou; Avner Magen; Toniann Pitassi; Iannis Tourlakis (SIAM J. Comput., 2010)

Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy. - Mikhail Alekhnovich; Sanjeev Arora; Iannis Tourlakis (Comput. Complex., 2011)