Improved approximation of the minimum cover time. - Eden Chlamtac; Uriel Feige (Theor. Comput. Sci., 2005)

How to Play Unique Games Using Embeddings. - Eden Chlamtac; Konstantin Makarychev; Yury Makarychev (FOCS, 2006)

New approximation guarantee for chromatic number. - Sanjeev Arora; Eden Chlamtac (STOC, 2006)

Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations. - Eden Chlamtac (FOCS, 2007)

Improved Approximation Guarantees through Higher Levels of SDP Hierarchies. - Eden Chlamtac; Gyanit Singh (APPROX-RANDOM, 2008)

Efficient traversal of mesh edges using adjacency primitives. - Pedro V. Sander; Diego Nehab; Eden Chlamtac; Hugues Hoppe (ACM Trans. Graph., 2008)

Approximating Sparsest Cut in Graphs of Bounded Treewidth. - Eden Chlamtac; Robert Krauthgamer; Prasad Raghavendra (APPROX-RANDOM, 2010)

Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph. - Aditya Bhaskara; Moses Charikar; Eden Chlamtac; Uriel Feige; Aravindan Vijayaraghavan (STOC, 2010)

Detecting High Log-Densities – an O(n^1/4) Approximation for Densest k-Subgraph - Aditya Bhaskara; Moses Charikar; Eden Chlamtac; Uriel Feige; Aravindan Vijayaraghavan (CoRR, 2010)

Inapproximability of NP-Complete Variants of Nash Equilibrium. - Per Austrin; Mark Braverman; Eden Chlamtac (APPROX-RANDOM, 2011)

Everywhere-Sparse Spanners via Dense Subgraphs. - Eden Chlamtac; Michael Dinitz; Robert Krauthgamer (FOCS, 2012)

Linear index coding via semidefinite programming. - Eden Chlamtac; Ishay Haviv (SODA, 2012)

Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods - Eden Chlamtác; Zac Friggstad; Konstantinos Georgiou (CoRR, 2012)

Lift-and-Project Methods for Set Cover and Knapsack. - Eden Chlamtác; Zachary Friggstad; Konstantinos Georgiou (WADS, 2013)

Lowest Degree k-Spanner: Approximation and Hardness. - Eden Chlamtác; Michael Dinitz (APPROX-RANDOM, 2014)

The Densest k-Subhypergraph Problem. - Eden Chlamtác; Michael Dinitz; Christian Konrad 001; Guy Kortsarz; George Rabanca (APPROX-RANDOM, 2016)

Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. - Eden Chlamtác; Michael Dinitz; Guy Kortsarz; Bundit Laekhanukit (SODA, 2017)

Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion. - Eden Chlamtác; Michael Dinitz; Yury Makarychev (SODA, 2017)

Approximation Algorithms for Label Cover and The Log-Density Threshold. - Eden Chlamtác; Pasin Manurangsi; Dana Moshkovitz; Aravindan Vijayaraghavan (SODA, 2017)

Sherali-Adams Integrality Gaps Matching the Log-Density Threshold. - Eden Chlamtác; Pasin Manurangsi (APPROX-RANDOM, 2018)

Approximating the Norms of Graph Spanners. - Eden Chlamtác; Michael Dinitz; Thomas Robinson (APPROX-RANDOM, 2019)

The Norms of Graph Spanners. - Eden Chlamtác; Michael Dinitz; Thomas Robinson (ICALP, 2019)

How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut. - Eden Chlamtác; Petr Kolman (APPROX-RANDOM, 2020)

Approximating Fair Clustering with Cascaded Norm Objectives. - Eden Chlamtác; Yury Makarychev; Ali Vakilian (SODA, 2022)

Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment. - Eden Chlamtác; Yury Makarychev; Ali Vakilian (APPROX/RANDOM, 2023)

Approximating Red-Blue Set Cover. - Eden Chlamtác; Yury Makarychev; Ali Vakilian (CoRR, 2023)

A Polynomial-Time Approximation for Pairwise Fair k-Median Clustering. - Sayan Bandyapadhyay; Eden Chlamtác; Yury Makarychev; Ali Vakilian (CoRR, 2024)