| APX-hardness of maximizing Nash social welfare with indivisible items E Lee Information Processing Letters 122, 17-20, 2017 | 135 | 2017 |
| Improved and simplified inapproximability for k-means E Lee, M Schmidt, J Wright Information Processing Letters 120, 40-43, 2017 | 130 | 2017 |
| Tight FPT Approximations for -Median and -Means V Cohen-Addad, A Gupta, A Kumar, E Lee, J Li arXiv preprint arXiv:1904.12334, 2019 | 109 | 2019 |
| Optimal online contention resolution schemes via ex-ante prophet inequalities E Lee, S Singla arXiv preprint arXiv:1806.09251, 2018 | 109 | 2018 |
| A survey on approximation in parameterized complexity: Hardness and algorithms AE Feldmann, KC S, E Lee, P Manurangsi Algorithms 13 (6), 146, 2020 | 93 | 2020 |
| Partitioning a graph into small pieces with applications to path transversal E Lee Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 80 | 2017 |
| Correlation clustering with sherali-adams V Cohen-Addad, E Lee, A Newman 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 64 | 2022 |
| A PTAS for ℓp-Low Rank Approximation F Ban, V Bhattiprolu, K Bringmann, P Kolev, E Lee, DP Woodruff Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 62 | 2019 |
| Faster exact and approximate algorithms for k-cut A Gupta, E Lee, J Li 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 53 | 2018 |
| Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in ℓp-metrics V Cohen-Addad, KC S, E Lee Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 50 | 2022 |
| Sum-of-squares certificates for maxima of random tensors on the sphere V Bhattiprolu, V Guruswami, E Lee arXiv preprint arXiv:1605.00903, 2016 | 50* | 2016 |
| On approximability of clustering problems without candidate centers V Cohen-Addad, CS Karthik, E Lee Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 48 | 2021 |
| Inapproximability of H-Transversal/Packing V Guruswami, E Lee Proceedings of the 18th International Workshop on Approximation Algorithms …, 2015 | 48* | 2015 |
| An FPT Algorithm Beating 2-Approximation for k-Cut A Gupta, E Lee, J Li Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 47 | 2018 |
| Handling correlated rounding error via preclustering: A 1.73-approximation for correlation clustering V Cohen-Addad, E Lee, S Li, A Newman 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 41 | 2023 |
| Strong inapproximability results on balanced rainbow-colorable hypergraphs V Guruswami, E Lee Combinatorica 38 (3), 547-599, 2018 | 40 | 2018 |
| Understanding the cluster linear program for correlation clustering N Cao, V Cohen-Addad, E Lee, S Li, A Newman, L Vogl Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1605-1616, 2024 | 39 | 2024 |
| Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median V Cohen-Addad Viallat, F Grandoni, E Lee, C Schwiegelshohn Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 37 | 2023 |
| Losing treewidth by separating subsets A Gupta, E Lee, J Li, P Manurangsi, M Włodarczyk Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 36 | 2019 |
| Maximum matching in the online batch-arrival model E Lee, S Singla ACM Transactions on Algorithms (TALG) 16 (4), 1-31, 2020 | 34 | 2020 |
Vincent Cohen-AddadGoogle ResearchVerified email at google.com
