Euiwoong Lee
TitleCited byYear
Improved and simplified inapproximability for k-means
E Lee, M Schmidt, J Wright
Information Processing Letters 120, 40-43, 2017
402017
APX-hardness of maximizing Nash social welfare with indivisible items
E Lee
Information Processing Letters 122, 17-20, 2017
312017
Inapproximability of H-Transversal/Packing
V Guruswami, E Lee
Proceedings of the 18th International Workshop on Approximation Algorithms …, 2015
24*2015
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
232017
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
232013
Strong inapproximability results on balanced rainbow-colorable hypergraphs
V Guruswami, E Lee
Combinatorica 38 (3), 547-599, 2018
212018
Sum-of-squares certificates for maxima of random tensors on the sphere
V Bhattiprolu, V Guruswami, E Lee
arXiv preprint arXiv:1605.00903, 2016
18*2016
Improved hardness for cut, interdiction, and firefighter problems
E Lee
arXiv preprint arXiv:1607.05133, 2016
172016
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
162019
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
12*2017
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
112018
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
102018
Optimal online contention resolution schemes via ex-ante prophet inequalities
E Lee, S Singla
arXiv preprint arXiv:1806.09251, 2018
102018
Losing tree-width 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
82019
Tri-fly: Distributed estimation of global and local triangle counts in graph streams
K Shin, M Hammoud, E Lee, J Oh, C Faloutsos
Pacific-Asia Conference on Knowledge Discovery and Data Mining, 651-663, 2018
82018
Inapproximability of matrix p→ q norms
V Bhattiprolu, M Ghosh, V Guruswami, E Lee, M Tulsiani
arXiv preprint arXiv:1802.07425, 2018
82018
Simple proof of hardness of feedback vertex set
V Guruswami, E Lee
Theory of Computing 12 (1), 1-11, 2016
82016
Maximum matching in the online batch-arrival model
E Lee, S Singla
International Conference on Integer Programming and Combinatorial …, 2017
72017
Global and fixed-terminal cuts in digraphs
K Bérczi, K Chandrasekaran, T Király, E Lee, C Xu
arXiv preprint arXiv:1612.00156, 2016
72016
Hardness of Graph Pricing Through Generalized Max-Dicut
E Lee
Proceedings of the 47th Annual ACM Symposium on Theory of Computing, 391-399, 2015
72015
The system can't perform the operation now. Try again later.
Articles 1–20