Euiwoong Lee
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
52
Venues
11
Active years
2008–2026
Best venue rank
A*
Where they publish
Papers
52 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ICALP | Static to Dynamic Correlation Clustering. | Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan, Hanwen Zhang |
| 2026 | IPCO | 1.64-Approximation for Chromatic Correlation Clustering via Chromatic Cluster LP. | Chenglin Fan, Dahoon Lee, Euiwoong Lee |
| 2026 | STOC | A (4+ϵ)-Approximation for Euclidean k-Means via Non-monotone Dual-Fitting. | Moses Charikar, Vincent Cohen-Addad, Ruiquan Gao, Fabrizio Grandoni, Euiwoong Lee, Ernest van Wijland |
| 2026 | STOC | Combinatorial Optimization using Comparison Oracles. | Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Guru Guruganesh, Euiwoong Lee, Renato Paes Leme, Debmalya Panigrahi, Madhusudhan Reddy Pittu, Jon Schneider, David P. Woodruff |
| 2025 | FOCS | Inapproximability of Finding Sparse Vectors in Codes, Subspaces, and Lattices. | Vijay Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee, Xuandi Ren |
| 2025 | FOCS | An Improved Greedy Approximation for (Metric) k-Means. | Moses Charikar, Vincent Cohen-Addad, Ruiquan Gao, Fabrizio Grandoni, Euiwoong Lee, Ernest van Wijland |
| 2025 | ICALP | All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs. | Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak |
| 2025 | SODA | Unbreakable Decomposition in Close-to-Linear Time. | Aditya Anand, Euiwoong Lee, Jason Li, Yaowei Long, Thatchaphol Saranurak |
| 2025 | SODA | Min-CSPs on Complete Instances. | Aditya Anand, Euiwoong Lee, Amatya Sharma |
| 2025 | STOC | Solving the Correlation Cluster LP in Sublinear Time. | Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan, Hanwen Zhang |
| 2025 | STOC | A (2+ε)-Approximation Algorithm for Metric k-Median. | Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn, Ola Svensson |
| 2025 | STOC | Asymptotically Optimal Hardness for k-Set Packing and k-Matroid Intersection. | Euiwoong Lee, Ola Svensson, Theophile Thiery |
| 2024 | IPCO | Separating k -sc Median from the Supplier Version. | Aditya Anand, Euiwoong Lee |
| 2024 | SODA | A PTAS for | Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang |
| 2024 | STOC | Approximating Small Sparse Cuts. | Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak |
| 2024 | STOC | Understanding the Cluster Linear Program for Correlation Clustering. | Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, Lukas Vogl |
| 2023 | FOCS | Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering. | Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman |
| 2023 | FOCS | On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPs. | Suprovat Ghoshal, Euiwoong Lee |
| 2023 | SODA | Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to | Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn |
| 2022 | FOCS | Fitting Metrics and Ultrametrics with Minimum Disagreements. | Vincent Cohen-Addad, Chenglin Fan, Euiwoong Lee, Arnaud de Mesmay |
| 2022 | FOCS | Correlation Clustering with Sherali-Adams. | Vincent Cohen-Addad, Euiwoong Lee, Alantha Newman |
| 2022 | ICALP | Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems. | Amir Abboud, Vincent Cohen-Addad, Euiwoong Lee, Pasin Manurangsi |
| 2022 | IPCO | Matroid-Based TSP Rounding for Half-Integral Solutions. | Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar |
| 2022 | SODA | Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in ℓ | Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee |
| 2022 | STOC | A characterization of approximability for biased CSPs. | Euiwoong Lee, Suprovat Ghoshal |
| 2021 | SODA | On Approximability of Clustering Problems Without Candidate Centers. | Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee |
| 2021 | SODA | The Connectivity Threshold for Dense Graphs. | Anupam Gupta, Euiwoong Lee, Jason Li |
| 2021 | STOC | A framework for quadratic form maximization over convex sets through nonconvex relaxations. | Vijay Bhattiprolu, Euiwoong Lee, Assaf Naor |
| 2020 | AISTATS | Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. | Vaggos Chatziafratis, Grigory Yaroslavtsev, Euiwoong Lee, Konstantin Makarychev, Sara Ahmadian, Alessandro Epasto, Mohammad Mahdian |
| 2020 | ISAAC | Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion. | Jungho Ahn, Eun Jung Kim, Euiwoong Lee |
| 2020 | STOC | The Karger-Stein algorithm is optimal for k-cut. | Anupam Gupta, Euiwoong Lee, Jason Li |
| 2019 | ICALP | Tight FPT Approximations for k-Median and k-Means. | Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li |
| 2019 | SODA | A PTAS for ℓp-Low Rank Approximation. | Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff |
| 2019 | SODA | Approximability of p → q Matrix Norms: Generalized Krivine Rounding and Hypercontractive Hardness. | Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani |
| 2019 | SODA | Losing Treewidth by Separating Subsets. | Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk |
| 2019 | STOC | The number of minimum | Anupam Gupta, Euiwoong Lee, Jason Li |
| 2018 | ESA | Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities. | Euiwoong Lee, Sahil Singla |
| 2018 | FOCS | Faster Exact and Approximate Algorithms for k-Cut. | Anupam Gupta, Euiwoong Lee, Jason Li |
| 2018 | PAKDD | Tri-Fly: Distributed Estimation of Global and Local Triangle Counts in Graph Streams. | Kijung Shin, Mohammad Hammoud, Euiwoong Lee, Jinoh Oh, Christos Faloutsos |
| 2018 | SODA | An FPT Algorithm Beating 2-Approximation for | Anupam Gupta, Euiwoong Lee, Jason Li |
| 2017 | FOCS | Weak Decoupling, Polynomial Folds and Approximate Optimization over the Sphere. | Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani |
| 2017 | ICALP | Improved Hardness for Cut, Interdiction, and Firefighter Problems. | Euiwoong Lee |
| 2017 | IJCAI | Why You Should Charge Your Friends for Borrowing Your Stuff. | Kijung Shin, Euiwoong Lee, Dhivya Eswaran, Ariel D. Procaccia |
| 2017 | IPCO | Minimum Birkhoff-von Neumann Decomposition. | Janardhan Kulkarni, Euiwoong Lee, Mohit Singh |
| 2017 | IPCO | Maximum Matching in the Online Batch-Arrival Model. | Euiwoong Lee, Sahil Singla |
| 2017 | SODA | Partitioning a Graph into Small Pieces with Applications to Path Transversal. | Euiwoong Lee |
| 2016 | SODA | Nearly Optimal NP-Hardness of Unique Coverage. | Venkatesan Guruswami, Euiwoong Lee |
| 2015 | SODA | LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes. | Badih Ghazi, Euiwoong Lee |
| 2015 | SODA | Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs. | Venkatesan Guruswami, Euiwoong Lee |
| 2015 | STOC | Hardness of Graph Pricing Through Generalized Max-Dicut. | Euiwoong Lee |
| 2013 | SODA | Clustering Affine Subspaces: Hardness and Algorithms. | Euiwoong Lee, Leonard J. Schulman |
| 2008 | CISS | Progress on pricing with peering. | Euiwoong Lee, David Buchfuhrer, Lachlan L. H. Andrew, Ao Tang, Steven H. Low |