Progress on pricing with peering. - Euiwoong Lee; David Buchfuhrer; Lachlan L. H. Andrew; Ao Tang; Steven H. Low (CISS, 2008)

Improved bounds on the price of stability in network cost sharing games. - Euiwoong Lee; Katrina Ligett (EC, 2013)

Clustering Affine Subspaces: Hardness and Algorithms. - Euiwoong Lee; Leonard J. Schulman (SODA, 2013)

Complexity of approximating CSP with Balance / Hard Constraints. - Venkatesan Guruswami; Euiwoong Lee (Electron. Colloquium Comput. Complex., 2013)

Inapproximability of Feedback Vertex Set for Bounded Length Cycles. - Venkatesan Guruswami; Euiwoong Lee (Electron. Colloquium Comput. Complex., 2014)

Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs. - Venkatesan Guruswami; Euiwoong Lee (Electron. Colloquium Comput. Complex., 2014)

Approximate Hypergraph Coloring under Low-discrepancy and Related Promises. - Vijay V. S. P. Bhattiprolu; Venkatesan Guruswami; Euiwoong Lee (APPROX-RANDOM, 2015)

Hardness of Graph Pricing Through Generalized Max-Dicut. - Euiwoong Lee (STOC, 2015)

Towards a Characterization of Approximation Resistance for Symmetric CSPs. - Venkatesan Guruswami; Euiwoong Lee (Electron. Colloquium Comput. Complex., 2015)

Certifying Random Polynomials over the Unit Sphere via Sum of Squares Hierarchy. - Vijay V. S. P. Bhattiprolu; Venkatesan Guruswami; Euiwoong Lee (CoRR, 2016)

Multiplicative Approximations for Polynomial Optimization Over the Unit Sphere. - Vijay V. S. P. Bhattiprolu; Mrinalkanti Ghosh; Venkatesan Guruswami; Euiwoong Lee; Madhur Tulsiani (Electron. Colloquium Comput. Complex., 2016)

Simple Proof of Hardness of Feedback Vertex Set. - Venkatesan Guruswami; Euiwoong Lee (Theory Comput., 2016)

Global and Fixed-Terminal Cuts in Digraphs. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Euiwoong Lee; Chao Xu 002 (APPROX-RANDOM, 2017)

Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere. - Vijay Bhattiprolu; Venkatesan Guruswami; Euiwoong Lee (APPROX-RANDOM, 2017)

Weak Decoupling, Polynomial Folds and Approximate Optimization over the Sphere. - Vijay Bhattiprolu; Mrinalkanti Ghosh; Venkatesan Guruswami; Euiwoong Lee; Madhur Tulsiani (FOCS, 2017)

Understanding the Correlation Gap For Matchings. - Guru Guruganesh; Euiwoong Lee (FSTTCS, 2017)

Improved Hardness for Cut, Interdiction, and Firefighter Problems. - Euiwoong Lee (ICALP, 2017)

Why You Should Charge Your Friends for Borrowing Your Stuff. - Kijung Shin; Euiwoong Lee; Dhivya Eswaran; Ariel D. Procaccia (IJCAI, 2017)

Minimum Birkhoff-von Neumann Decomposition. - Janardhan Kulkarni; Euiwoong Lee; Mohit Singh (IPCO, 2017)

An FPT Algorithm Beating 2-Approximation for k-Cut. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006 (CoRR, 2017)

APX-hardness of maximizing Nash social welfare with indivisible items. - Euiwoong Lee (Inf. Process. Lett., 2017)

Improved and simplified inapproximability for k-means. - Euiwoong Lee; Melanie Schmidt 001; John Wright 004 (Inf. Process. Lett., 2017)

Nearly Optimal NP-Hardness of Unique Coverage. - Venkatesan Guruswami; Euiwoong Lee (SIAM J. Comput., 2017)

Inapproximability of H-Transversal/Packing. - Venkatesan Guruswami; Euiwoong Lee (SIAM J. Discret. Math., 2017)

Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities. - Euiwoong Lee; Sahil Singla 001 (ESA, 2018)

Faster Exact and Approximate Algorithms for k-Cut. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006 (FOCS, 2018)

Tri-Fly: Distributed Estimation of Global and Local Triangle Counts in Graph Streams. - Kijung Shin; Mohammad Hammoud; Euiwoong Lee; Jinoh Oh; Christos Faloutsos (PAKDD (3), 2018)

An FPT Algorithm Beating 2-Approximation for k-Cut. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006 (SODA, 2018)

DiSLR: Distributed Sampling with Limited Redundancy For Triangle Counting in Graph Streams. - Kijung Shin; Euiwoong Lee; Jinoh Oh; Mohammad Hammoud; Christos Faloutsos (CoRR, 2018)

A PTAS for 𝓁p-Low Rank Approximation. - Frank Ban; Vijay Bhattiprolu; Karl Bringmann; Pavel Kolev; Euiwoong Lee; David P. Woodruff (CoRR, 2018)

Inapproximability of Matrix p→q Norms. - Vijay Bhattiprolu; Mrinalkanti Ghosh; Venkatesan Guruswami; Euiwoong Lee; Madhur Tulsiani (Electron. Colloquium Comput. Complex., 2018)

Approximating Operator Norms via Generalized Krivine Rounding. - Vijay Bhattiprolu; Mrinalkanti Ghosh; Venkatesan Guruswami; Euiwoong Lee; Madhur Tulsiani (Electron. Colloquium Comput. Complex., 2018)

LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes. - Badih Ghazi; Euiwoong Lee (IEEE Trans. Inf. Theory, 2018)

Tight FPT Approximations for k-Median and k-Means. - Vincent Cohen-Addad; Anupam Gupta 001; Amit Kumar 001; Euiwoong Lee; Jason Li 006 (ICALP, 2019)

A PTAS for ℓp-Low Rank Approximation. - Frank Ban; Vijay Bhattiprolu; Karl Bringmann; Pavel Kolev; Euiwoong Lee; David P. Woodruff (SODA, 2019)

Approximability of p → q Matrix Norms: Generalized Krivine Rounding and Hypercontractive Hardness. - Vijay Bhattiprolu; Mrinalkanti Ghosh; Venkatesan Guruswami; Euiwoong Lee; Madhur Tulsiani (SODA, 2019)

Losing Treewidth by Separating Subsets. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006; Pasin Manurangsi; Michal Wlodarczyk 001 (SODA, 2019)

The number of minimum k-cuts: improving the Karger-Stein bound. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006 (STOC, 2019)

The Number of Minimum k-Cuts: Improving the Karger-Stein Bound. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006 (CoRR, 2019)

Improved 3LIN Hardness via Linear Label Cover. - Prahladh Harsha; Subhash Khot; Euiwoong Lee; Devanathan Thiruvenkatachari (Electron. Colloquium Comput. Complex., 2019)

Beating the 2-approximation factor for global bicut. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Euiwoong Lee; Chao Xu 002 (Math. Program., 2019)

Partitioning a graph into small pieces with applications to path transversal. - Euiwoong Lee (Math. Program., 2019)

Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. - Vaggos Chatziafratis; Grigory Yaroslavtsev; Euiwoong Lee; Konstantin Makarychev; Sara Ahmadian; Alessandro Epasto; Mohammad Mahdian (AISTATS, 2020)

The Karger-Stein algorithm is optimal for k-cut. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006 (STOC, 2020)

A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms. - Andreas Emil Feldmann; Karthik C. S. 001; Euiwoong Lee; Pasin Manurangsi (Algorithms, 2020)

Optimal Bounds for the k-cut Problem. - Anupam Gupta 001; David G. Harris 001; Euiwoong Lee; Jason Li 006 (CoRR, 2020)

Inapproximability for Local Correlation Clustering and Dissimilarity Hierarchical Clustering. - Vaggos Chatziafratis; Neha Gupta; Euiwoong Lee (CoRR, 2020)

Maximum Matching in the Online Batch-arrival Model. - Euiwoong Lee; Sahil Singla 001 (ACM Trans. Algorithms, 2020)

On Approximability of Clustering Problems Without Candidate Centers. - Vincent Cohen-Addad; Karthik C. S. 001; Euiwoong Lee (SODA, 2021)

The Connectivity Threshold for Dense Graphs. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006 (SODA, 2021)

A framework for quadratic form maximization over convex sets through nonconvex relaxations. - Vijay Bhattiprolu; Euiwoong Lee; Assaf Naor (STOC, 2021)

Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in L_p metrics. - Vincent Cohen-Addad; Karthik C. S. 001; Euiwoong Lee (CoRR, 2021)

Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in $ ell_p$-metrics. - Vincent Cohen-Addad; Karthik C. S. 001; Euiwoong Lee (Electron. Colloquium Comput. Complex., 2021)

CoCoS: Fast and Accurate Distributed Triangle Counting in Graph Streams. - Kijung Shin; Euiwoong Lee; Jinoh Oh; Mohammad Hammoud; Christos Faloutsos (ACM Trans. Knowl. Discov. Data, 2021)

Correlation Clustering with Sherali-Adams. - Vincent Cohen-Addad; Euiwoong Lee; Alantha Newman (FOCS, 2022)

Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems. - Amir Abboud; Vincent Cohen-Addad; Euiwoong Lee; Pasin Manurangsi (ICALP, 2022)

Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck Problem. - Vijay Bhattiprolu; Euiwoong Lee; Madhur Tulsiani (ITCS, 2022)

Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in ℓp-metrics. - Vincent Cohen-Addad; Karthik C. S. 001; Euiwoong Lee (SODA, 2022)

A characterization of approximability for biased CSPs. - Euiwoong Lee; Suprovat Ghoshal (STOC, 2022)

Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion. - Jungho Ahn; Eun Jung Kim 002; Euiwoong Lee (Algorithmica, 2022)

Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median. - Vincent Cohen-Addad; Fabrizio Grandoni 001; Euiwoong Lee; Chris Schwiegelshohn (CoRR, 2022)

Optimal Bounds for the k-cut Problem. - Anupam Gupta 001; David G. Harris 001; Euiwoong Lee; Jason Li 006 (J. ACM, 2022)

On some variants of Euclidean k-supplier. - Euiwoong Lee; Viswanath Nagarajan; Lily Wang (Oper. Res. Lett., 2022)

Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering. - Vincent Cohen-Addad; Euiwoong Lee; Shi Li 001; Alantha Newman (FOCS, 2023)

On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPs. - Suprovat Ghoshal; Euiwoong Lee (FOCS, 2023)

Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median. - Vincent Cohen-Addad; Fabrizio Grandoni 001; Euiwoong Lee; Chris Schwiegelshohn (SODA, 2023)

A Local Search-Based Approach for Set Covering. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006 (SOSA, 2023)

On the Fine-Grained Complexity of Approximating k-Center in Sparse Graphs. - Amir Abboud; Vincent Cohen-Addad; Euiwoong Lee; Pasin Manurangsi (SOSA, 2023)

A PTAS for 𝓁0-Low Rank Approximation: Solving Dense CSPs over Reals. - Vincent Cohen-Addad; Chenglin Fan; Suprovat Ghoshal; Euiwoong Lee; Arnaud de Mesmay; Alantha Newman; Tony Chang Wang (CoRR, 2023)

Inapproximability of Matrix p → q Norms. - Vijay Bhattiprolu; Mrinal Kanti Ghosh; Venkatesan Guruswami; Euiwoong Lee; Madhur Tulsiani (SIAM J. Comput., 2023)

Strong hardness of approximation for tree transversals. - Euiwoong Lee; Pengxiang Wang 002 (Inf. Process. Lett., 2023)

Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs. - Euiwoong Lee; Pasin Manurangsi (ITCS, 2024)

Separating k -sc Median from the Supplier Version. - Aditya Anand 001; Euiwoong Lee (IPCO, 2024)

On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP. - Karthik C. S. 001; Euiwoong Lee; Pasin Manurangsi (IPEC, 2024)

Clustering with Non-adaptive Subset Queries. - Hadley Black; Euiwoong Lee; Arya Mazumdar; Barna Saha (NeurIPS, 2024)

Learning-Augmented Approximation Algorithms for Maximum Cut and Related Problems. - Vincent Cohen-Addad; Tommaso d'Orsi; Anupam Gupta 001; Euiwoong Lee; Debmalya Panigrahi (NeurIPS, 2024)

A PTAS for ℓ0-Low Rank Approximation: Solving Dense CSPs over Reals. - Vincent Cohen-Addad; Chenglin Fan; Suprovat Ghoshal; Euiwoong Lee; Arnaud de Mesmay; Alantha Newman; Tony Chang Wang (SODA, 2024)

Approximating Small Sparse Cuts. - Aditya Anand 001; Euiwoong Lee; Jason Li 006; Thatchaphol Saranurak (STOC, 2024)

Understanding the Cluster Linear Program for Correlation Clustering. - Nairen Cao; Vincent Cohen-Addad; Euiwoong Lee; Shi Li 001; Alantha Newman; Lukas Vogl (STOC, 2024)

Separating k-Median from the Supplier Version. - Aditya Anand 001; Euiwoong Lee (CoRR, 2024)

Max-Cut with ε-Accurate Predictions. - Vincent Cohen-Addad; Tommaso d'Orsi; Anupam Gupta 001; Euiwoong Lee; Debmalya Panigrahi (CoRR, 2024)

Understanding the Cluster LP for Correlation Clustering. - Nairen Cao; Vincent Cohen-Addad; Euiwoong Lee; Shi Li 001; Alantha Newman; Lukas Vogl (CoRR, 2024)

Asymptotically Optimal Hardness for k-Set Packing and k-Matroid Intersection. - Euiwoong Lee; Ola Svensson; Theophile Thiery (CoRR, 2024)

On Approximability of ℓ22 Min-Sum Clustering. - Karthik C. S. 001; Euiwoong Lee; Yuval Rabani; Chris Schwiegelshohn; Samson Zhou (CoRR, 2024)

Inapproximability of Sparsest Vector in a Real Subspace. - Vijay Bhattiprolu; Euiwoong Lee (Electron. Colloquium Comput. Complex., 2024)

Matroid-based TSP rounding for half-integral solutions. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006; Marcin Mucha; Heather Newman; Sherry Sarkar (Math. Program., 2024)

On Approximability of ℓ₂² Min-Sum Clustering. - Karthik C. S. 001; Euiwoong Lee; Yuval Rabani; Chris Schwiegelshohn; Samson Zhou (SoCG, 2025)

All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs. - Aditya Anand 001; Euiwoong Lee; Jason Li 006; Thatchaphol Saranurak (ICALP, 2025)

Facility Location on High-Dimensional Euclidean Spaces. - Euiwoong Lee; Kijun Shin (ITCS, 2025)

Unbreakable Decomposition in Close-to-Linear Time. - Aditya Anand 001; Euiwoong Lee; Jason Li 006; Yaowei Long; Thatchaphol Saranurak (SODA, 2025)

Min-CSPs on Complete Instances. - Aditya Anand 001; Euiwoong Lee; Amatya Sharma (SODA, 2025)

Solving the Correlation Cluster LP in Sublinear Time. - Nairen Cao; Vincent Cohen-Addad; Euiwoong Lee; Shi Li 001; David Rasmussen Lolck; Alantha Newman; Mikkel Thorup; Lukas Vogl; Shuyi Yan; Hanwen Zhang 003 (STOC, 2025)

A (2+ε)-Approximation Algorithm for Metric k-Median. - Vincent Cohen-Addad; Fabrizio Grandoni 001; Euiwoong Lee; Chris Schwiegelshohn; Ola Svensson (STOC, 2025)

Asymptotically Optimal Hardness for k-Set Packing and k-Matroid Intersection. - Euiwoong Lee; Ola Svensson; Theophile Thiery (STOC, 2025)

A constant-factor approximation for weighted bond cover. - Eun Jung Kim 002; Euiwoong Lee; Dimitrios M. Thilikos (J. Comput. Syst. Sci., 2025)

Fitting Metrics and Ultrametrics with Minimum Disagreements. - Vincent Cohen-Addad; Chenglin Fan; Euiwoong Lee; Arnaud de Mesmay (SIAM J. Comput., 2025)

A (2+ ϵ)-Approximation Algorithm for Metric k-Median. - Vincent Cohen-Addad; Fabrizio Grandoni 001; Euiwoong Lee; Chris Schwiegelshohn; Ola Svensson (CoRR, 2025)

Static to Dynamic Correlation Clustering. - Nairen Cao; Vincent Cohen-Addad; Euiwoong Lee; Shi Li 001; David Rasmussen Lolck; Alantha Newman; Mikkel Thorup; Lukas Vogl; Shuyi Yan; Hanwen Zhang 003 (CoRR, 2025)

Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT. - Aditya Anand 001; Euiwoong Lee; Davide Mazzali; Amatya Sharma (CoRR, 2025)

Improved Approximation Algorithms for Chromatic and Pseudometric-Weighted Correlation Clustering. - Dahoon Lee; Chenglin Fan; Euiwoong Lee (CoRR, 2025)

On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems. - Ian DeHaan; Neng Huang; Euiwoong Lee (CoRR, 2025)

Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson. - Jungho Ahn; Ian DeHaan; Eun Jung Kim 002; Euiwoong Lee (CoRR, 2025)

1.64-Approximation for Chromatic Correlation Clustering via Chromatic Cluster LP. - Dahoon Lee; Chenglin Fan; Euiwoong Lee (CoRR, 2025)