| |
| 2008 | ||
|---|---|---|
| 6 | EE | Eden Chlamtac, Gyanit Singh: Improved Approximation Guarantees through Higher Levels of SDP Hierarchies. APPROX-RANDOM 2008: 49-62 |
| 5 | EE | Pedro V. Sander, Diego Nehab, Eden Chlamtac, Hugues Hoppe: Efficient traversal of mesh edges using adjacency primitives. ACM Trans. Graph. 27(5): 144 (2008) |
| 2007 | ||
| 4 | EE | Eden Chlamtac: Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations. FOCS 2007: 691-701 |
| 2006 | ||
| 3 | EE | Eden Chlamtac, Konstantin Makarychev, Yury Makarychev: How to Play Unique Games Using Embeddings. FOCS 2006: 687-696 |
| 2 | EE | Sanjeev Arora, Eden Chlamtac: New approximation guarantee for chromatic number. STOC 2006: 215-224 |
| 2005 | ||
| 1 | EE | Eden Chlamtac, Uriel Feige: Improved approximation of the minimum cover time. Theor. Comput. Sci. 341(1-3): 22-38 (2005) |
| 1 | Sanjeev Arora | [2] |
| 2 | Uriel Feige | [1] |
| 3 | Hugues Hoppe | [5] |
| 4 | Konstantin Makarychev | [3] |
| 5 | Yury Makarychev | [3] |
| 6 | Diego F. Nehab (Diego Nehab) | [5] |
| 7 | Pedro V. Sander | [5] |
| 8 | Gyanit Singh | [6] |