Iannis Tourlakis

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