E-mail: chlamtac [at] cs [dot] princeton [dot] edu
Recently received my PhD from the Computer Science Department at Princeton University. My advisor was Sanjeev Arora. My new homepage will hopefully be up soon.
My CV.
My PhD thesis, containing the most polished versions of some of the following results, can be found here.
Appeared in Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) 2008:
"Improved Approximation Guarantees Through Higher Levels of SDP Hierarchies", Eden Chlamtac and Gyanit Singh.Appeared in IEEE Symposium on Foundations of Computer Science (FOCS) 2007:
"Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations", Eden Chlamtac.Appeared in IEEE Symposium on Foundations of Computer Science (FOCS) 2006:
"How to Play Unique Games Using Embeddings", Eden Chlamtac, Konstantin Makarychev, and Yury Makarychev.Appeared in ACM Symposium on Theory of Computing (STOC) 2006:
"New Approximation Guarantee for Chromatic Number", Sanjeev Arora, Eden Chlamtac, and Moses Charikar.In Theoretical Computer Science, Volume 341, Issue 1, Pages 22-38:
"Improved Approximation of the Minimum Cover Time", Eden Chlamtac and Uriel Feige.Appeared in SIGGRAPH Asia 2008:
"Efficient Traversal of Mesh Edges using Adjacency Primitives", Pedro V. Sander, Diego Nehab, Eden Chlamtac, and Hugues Hoppe.