|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 18 publication records. Showing 18 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Eden Chlamtac, Zac Friggstad, Konstantinos Georgiou |
Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Isaac Fung, Konstantinos Georgiou, Jochen Könemann, Malcolm Sharpe |
Efficient Algorithms for Solving Hypergraphic Steiner Tree Relaxations in Quasi-Bipartite Instances |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Konstantinos Georgiou, Chaitanya Swamy |
Black-box reductions for cost-sharing mechanism design. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Siavosh Benabbas, Siu On Chan, Konstantinos Georgiou, Avner Magen |
Tight Gaps for Vertex Cover in the Sherali-Adams SDP Hierarchy. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Siavosh Benabbas, Konstantinos Georgiou, Avner Magen |
The Sherali-Adams System Applied to Vertex Cover: Why Borsuk Graphs Fool Strong LPs and some Tight Integrality Gaps for SDPs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Konstantinos Georgiou, Avner Magen, Toniann Pitassi, Iannis Tourlakis |
Integrality Gaps of 2-o(1) for Vertex Cover SDPs in the Lov[a-acute]sz--Schrijver Hierarchy. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantinos Georgiou, Avner Magen, Madhur Tulsiani |
Optimal Sherali-Adams Gaps from Pairwise Independence. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc |
Random maximal independent sets and the unfriendly theater seating arrangement problem. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantinos Georgiou, Avner Magen, Madhur Tulsiani |
Optimal Sherali-Adams Gaps from Pairwise Independence. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantinos Georgiou, Avner Magen, Iannis Tourlakis |
On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantinos Georgiou, Periklis A. Papakonstantinou |
Complexity and Algorithms for Well-Structured k-SAT Instances. |
SAT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgios Kollias, Konstantinos Georgiou, Efstratios Gallopoulos |
Jylab Meets Eclipse: Integrating PSEs with Multicomponent Platforms. |
eScience |
2008 |
DBLP DOI BibTeX RDF |
grid, eclipse, python |
| 1 | Konstantinos Georgiou, Avner Magen, Iannis Tourlakis |
Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities. |
IPCO |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Medvedev, Konstantinos Georgiou, Gene Myers, Michael Brudno |
Computability of Models for Sequence Assembly. |
WABI |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantinos Georgiou, Giorgios Kollias, Efstratios Gallopoulos |
Grid-Enabling a Problem Solving Environment: Implementation and Everyday Use. |
CoreGRID Workshop - Making Grids Work |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Constantinos Georgiou, Evangelos Kranakis, Ricardo Marcelín-Jiménez, Sergio Rajsbaum, Jorge Urrutia |
Distributed Dynamic Storage in Wireless Networks. |
IJDSN |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #18 of 18 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")