Sotabase

Career

· Research Fellow, Simons Institute for the Theory of Computing2017–
· PhD student, Carnegie Mellon University2013–
· Former MSc, California Institute of Technology
· Assistant Professor in Computer Science and Engineering, University of Michigan

Publications (50)

Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities
2018
80
cited
Tight FPT Approximations for $k$-Median and k-Means
2019
73
cited
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
2020
71
cited
Correlation Clustering with Sherali-Adams
2022
56
cited
A PTAS for 𝓁p-Low Rank Approximation
2019
40
cited
Faster Exact and Approximate Algorithms for k-Cut
2018
40
cited
An FPT Algorithm Beating 2-Approximation for k-Cut
2017
35
cited
Maximum Matching in the Online Batch-arrival Model
2017
28
cited
Losing Treewidth by Separating Subsets
2018
27
cited
On Approximability of Clustering Problems Without Candidate Centers
2020
27
cited
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection
2019
25
cited
Conference on Integer Programming and Combinatorial Optimization · 2017
24
cited
Pacific-Asia Conference on Knowledge Discovery and Data Mining · 2018
21
cited
Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median
2022
20
cited
Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in ℓp-metrics
2022
20
cited
Electron. Colloquium Comput. Complex. · 2018
19
cited
Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in L_p metrics
2021
19
cited
The number of minimum k-cuts: improving the Karger-Stein bound
2019
19
cited
Optimal Bounds for the k-cut Problem
2020
16
cited
ACM Transactions on Knowledge Discovery from Data · 2018
14
cited
Sotabase
Euiwoong Lee | Researcher Profile | Sotabase | Sotabase