I received my PhD from the Computer Science Department at Princeton University, where my advisor was Sanjeev Arora.

I am currently a post-doctoral fellow at Tel Aviv University, where I am hosted by Noga Alon.

A pronunciation guide for my name.
 
E-mail: chlamtac [at] post [dot] tau [dot] ac [dot] il

For more information, see my CV.
Research Interests
 
    I am primarily interested in approximation algorithms which exploit convex optimization tools (e.g. linear programming, semi-definite programming). Much of my work (though by no means all) focuses on demonstrating the potential of hierarchies of convex relaxations, which until recently remained outside the algorithmic toolkit.
 
Book Chapter (preprint)
 
    Convex Relaxations and Integrality Gaps, with Madhur Tulsiani. Will appear in the Springer "Handbook on Semidefinite, Conic and Polynomial Optimization".
 
Dissertation
 
    My PhD Thesis, containing the most polished versions of some of the following results (specifically, from STOC’06, FOCS’07, APPROX’08), can be found here.
 
Publications - Theory
 
  1. •Everywhere-Sparse Spanners Via Dense Subgraphs
  2. with Michael Dinitz and Robert Krauthgamer. Submitted.
  3. •Linear Index Coding Via Semidefinite Programming (full version on arXiv)
  4. with Ishay Haviv. To Appear in ACM-SIAM Symposium on Discrete Algorithms (SODA) 2012.
  5. •Inapproximability of NP-Complete Variants of Nash Equilibrium (full version on arXiv)
  6. with Per Austrin and Mark Braverman. Appeared in Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) 2011.
  7. •Approximating Sparsest Cut in Graphs of Bounded Treewidth (full version on arXiv)
  8. with Robert Krauthgamer and Prasad Raghavendra. Appeared in Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) 2010.
  9. •Detecting High Log-Densities - an O(n1/4) Approximation for Densest k-Subgraph (arXiv)
  10. with Aditya Bhaskara, Moses Charikar, Uriel Feige and Aravindan Vijayaraghavan. Appeared in ACM Symposium on Theory of Computing (STOC) 2010.
  11. •Improved Approximation Guarantees Through Higher Levels of SDP Hierarchies
  12. with Gyanit Singh. Appeared in Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) 2008.
  13. •Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations
  14. (single author). Appeared in IEEE Symposium on Foundations of Computer Science (FOCS) 2007.
  15. •How to Play Unique Games Using Embeddings, Eden Chlamtac,
  16. with Konstantin Makarychev and Yury Makarychev. Appeared in IEEE Symposium on Foundations of Computer Science (FOCS) 2006.
  17. •New Approximation Guarantee for Chromatic Number,.
  18. with Sanjeev Arora and Moses Charikar. Appeared in ACM Symposium on Theory of Computing (STOC) 2006.
  19. •Improved Approximation of the Minimum Cover Time
  20. with Uriel Feige. In Theoretical Computer Science, Volume 341, Issue 1, Pages 22-38.
  21.  
Publications - Interdisciplinary
 
  1. •Efficient Traversal of Mesh Edges using Adjacency Primitives
  2. with Pedro V. Sander, Diego Nehab and Hugues Hoppe. Appeared in SIGGRAPH Asia 2008.