No photo of Eden Chlamtac

View Scopus Profile

Eden Chlamtac

 https://orcid.org/0000-0002-0296-0107
20052023

Research activity per year

  • 21 Conference contribution
  • 7 Article
  • 1 Chapter
  • 1 Conference article
Filter
Conference contribution

Search results

  • 2023

    Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment

    Chlamtáč, E., Makarychev, Y. & Vakilian, A., 1 Sep 2023, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023. Megow, N. & Smith, A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 11. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 275).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2022

    Approximating Fair Clustering with Cascaded Norm Objectives

    Chlamtác, E., Makarychev, Y. & Vakilian, A., 1 Jan 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, p. 2664-2683 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2022-January).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    14 Scopus citations
  • 2020

    How to cut a ball without separating: Improved approximations for length bounded cut

    Chlamtáč, E. & Kolman, P., 1 Aug 2020, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020. Byrka, J. & Meka, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, APPROX41. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 176).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations
  • 2019

    Approximating the norms of graph spanners

    Chlamtáč, E., Dinitz, M. & Robinson, T., 1 Sep 2019, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019. Achlioptas, D. & Vegh, L. A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 11. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 145).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations

  • The norms of graph spanners

    Chlamtáč, E., Dinitz, M. & Robinson, T., 1 Jul 2019, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Baier, C., Chatzigiannakis, I., Flocchini, P. & Leonardi, S. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 40. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 132).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    3 Scopus citations
  • 2018

    Sherali-Adams integrality gaps matching the log-density threshold

    Chlamtác, E. & Manurangsi, P., 1 Aug 2018, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018. Blais, E., Rolim, J. D. P., Steurer, D. & Jansen, K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 10. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 116).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    5 Scopus citations
  • 2017

    Approximating spanners and directed steiner forest: Upper and lower bounds

    Chlamtáč, E., Dinitz, M., Kortsarz, G. & Laekhanukitx, B., 1 Jan 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 534-553 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    20 Scopus citations

  • Approximation algorithms for label cover and the log-density threshold

    Chlamtáč, E., Manurangsi, P., Moshkovitz, D. & Vijayaraghavan, A., 1 Jan 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 900-919 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    12 Scopus citations

  • Minimizing the union: Tight approximations for small set bipartite vertex expansion

    Chlamtáč, E., Dinitz, M. & Makarychev, Y., 1 Jan 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 881-899 19 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    35 Scopus citations
  • 2016

    The densest κ-subhypergraph problem

    Chlamtác, E., Dinitz, M., Konrad, C., Kortsarz, G. & Rabanca, G., 1 Sep 2016, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 19th International Workshop, APPROX 2016 and 20th International Workshop, RANDOM 2016. Jansen, K., Mathieu, C., Rolim, J. D. P. & Umans, C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 60).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    9 Scopus citations
  • 2014

    Lowest degree κ-Spanner: Approximation and hardness

    Chlamtáč, E. & Dinitz, M., 1 Sep 2014, Leibniz International Proceedings in Informatics, LIPIcs. Rolim, J. D. P., Moore, C., Devanur, N. R. & Jansen, K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 80-95 16 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 28).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    8 Scopus citations
  • 2013

    Lift-and-project methods for set cover and knapsack

    Chlamtáč, E., Friggstad, Z. & Georgiou, K., 12 Aug 2013, Algorithms and Data Structures - 13th International Symposium, WADS 2013, Proceedings. p. 256-267 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8037 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    4 Scopus citations
  • 2012

    Linear index coding via semidefinite programming

    Chlamtáč, E. & Haviv, I., 1 Jan 2012, Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012. Association for Computing Machinery, p. 406-419 14 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    9 Scopus citations
  • 2011

    Inapproximability of NP-complete variants of Nash equilibrium

    Austrin, P., Braverman, M. & Chlamtáč, E., 8 Sep 2011, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 14th International Workshop, APPROX 2011 and 15th International Workshop, RANDOM 2011, Proceedings. p. 13-25 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6845 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    9 Scopus citations
  • 2010

    Approximating Sparsest cut in graphs of bounded treewidth

    Chlamtac, E., Krauthgamer, R. & Raghavendra, P., 15 Nov 2010, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Proceedings. p. 124-137 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6302 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    13 Scopus citations

  • Detecting high log-densities - An O(n1/4) approximation for densest k-subgraph

    Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U. & Vijayaraghavan, A., 23 Jul 2010, STOC'10 - Proceedings of the 2010 ACM International Symposium on Theory of Computing. p. 201-210 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    252 Scopus citations
  • 2008

    Efficient traversal of mesh edges using adjacency primitives

    Sander, P. V., Nehab, D., Chlamtac, E. & Hoppe, H., 1 Jan 2008, ACM SIGGRAPH Asia 2008 Papers, SIGGRAPH Asia'08. Association for Computing Machinery, 144. (ACM SIGGRAPH Asia 2008 Papers, SIGGRAPH Asia'08).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    6 Scopus citations

  • Improved approximation guarantees through higher levels of SDP hierarchies

    Chlamtac, E. & Singh, G., 22 Sep 2008, Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques - 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Proceedings. p. 49-62 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5171 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    38 Scopus citations
  • 2007

    Approximation algorithms using hierarchies of semidefinite programming relaxations

    Chlamtac, E., 1 Dec 2007, Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007. p. 691-701 11 p. 4389537. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    55 Scopus citations
  • 2006

    How to play unique games using embeddings

    Chlamtac, E., Makarychev, K. & Makarychev, Y., 1 Dec 2006, 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006. p. 687-696 10 p. 4031403. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    46 Scopus citations

  • New approximation guarantee for chromatic number

    Arora, S., Chlamtac, E. & Charikar, M., 5 Sep 2006, STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing. p. 215-224 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 2006).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    58 Scopus citations