default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEden Chlamtác
- > Home > Persons > Eden Chlamtác
Publications
- 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)- 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
- [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) - 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 - 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
- [c11]Eden Chlamtác, Michael Dinitz:
Lowest Degree k-Spanner: Approximation and Hardness. APPROX-RANDOM 2014: 80-95 - 2012
- [c9]Eden Chlamtac, Michael Dinitz, Robert Krauthgamer:
Everywhere-Sparse Spanners via Dense Subgraphs. FOCS 2012: 758-767 - [i5]Eden Chlamtac, Michael Dinitz, Robert Krauthgamer:
Everywhere-Sparse Spanners via Dense Subgraphs. CoRR abs/1205.0144 (2012)
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 2024-06-13 21:48 CEST 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:
