Eden Chlamtac

18 papers A* 6Journal 9Unranked 3
YearRankTypeTitle / Venue / Authors
2014 J jnl
Linear Index Coding via Semidefinite Programming.
Comb. Probab. Comput.
Eden Chlamtac, Ishay Haviv
2013 J jnl
Inapproximability of NP-Complete Variants of Nash Equilibrium.
Theory Comput.
Per Austrin, Mark Braverman, Eden Chlamtac
2012 J jnl
Everywhere-Sparse Spanners via Dense Subgraphs
CoRR
Eden Chlamtac, Michael Dinitz, Robert Krauthgamer
2012 A* conf
Everywhere-Sparse Spanners via Dense Subgraphs.
FOCS
Eden Chlamtac, Michael Dinitz, Robert Krauthgamer
2012 A* conf
Linear index coding via semidefinite programming.
SODA
Eden Chlamtac, Ishay Haviv
2011 J jnl
Inapproximability of NP-Complete Variants of Nash Equilibrium
CoRR
Per Austrin, Mark Braverman, Eden Chlamtac
2011 — conf
Inapproximability of NP-Complete Variants of Nash Equilibrium.
APPROX-RANDOM
Per Austrin, Mark Braverman, Eden Chlamtac
2011 J jnl
Linear Index Coding via Semidefinite Programming
CoRR
Eden Chlamtac, Ishay Haviv
2010 J jnl
Approximating Sparsest Cut in Graphs of Bounded Treewidth
CoRR
Eden Chlamtac, Robert Krauthgamer, Prasad Raghavendra
2010 — conf
Approximating Sparsest Cut in Graphs of Bounded Treewidth.
APPROX-RANDOM
Eden Chlamtac, Robert Krauthgamer, Prasad Raghavendra
2010 J jnl
Detecting High Log-Densities -- an O(n^1/4) Approximation for Densest k-Subgraph
CoRR
Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan
2010 A* conf
Detecting high log-densities: an
STOC
Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan
2008 J jnl
Efficient traversal of mesh edges using adjacency primitives.
ACM Trans. Graph.
Pedro V. Sander, Diego Nehab, Eden Chlamtac, Hugues Hoppe
2008 — conf
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies.
APPROX-RANDOM
Eden Chlamtac, Gyanit Singh
2007 A* conf
Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations.
FOCS
Eden Chlamtac
2006 A* conf
How to Play Unique Games Using Embeddings.
FOCS
Eden Chlamtac, Konstantin Makarychev, Yury Makarychev
2006 A* conf
New approximation guarantee for chromatic number.
STOC
Sanjeev Arora, Eden Chlamtac
2005 J jnl
Improved approximation of the minimum cover time.
Theor. Comput. Sci.
Eden Chlamtac, Uriel Feige