default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEden Chlamtác
Person information
- unicode name: Eden Chlamtáč
- affiliation: Ben Gurion University of the Negev, Beersheva, Israel
- affiliation (PhD): Princeton University, Department of Computer Science, NJ, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i14]Sayan Bandyapadhyay, Eden Chlamtác, Yury Makarychev, Ali Vakilian:
A Polynomial-Time Approximation for Pairwise Fair k-Median Clustering. CoRR abs/2405.10378 (2024)- 2023
- [c21]Eden Chlamtác, Yury Makarychev, Ali Vakilian:
Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment. APPROX/RANDOM 2023: 11:1-11:19 - [i13]Eden Chlamtác, Yury Makarychev, Ali Vakilian:
Approximating Red-Blue Set Cover. CoRR abs/2302.00213 (2023) - 2022
- [c20]Eden Chlamtác, Yury Makarychev, Ali Vakilian
:
Approximating Fair Clustering with Cascaded Norm Objectives. SODA 2022: 2664-2683 - 2021
- [i12]Eden Chlamtác, Yury Makarychev, Ali Vakilian:
Approximating Fair Clustering with Cascaded Norm Objectives. CoRR abs/2111.04804 (2021) - 2020
- [j8]Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit:
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. ACM Trans. Algorithms 16(3): 33:1-33:31 (2020) - [c19]Eden Chlamtác, Petr Kolman:
How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut. APPROX-RANDOM 2020: 41:1-41:17
2010 – 2019
- 2019
- [c18]Eden Chlamtác, Michael Dinitz, Thomas Robinson:
Approximating the Norms of Graph Spanners. APPROX-RANDOM 2019: 11:1-11:22 - [c17]Eden Chlamtác, Michael Dinitz, Thomas Robinson:
The Norms of Graph Spanners. ICALP 2019: 40:1-40:15 - [i11]Eden Chlamtác, Michael Dinitz, Thomas Robinson:
The Norms of Graph Spanners. CoRR abs/1903.07418 (2019) - 2018
- [j7]Eden Chlamtác, Zachary Friggstad, Konstantinos Georgiou:
Lift-and-Project Methods for Set Cover and Knapsack. Algorithmica 80(12): 3920-3942 (2018) - [j6]Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca:
The Densest k-Subhypergraph Problem. SIAM J. Discret. Math. 32(2): 1458-1477 (2018) - [c16]Eden Chlamtác, Pasin Manurangsi:
Sherali-Adams Integrality Gaps Matching the Log-Density Threshold. APPROX-RANDOM 2018: 10:1-10:19 - [i10]Eden Chlamtác, Pasin Manurangsi:
Sherali-Adams Integrality Gaps Matching the Log-Density Threshold. CoRR abs/1804.07842 (2018) - 2017
- [c15]Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit:
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. SODA 2017: 534-553 - [c14]Eden Chlamtác, Michael Dinitz, Yury Makarychev:
Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion. SODA 2017: 881-899 - [c13]Eden Chlamtác, Pasin Manurangsi, Dana Moshkovitz, Aravindan Vijayaraghavan:
Approximation Algorithms for Label Cover and The Log-Density Threshold. SODA 2017: 900-919 - 2016
- [j5]Eden Chlamtác, Michael Dinitz:
Lowest-Degree k-Spanner: Approximation and Hardness. Theory Comput. 12(1): 1-29 (2016) - [c12]Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca:
The Densest k-Subhypergraph Problem. APPROX-RANDOM 2016: 6:1-6:19 - [i9]Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca:
The Densest k-Subhypergraph Problem. CoRR abs/1605.04284 (2016) - [i8]Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit:
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. CoRR abs/1607.06068 (2016) - [i7]Eden Chlamtác, Michael Dinitz, Yury Makarychev:
Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion. CoRR abs/1611.07866 (2016) - 2014
- [j4]Eden Chlamtac, Ishay Haviv:
Linear Index Coding via Semidefinite Programming. Comb. Probab. Comput. 23(2): 223-247 (2014) - [c11]Eden Chlamtác, Michael Dinitz:
Lowest Degree k-Spanner: Approximation and Hardness. APPROX-RANDOM 2014: 80-95 - 2013
- [j3]Per Austrin, Mark Braverman, Eden Chlamtac:
Inapproximability of NP-Complete Variants of Nash Equilibrium. Theory Comput. 9: 117-142 (2013) - [c10]Eden Chlamtác, Zachary Friggstad, Konstantinos Georgiou:
Lift-and-Project Methods for Set Cover and Knapsack. WADS 2013: 256-267 - 2012
- [c9]Eden Chlamtac, Michael Dinitz, Robert Krauthgamer:
Everywhere-Sparse Spanners via Dense Subgraphs. FOCS 2012: 758-767 - [c8]Eden Chlamtac, Ishay Haviv:
Linear index coding via semidefinite programming. SODA 2012: 406-419 - [i6]Eden Chlamtác, Zac Friggstad, Konstantinos Georgiou:
Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods. CoRR abs/1204.5489 (2012) - [i5]Eden Chlamtac, Michael Dinitz, Robert Krauthgamer:
Everywhere-Sparse Spanners via Dense Subgraphs. CoRR abs/1205.0144 (2012) - 2011
- [c7]Per Austrin, Mark Braverman, Eden Chlamtac:
Inapproximability of NP-Complete Variants of Nash Equilibrium. APPROX-RANDOM 2011: 13-25 - [i4]Per Austrin, Mark Braverman, Eden Chlamtac:
Inapproximability of NP-Complete Variants of Nash Equilibrium. CoRR abs/1104.3760 (2011) - [i3]Eden Chlamtac, Ishay Haviv:
Linear Index Coding via Semidefinite Programming. CoRR abs/1107.1958 (2011) - 2010
- [c6]Eden Chlamtac, Robert Krauthgamer, Prasad Raghavendra:
Approximating Sparsest Cut in Graphs of Bounded Treewidth. APPROX-RANDOM 2010: 124-137 - [c5]Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan:
Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph. STOC 2010: 201-210 - [i2]Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan:
Detecting High Log-Densities -- an O(n^1/4) Approximation for Densest k-Subgraph. CoRR abs/1001.2891 (2010) - [i1]Eden Chlamtac, Robert Krauthgamer, Prasad Raghavendra:
Approximating Sparsest Cut in Graphs of Bounded Treewidth. CoRR abs/1006.3970 (2010)
2000 – 2009
- 2008
- [j2]Pedro V. Sander, Diego Nehab, Eden Chlamtac, Hugues Hoppe:
Efficient traversal of mesh edges using adjacency primitives. ACM Trans. Graph. 27(5): 144 (2008) - [c4]Eden Chlamtac, Gyanit Singh:
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies. APPROX-RANDOM 2008: 49-62 - 2007
- [c3]Eden Chlamtac:
Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations. FOCS 2007: 691-701 - 2006
- [c2]Eden Chlamtac, Konstantin Makarychev, Yury Makarychev:
How to Play Unique Games Using Embeddings. FOCS 2006: 687-696 - [c1]Sanjeev Arora, Eden Chlamtac:
New approximation guarantee for chromatic number. STOC 2006: 215-224 - 2005
- [j1]Eden Chlamtac, Uriel Feige:
Improved approximation of the minimum cover time. Theor. Comput. Sci. 341(1-3): 22-38 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
