Konstantinos Georgiou Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKonstantinos Georgiou, Avner Magen, Madhur Tulsiani: Optimal Sherali-Adams Gaps from Pairwise Independence. APPROX-RANDOM 2009: 125-139
2008
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKonstantinos Georgiou, Avner Magen, Iannis Tourlakis: Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities. IPCO 2008: 140-153
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKonstantinos Georgiou, Periklis A. Papakonstantinou: Complexity and Algorithms for Well-Structured k-SAT Instances. SAT 2008: 105-118
2007
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKonstantinos 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
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaul Medvedev, Konstantinos Georgiou, Gene Myers, Michael Brudno: Computability of Models for Sequence Assembly. WABI 2007: 289-301
2006
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKonstantinos 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)

Coauthor Index

1Michael Brudno [2]
2Avner Magen [1] [3] [5] [6]
3Paul Medvedev [2]
4Eugene W. Myers (Gene Myers) [2]
5Periklis A. Papakonstantinou [4]
6Toniann Pitassi [1] [3]
7Iannis Tourlakis [1] [3] [5]
8Madhur Tulsiani [6]

Colors in the list of coauthors

Copyright © Fri Nov 27 15:43:12 2009 by Michael Ley (ley@uni-trier.de)