Iannis Tourlakis

Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy

Sanjeev Arora, Iannis Tourlakis, Mikhail Alekhnovich, 2005, STOC '05.

Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy

T. Pitassi, A. Magen, Iannis Tourlakis, 2007, FOCS 2007.

Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities

Konstantinos Georgiou, Avner Magen, Iannis Tourlakis, 2008, IPCO.

Proving integrality gaps without knowing the linear program

Béla Bollobás, László Lovász, Sanjeev Arora, 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy

T. Pitassi, A. Magen, Iannis Tourlakis, 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

New lower bounds for approximation algorithms in the lovasz-schrijver hierarchy

Sanjeev Arora, Iannis Tourlakis, 2006 .

New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy

Iannis Tourlakis, Iannis Tourlakis, 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).