Eden Chlamtác

Orcid: 0000-0002-0296-0107

Affiliations:
  • Ben Gurion University of the Negev, Beersheva, Israel
  • Princeton University, Department of Computer Science, NJ, USA (PhD)


According to our database1, Eden Chlamtác authored at least 27 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Polynomial-Time Approximation for Pairwise Fair k-Median Clustering.
CoRR, 2024

2023
Approximating Red-Blue Set Cover.
CoRR, 2023

Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment.
Proceedings of the Approximation, 2023

2022
Approximating Fair Clustering with Cascaded Norm Objectives.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2020
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds.
ACM Trans. Algorithms, 2020

How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut.
Proceedings of the Approximation, 2020

2019
The Norms of Graph Spanners.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Approximating the Norms of Graph Spanners.
Proceedings of the Approximation, 2019

2018
The Densest k-Subhypergraph Problem.
SIAM J. Discret. Math., 2018

Lift-and-Project Methods for Set Cover and Knapsack.
Algorithmica, 2018

Sherali-Adams Integrality Gaps Matching the Log-Density Threshold.
Proceedings of the Approximation, 2018

2017
Approximation Algorithms for Label Cover and The Log-Density Threshold.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Lowest-Degree k-Spanner: Approximation and Hardness.
Theory Comput., 2016

2014
Linear Index Coding via Semidefinite Programming.
Comb. Probab. Comput., 2014

2013
Inapproximability of NP-Complete Variants of Nash Equilibrium.
Theory Comput., 2013

2012
Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods
CoRR, 2012

Everywhere-Sparse Spanners via Dense Subgraphs.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2010
Detecting High Log-Densities -- an O(n^1/4) Approximation for Densest k-Subgraph
CoRR, 2010

Detecting high log-densities: an <i>O</i>(<i>n</i><sup>1/4</sup>) approximation for densest <i>k</i>-subgraph.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Approximating Sparsest Cut in Graphs of Bounded Treewidth.
Proceedings of the Approximation, 2010

2008
Efficient traversal of mesh edges using adjacency primitives.
ACM Trans. Graph., 2008

Improved Approximation Guarantees through Higher Levels of SDP Hierarchies.
Proceedings of the Approximation, 2008

2007
Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006
New approximation guarantee for chromatic number.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

How to Play Unique Games Using Embeddings.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005
Improved approximation of the minimum cover time.
Theor. Comput. Sci., 2005


  Loading...