Euiwoong Lee

Cited by

	All	Since 2019
Citations	1496	1289
h-index	21	19
i10-index	35	34

320

160

240

2014201520162017201820192020202120222023202410 17 27 46 94 136 154 184 230 263 318

Public access

View all

28 articles

1 article

available

not available

Based on funding mandates

Co-authors

Venkatesan GuruswamiUniversity of California, BerkeleyVerified email at berkeley.edu
Vincent Cohen-AddadGoogle Research (former CNRS & Sorbonne Université)Verified email at lip6.fr
Pasin ManurangsiGoogle ResearchVerified email at google.com
Madhur TulsianiTTI-ChicagoVerified email at ttic.edu
Sahil SinglaAssistant Professor, School of Computer Science, Georgia TechVerified email at gatech.edu
Kijung ShinAssociate Professor, KAISTVerified email at kaist.ac.kr
Christos FaloutsosCMUVerified email at cs.cmu.edu
Mohammad HammoudAssociate Teaching Professor, Carnegie Mellon University, QatarVerified email at cmu.edu
Jinoh OhAmazon AlexaVerified email at amazon.com
Vaggos ChatziafratisUniversity of California, Santa CruzVerified email at cs.stanford.edu
Melanie SchmidtHeinrich-Heine-Universität DüsseldorfVerified email at hhu.de
Sara AhmadianGoogle ResearchVerified email at google.com
Konstantin MakarychevNorthwestern UniversityVerified email at northwestern.edu
Grigory YaroslavtsevGeorge Mason UniversityVerified email at grigory.us
Alessandro EpastoSenior Staff Research Scientist at GoogleVerified email at google.com
Karl BringmannProfessor in Computer Science, Saarland UniversityVerified email at cs.uni-saarland.de
Pavel KolevPostdoc, Max Planck Institute for Intelligent SystemsVerified email at tuebingen.mpg.de
David WoodruffProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu
Michal WlodarczykUniversity of WarsawVerified email at mimuw.edu.pl
Katrina LigettHebrew UniversityVerified email at mail.huji.ac.il

Euiwoong Lee

University of Michigan

Verified email at umich.edu - Homepage

Theoretical computer science Approximation algorithms Hardness of approximation


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
APX-hardness of maximizing Nash social welfare with indivisible items E Lee Information Processing Letters 122, 17-20, 2017	116	2017
Improved and simplified inapproximability for k-means E Lee, M Schmidt, J Wright Information Processing Letters 120, 40-43, 2017	116	2017
Optimal online contention resolution schemes via ex-ante prophet inequalities E Lee, S Singla arXiv preprint arXiv:1806.09251, 2018	87	2018
Tight FPT Approximations for -Median and -Means V Cohen-Addad, A Gupta, A Kumar, E Lee, J Li arXiv preprint arXiv:1904.12334, 2019	84	2019
A survey on approximation in parameterized complexity: Hardness and algorithms AE Feldmann, E Lee, P Manurangsi Algorithms 13 (6), 146, 2020	81	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	76	2017
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	57	2019
Sum-of-squares certificates for maxima of random tensors on the sphere V Bhattiprolu, V Guruswami, E Lee arXiv preprint arXiv:1605.00903, 2016	46*	2016
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	45	2018
Inapproximability of H-Transversal/Packing V Guruswami, E Lee Proceedings of the 18th International Workshop on Approximation Algorithms …, 2015	44*	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	42	2018
Correlation clustering with sherali-adams V Cohen-Addad, E Lee, A Newman 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022	38	2022
Strong inapproximability results on balanced rainbow-colorable hypergraphs V Guruswami, E Lee Combinatorica 38 (3), 547-599, 2018	36	2018
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	35	2021
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	34	2019
Improved hardness for cut, interdiction, and firefighter problems E Lee arXiv preprint arXiv:1607.05133, 2016	32	2016
Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in ℓ_p-metrics V Cohen-Addad, E Lee Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022	30	2022
Weak Decoupling, Polynomial Folds and Approximate Optimization over the Sphere V Bhattiprolu, M Ghosh, V Guruswami, E Lee, M Tulsiani Foundations of Computer Science (FOCS), 2017 IEEE 58th Annual Symposium on …, 2017	29*	2017
Improved bounds on the price of stability in network cost sharing games E Lee, K Ligett Proceedings of the fourteenth ACM conference on Electronic commerce, 607-620, 2013	28	2013
Maximum matching in the online batch-arrival model E Lee, S Singla ACM Transactions on Algorithms (TALG) 16 (4), 1-31, 2020	27	2020

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors