| 2008 |
|---|
| 10 | EE | Konstantinos Georgiou,
Avner Magen,
Iannis Tourlakis:
Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities.
IPCO 2008: 140-153 |
| 2007 |
|---|
| 9 | EE | 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: 702-712 |
| 2006 |
|---|
| 8 | EE | Iannis Tourlakis:
New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy.
IEEE Conference on Computational Complexity 2006: 170-182 |
| 7 | EE | Konstantinos Georgiou,
Avner Magen,
Toniann Pitassi,
Iannis Tourlakis:
Tight integrality gaps for Vertex Cover SDPs in the Lovasz-Schrijver hierarchy.
Electronic Colloquium on Computational Complexity (ECCC) 13(152): (2006) |
| 6 | EE | Sanjeev Arora,
Béla Bollobás,
László Lovász,
Iannis Tourlakis:
Proving Integrality Gaps without Knowing the Linear Program.
Theory of Computing 2(1): 19-51 (2006) |
| 2005 |
|---|
| 5 | EE | Iannis Tourlakis:
Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy.
APPROX-RANDOM 2005: 233-244 |
| 4 | EE | Michael Alekhnovich,
Sanjeev Arora,
Iannis Tourlakis:
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy.
STOC 2005: 294-303 |
| 2004 |
|---|
| 3 | EE | Mikhail Alecknovich,
Sanjeev Arora,
Iannis Tourlakis:
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy
Electronic Colloquium on Computational Complexity (ECCC)(117): (2004) |
| 2001 |
|---|
| 2 | | Iannis Tourlakis:
Time-Space Tradeoffs for SAT on Nonuniform Machines.
J. Comput. Syst. Sci. 63(2): 268-287 (2001) |
| 2000 |
|---|
| 1 | EE | Iannis Tourlakis:
Time-Space Lower Bounds for SAT on Uniform and Non-Uniform Machines.
IEEE Conference on Computational Complexity 2000: 22- |
