Euiwoong Lee - RankMe

176 papers A* 43A 9B 7Misc 1Journal 105Unranked 11

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Accelerating Scientific Research with Gemini: Case Studies and Common Techniques. CoRR David P. Woodruff, Vincent Cohen-Addad, Lalit Jain, Jieming Mao, Song Zuo, MohammadHossein Bateni, Simina Brânzei, Michael P. Brenner, Lin Chen, Ying Feng, Lance Fortnow, Gang Fu, Ziyi Guan, Zahra Hadizadeh, Mohammad T. Hajiaghayi, Mahdi JafariRaviz, Adel Javanmard, Karthik C. S., Ken-ichi Kawarabayashi, Ravi Kumar, Silvio Lattanzi, Euiwoong Lee, Yi Li, Ioannis Panageas, Dimitris Paparas, Benjamin Przybocki, Bernardo Subercaseaux, Ola Svensson, Shayan Taherijam, Xuan Wu, Eylon Yogev, Morteza Zadimoghaddam, Samson Zhou, Yossi Matias, James Manyika, Vahab Mirrokni
2026	J	`jnl`	Improved SDP-Based Algorithm for Coloring 3-Colorable Graphs. CoRR Nikhil Bansal, Neng Huang, Euiwoong Lee
2025	J	`jnl`	1.64-Approximation for Chromatic Correlation Clustering via Chromatic Cluster LP. CoRR Dahoon Lee, Chenglin Fan, Euiwoong Lee
2025	J	`jnl`	A (2+ ϵ)-Approximation Algorithm for Metric CoRR Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn, Ola Svensson
2025	A*	`conf`	A (2+ε)-Approximation Algorithm for Metric k-Median. STOC Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn, Ola Svensson
2025	J	`jnl`	A constant-factor approximation for weighted bond cover. J. Comput. Syst. Sci. Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos
2025	A*	`conf`	All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs. ICALP Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak
2025	J	`jnl`	All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs. CoRR Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak
2025	A*	`conf`	An Improved Greedy Approximation for (Metric) k-Means. FOCS Moses Charikar, Vincent Cohen-Addad, Ruiquan Gao, Fabrizio Grandoni, Euiwoong Lee, Ernest van Wijland
2025	A	`conf`	Approximating Maximum Cut on Interval Graphs and Split Graphs Beyond Goemans-Williamson. APPROX/RANDOM Jungho Ahn, Ian DeHaan, Eun Jung Kim, Euiwoong Lee
2025	J	`jnl`	Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson. CoRR Jungho Ahn, Ian DeHaan, Eun Jung Kim, Euiwoong Lee
2025	A*	`conf`	Asymptotically Optimal Hardness for k-Set Packing and k-Matroid Intersection. STOC Euiwoong Lee, Ola Svensson, Theophile Thiery
2025	J	`jnl`	Combinatorial Optimization using Comparison Oracles. CoRR Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Guru Guruganesh, Euiwoong Lee, Debmalya Panigrahi, Madhusudhan Reddy Pittu, Jon Schneider, David P. Woodruff
2025	B	`conf`	Complexity of Local Search for CSPs Parameterized by Constraint Difference. IPEC Aditya Anand, Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Euiwoong Lee, Debmalya Panigrahi, Sijin Peng
2025	J	`jnl`	Complexity of Local Search for CSPs Parameterized by Constraint Difference. CoRR Aditya Anand, Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Euiwoong Lee, Debmalya Panigrahi, Sijin Peng
2025	A	`conf`	Facility Location on High-Dimensional Euclidean Spaces. ITCS Euiwoong Lee, Kijun Shin
2025	J	`jnl`	Facility Location on High-dimensional Euclidean Spaces. CoRR Euiwoong Lee, Kijun Shin
2025	J	`jnl`	Fitting Metrics and Ultrametrics with Minimum Disagreements. SIAM J. Comput. Vincent Cohen-Addad, Chenglin Fan, Euiwoong Lee, Arnaud de Mesmay
2025	J	`jnl`	Improved Approximation Algorithms for Chromatic and Pseudometric-Weighted Correlation Clustering. CoRR Dahoon Lee, Chenglin Fan, Euiwoong Lee
2025	A*	`conf`	Inapproximability of Finding Sparse Vectors in Codes, Subspaces, and Lattices. FOCS Vijay Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee, Xuandi Ren
2025	A	`conf`	Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT. APPROX/RANDOM Aditya Anand, Euiwoong Lee, Davide Mazzali, Amatya Sharma
2025	J	`jnl`	Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT. CoRR Aditya Anand, Euiwoong Lee, Davide Mazzali, Amatya Sharma
2025	A*	`conf`	Min-CSPs on Complete Instances. SODA Aditya Anand, Euiwoong Lee, Amatya Sharma
2025	A*	`conf`	On Approximability of ℓ₂² Min-Sum Clustering. SoCG Karthik C. S., Euiwoong Lee, Yuval Rabani, Chris Schwiegelshohn, Samson Zhou
2025	J	`jnl`	On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP. Algorithmica Karthik C. S., Euiwoong Lee, Pasin Manurangsi
2025	A	`conf`	On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems. APPROX/RANDOM Ian DeHaan, Neng Huang, Euiwoong Lee
2025	J	`jnl`	On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems. CoRR Ian DeHaan, Neng Huang, Euiwoong Lee
2025	A*	`conf`	Solving the Correlation Cluster LP in Sublinear Time. STOC Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan, Hanwen Zhang
2025	J	`jnl`	Solving the Correlation Cluster LP in Sublinear Time. CoRR Nairen Cao, Vincent Cohen-Addad, Shi Li, Euiwoong Lee, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan, Hanwen Zhang
2025	J	`jnl`	Static to Dynamic Correlation Clustering. CoRR Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan, Hanwen Zhang
2025	A*	`conf`	Unbreakable Decomposition in Close-to-Linear Time. SODA Aditya Anand, Euiwoong Lee, Jason Li, Yaowei Long, Thatchaphol Saranurak
2024	A*	`conf`	A PTAS for SODA Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang
2024	A*	`conf`	Approximating Small Sparse Cuts. STOC Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak
2024	J	`jnl`	Approximating Small Sparse Cuts. CoRR Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak
2024	J	`jnl`	Asymptotically Optimal Hardness for CoRR Euiwoong Lee, Ola Svensson, Theophile Thiery
2024	A*	`conf`	Clustering with Non-adaptive Subset Queries. NeurIPS Hadley Black, Euiwoong Lee, Arya Mazumdar, Barna Saha
2024	J	`jnl`	Clustering with Non-adaptive Subset Queries. CoRR Hadley Black, Euiwoong Lee, Arya Mazumdar, Barna Saha
2024	A	`conf`	Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs. ITCS Euiwoong Lee, Pasin Manurangsi
2024	J	`jnl`	Inapproximability of Sparsest Vector in a Real Subspace. CoRR Vijay Bhattiprolu, Euiwoong Lee
2024	J	`jnl`	Inapproximability of Sparsest Vector in a Real Subspace. Electron. Colloquium Comput. Complex. Vijay Bhattiprolu, Euiwoong Lee
2024	A*	`conf`	Learning-Augmented Approximation Algorithms for Maximum Cut and Related Problems. NeurIPS Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Euiwoong Lee, Debmalya Panigrahi
2024	J	`jnl`	Matroid-based TSP rounding for half-integral solutions. Math. Program. Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar
2024	J	`jnl`	Max-Cut with ε-Accurate Predictions. CoRR Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Euiwoong Lee, Debmalya Panigrahi
2024	J	`jnl`	Min-CSPs on Complete Instances. CoRR Aditya Anand, Euiwoong Lee, Amatya Sharma
2024	J	`jnl`	On Approximability of ℓ CoRR Karthik C. S., Euiwoong Lee, Yuval Rabani, Chris Schwiegelshohn, Samson Zhou
2024	B	`conf`	On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP. IPEC Karthik C. S., Euiwoong Lee, Pasin Manurangsi
2024	J	`jnl`	On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP. CoRR Karthik C. S., Euiwoong Lee, Pasin Manurangsi
2024	B	`conf`	Separating k -sc Median from the Supplier Version. IPCO Aditya Anand, Euiwoong Lee
2024	J	`jnl`	Separating k-Median from the Supplier Version. CoRR Aditya Anand, Euiwoong Lee
2024	J	`jnl`	Unbreakable Decomposition in Close-to-Linear Time. CoRR Aditya Anand, Euiwoong Lee, Jason Li, Yaowei Long, Thatchaphol Saranurak
2024	J	`jnl`	Understanding the Cluster LP for Correlation Clustering. CoRR Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, Lukas Vogl
2024	A*	`conf`	Understanding the Cluster Linear Program for Correlation Clustering. STOC Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, Lukas Vogl
2023	—	`conf`	A Local Search-Based Approach for Set Covering. SOSA Anupam Gupta, Euiwoong Lee, Jason Li
2023	J	`jnl`	A PTAS for 𝓁 CoRR Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang
2023	A*	`conf`	Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to SODA Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn
2023	A*	`conf`	Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering. FOCS Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman
2023	J	`jnl`	Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering. CoRR Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman
2023	J	`jnl`	Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs. CoRR Euiwoong Lee, Pasin Manurangsi
2023	J	`jnl`	Inapproximability of Matrix p → q Norms. SIAM J. Comput. Vijay Bhattiprolu, Mrinal Kanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani
2023	A*	`conf`	On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPs. FOCS Suprovat Ghoshal, Euiwoong Lee
2023	J	`jnl`	On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPs. CoRR Suprovat Ghoshal, Euiwoong Lee
2023	—	`conf`	On the Fine-Grained Complexity of Approximating SOSA Amir Abboud, Vincent Cohen-Addad, Euiwoong Lee, Pasin Manurangsi
2023	J	`jnl`	Strong hardness of approximation for tree transversals. Inf. Process. Lett. Euiwoong Lee, Pengxiang Wang
2022	J	`jnl`	A Characterization of Approximability for Biased CSPs. CoRR Suprovat Ghoshal, Euiwoong Lee
2022	J	`jnl`	A Local Search-Based Approach for Set Covering. CoRR Anupam Gupta, Euiwoong Lee, Jason Li
2022	A*	`conf`	A characterization of approximability for biased CSPs. STOC Euiwoong Lee, Suprovat Ghoshal
2022	J	`jnl`	Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median. CoRR Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn
2022	A*	`conf`	Correlation Clustering with Sherali-Adams. FOCS Vincent Cohen-Addad, Euiwoong Lee, Alantha Newman
2022	J	`jnl`	Correlation Clustering with Sherali-Adams. CoRR Vincent Cohen-Addad, Euiwoong Lee, Alantha Newman
2022	A*	`conf`	Fitting Metrics and Ultrametrics with Minimum Disagreements. FOCS Vincent Cohen-Addad, Chenglin Fan, Euiwoong Lee, Arnaud de Mesmay
2022	J	`jnl`	Fitting Metrics and Ultrametrics with Minimum Disagreements. CoRR Vincent Cohen-Addad, Chenglin Fan, Euiwoong Lee, Arnaud de Mesmay
2022	A*	`conf`	Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems. ICALP Amir Abboud, Vincent Cohen-Addad, Euiwoong Lee, Pasin Manurangsi
2022	J	`jnl`	Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems. CoRR Amir Abboud, Vincent Cohen-Addad, Euiwoong Lee, Pasin Manurangsi
2022	A*	`conf`	Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in ℓ SODA Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee
2022	B	`conf`	Matroid-Based TSP Rounding for Half-Integral Solutions. IPCO Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar
2022	J	`jnl`	On some variants of Euclidean k-supplier. Oper. Res. Lett. Euiwoong Lee, Viswanath Nagarajan, Lily Wang
2022	J	`jnl`	Optimal Bounds for the J. ACM Anupam Gupta, David G. Harris, Euiwoong Lee, Jason Li
2022	A	`conf`	Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck Problem. ITCS Vijay Bhattiprolu, Euiwoong Lee, Madhur Tulsiani
2022	J	`jnl`	Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion. Algorithmica Jungho Ahn, Eun Jung Kim, Euiwoong Lee
2021	—	`conf`	A Constant-Factor Approximation for Weighted Bond Cover. APPROX-RANDOM Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos
2021	J	`jnl`	A Constant-factor Approximation for Weighted Bond Cover. CoRR Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos
2021	A*	`conf`	A framework for quadratic form maximization over convex sets through nonconvex relaxations. STOC Vijay Bhattiprolu, Euiwoong Lee, Assaf Naor
2021	J	`jnl`	CoCoS: Fast and Accurate Distributed Triangle Counting in Graph Streams. ACM Trans. Knowl. Discov. Data Kijung Shin, Euiwoong Lee, Jinoh Oh, Mohammad Hammoud, Christos Faloutsos
2021	J	`jnl`	Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in $\ell_p$-metrics. Electron. Colloquium Comput. Complex. Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee
2021	J	`jnl`	Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in L_p metrics. CoRR Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee
2021	J	`jnl`	Matroid-Based TSP Rounding for Half-Integral Solutions. CoRR Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar
2021	A*	`conf`	On Approximability of Clustering Problems Without Candidate Centers. SODA Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee
2021	J	`jnl`	On Some Variants of Euclidean K-Supplier. CoRR Euiwoong Lee, Viswanath Nagarajan, Lily Wang
2021	J	`jnl`	Strong Hardness of Approximation for Tree Transversals. CoRR Euiwoong Lee, Pengxiang Wang
2021	A*	`conf`	The Connectivity Threshold for Dense Graphs. SODA Anupam Gupta, Euiwoong Lee, Jason Li
2020	J	`jnl`	A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms. Algorithms Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi
2020	J	`jnl`	A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms. CoRR Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi
2020	J	`jnl`	A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms. Electron. Colloquium Comput. Complex. Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi
2020	A	`conf`	Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. AISTATS Vaggos Chatziafratis, Grigory Yaroslavtsev, Euiwoong Lee, Konstantin Makarychev, Sara Ahmadian, Alessandro Epasto, Mohammad Mahdian
2020	J	`jnl`	Inapproximability for Local Correlation Clustering and Dissimilarity Hierarchical Clustering. CoRR Vaggos Chatziafratis, Neha Gupta, Euiwoong Lee
2020	J	`jnl`	Maximum Matching in the Online Batch-arrival Model. ACM Trans. Algorithms Euiwoong Lee, Sahil Singla
2020	J	`jnl`	On Approximability of Clustering Problems Without Candidate Centers. CoRR Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee
2020	J	`jnl`	Optimal Bounds for the k-cut Problem. CoRR Anupam Gupta, David G. Harris, Euiwoong Lee, Jason Li
2020	A*	`conf`	The Karger-Stein algorithm is optimal for k-cut. STOC Anupam Gupta, Euiwoong Lee, Jason Li
2020	B	`conf`	Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion. ISAAC Jungho Ahn, Eun Jung Kim, Euiwoong Lee
2020	J	`jnl`	Towards constant-factor approximation for chordal / distance-hereditary vertex deletion. CoRR Jungho Ahn, Eun Jung Kim, Euiwoong Lee
2019	A*	`conf`	A PTAS for ℓp-Low Rank Approximation. SODA Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff
2019	A*	`conf`	Approximability of p → q Matrix Norms: Generalized Krivine Rounding and Hypercontractive Hardness. SODA Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani
2019	J	`jnl`	Beating the 2-approximation factor for global bicut. Math. Program. Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
2019	J	`jnl`	Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. CoRR Sara Ahmadian, Vaggos Chatziafratis, Alessandro Epasto, Euiwoong Lee, Mohammad Mahdian, Konstantin Makarychev, Grigory Yaroslavtsev
2019	—	`conf`	Improved 3LIN Hardness via Linear Label Cover. APPROX-RANDOM Prahladh Harsha, Subhash Khot, Euiwoong Lee, Devanathan Thiruvenkatachari
2019	J	`jnl`	Improved 3LIN Hardness via Linear Label Cover. Electron. Colloquium Comput. Complex. Prahladh Harsha, Subhash Khot, Euiwoong Lee, Devanathan Thiruvenkatachari
2019	A*	`conf`	Losing Treewidth by Separating Subsets. SODA Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk
2019	J	`jnl`	Partitioning a graph into small pieces with applications to path transversal. Math. Program. Euiwoong Lee
2019	J	`jnl`	The Karger-Stein Algorithm is Optimal for k-cut. CoRR Anupam Gupta, Euiwoong Lee, Jason Li
2019	J	`jnl`	The Number of Minimum k-Cuts: Improving the Karger-Stein Bound. CoRR Anupam Gupta, Euiwoong Lee, Jason Li
2019	A*	`conf`	The number of minimum STOC Anupam Gupta, Euiwoong Lee, Jason Li
2019	J	`jnl`	Tight FPT Approximations for $k$-Median and k-Means. CoRR Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li
2019	A*	`conf`	Tight FPT Approximations for k-Median and k-Means. ICALP Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li
2018	J	`jnl`	A PTAS for 𝓁 CoRR Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff
2018	A*	`conf`	An FPT Algorithm Beating 2-Approximation for SODA Anupam Gupta, Euiwoong Lee, Jason Li
2018	J	`jnl`	Approximating Operator Norms via Generalized Krivine Rounding. CoRR Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani
2018	J	`jnl`	Approximating Operator Norms via Generalized Krivine Rounding. Electron. Colloquium Comput. Complex. Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani
2018	J	`jnl`	DiSLR: Distributed Sampling with Limited Redundancy For Triangle Counting in Graph Streams. CoRR Kijung Shin, Euiwoong Lee, Jinoh Oh, Mohammad Hammoud, Christos Faloutsos
2018	A*	`conf`	Faster Exact and Approximate Algorithms for k-Cut. FOCS Anupam Gupta, Euiwoong Lee, Jason Li
2018	J	`jnl`	Faster Exact and Approximate Algorithms for k-Cut. CoRR Anupam Gupta, Euiwoong Lee, Jason Li
2018	J	`jnl`	Inapproximability of Matrix p→q Norms. CoRR Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani
2018	J	`jnl`	Inapproximability of Matrix p→q Norms. Electron. Colloquium Comput. Complex. Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani
2018	J	`jnl`	LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes. IEEE Trans. Inf. Theory Badih Ghazi, Euiwoong Lee
2018	J	`jnl`	Losing Treewidth by Separating Subsets. CoRR Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk
2018	A	`conf`	Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities. ESA Euiwoong Lee, Sahil Singla
2018	J	`jnl`	Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities. CoRR Euiwoong Lee, Sahil Singla
2018	J	`jnl`	Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs. Comb. Venkatesan Guruswami, Euiwoong Lee
2018	—	`conf`	Tri-Fly: Distributed Estimation of Global and Local Triangle Counts in Graph Streams. PAKDD (3) Kijung Shin, Mohammad Hammoud, Euiwoong Lee, Jinoh Oh, Christos Faloutsos
2017	J	`jnl`	APX-hardness of maximizing Nash social welfare with indivisible items. Inf. Process. Lett. Euiwoong Lee
2017	J	`jnl`	An FPT Algorithm Beating 2-Approximation for k-Cut. CoRR Anupam Gupta, Euiwoong Lee, Jason Li
2017	—	`conf`	Global and Fixed-Terminal Cuts in Digraphs. APPROX-RANDOM Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
2017	A*	`conf`	Improved Hardness for Cut, Interdiction, and Firefighter Problems. ICALP Euiwoong Lee
2017	J	`jnl`	Improved and simplified inapproximability for k-means. Inf. Process. Lett. Euiwoong Lee, Melanie Schmidt, John Wright
2017	J	`jnl`	Inapproximability of H-Transversal/Packing. SIAM J. Discret. Math. Venkatesan Guruswami, Euiwoong Lee
2017	B	`conf`	Maximum Matching in the Online Batch-Arrival Model. IPCO Euiwoong Lee, Sahil Singla
2017	B	`conf`	Minimum Birkhoff-von Neumann Decomposition. IPCO Janardhan Kulkarni, Euiwoong Lee, Mohit Singh
2017	J	`jnl`	Nearly Optimal NP-Hardness of Unique Coverage. SIAM J. Comput. Venkatesan Guruswami, Euiwoong Lee
2017	A*	`conf`	Partitioning a Graph into Small Pieces with Applications to Path Transversal. SODA Euiwoong Lee
2017	—	`conf`	Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere. APPROX-RANDOM Vijay Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee
2017	J	`jnl`	Towards a Characterization of Approximation Resistance for Symmetric CSPs. Theory Comput. Venkatesan Guruswami, Euiwoong Lee
2017	—	`conf`	Understanding the Correlation Gap For Matchings. FSTTCS Guru Guruganesh, Euiwoong Lee
2017	J	`jnl`	Understanding the Correlation Gap for Matchings. CoRR Guru Guruganesh, Euiwoong Lee
2017	A*	`conf`	Weak Decoupling, Polynomial Folds and Approximate Optimization over the Sphere. FOCS Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani
2017	A*	`conf`	Why You Should Charge Your Friends for Borrowing Your Stuff. IJCAI Kijung Shin, Euiwoong Lee, Dhivya Eswaran, Ariel D. Procaccia
2017	J	`jnl`	Why You Should Charge Your Friends for Borrowing Your Stuff. CoRR Kijung Shin, Euiwoong Lee, Dhivya Eswaran, Ariel D. Procaccia
2016	J	`jnl`	Certifying Random Polynomials over the Unit Sphere via Sum of Squares Hierarchy. CoRR Vijay V. S. P. Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee
2016	J	`jnl`	Complexity of Approximating CSP with Balance / Hard Constraints. Theory Comput. Syst. Venkatesan Guruswami, Euiwoong Lee
2016	J	`jnl`	Global and fixed-terminal cuts in digraphs. CoRR Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
2016	J	`jnl`	Improved Hardness for Cut, Interdiction, and Firefighter Problems. CoRR Euiwoong Lee
2016	J	`jnl`	Multiplicative Approximations for Polynomial Optimization Over the Unit Sphere. CoRR Vijay V. S. P. Bhattiprolu, Mrinalkanti Ghosh, Euiwoong Lee, Venkatesan Guruswami, Madhur Tulsiani
2016	J	`jnl`	Multiplicative Approximations for Polynomial Optimization Over the Unit Sphere. Electron. Colloquium Comput. Complex. Vijay V. S. P. Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani
2016	A*	`conf`	Nearly Optimal NP-Hardness of Unique Coverage. SODA Venkatesan Guruswami, Euiwoong Lee
2016	J	`jnl`	Partitioning a Graph into Small Pieces with Applications to Path Transversal. CoRR Euiwoong Lee
2016	J	`jnl`	Simple Proof of Hardness of Feedback Vertex Set. Theory Comput. Venkatesan Guruswami, Euiwoong Lee
2015	J	`jnl`	APX-Hardness of Maximizing Nash Social Welfare with Indivisible Items. CoRR Euiwoong Lee
2015	—	`conf`	Approximate Hypergraph Coloring under Low-discrepancy and Related Promises. APPROX-RANDOM Vijay V. S. P. Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee
2015	J	`jnl`	Approximate Hypergraph Coloring under Low-discrepancy and Related Promises. CoRR Vijay V. S. P. Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee
2015	A*	`conf`	Hardness of Graph Pricing Through Generalized Max-Dicut. STOC Euiwoong Lee
2015	J	`jnl`	Improved and Simplified Inapproximability for k-means. CoRR Euiwoong Lee, Melanie Schmidt, John Wright
2015	J	`jnl`	Inapproximability of $H$-Transversal/Packing. CoRR Venkatesan Guruswami, Euiwoong Lee
2015	—	`conf`	Inapproximability of H-Transversal/Packing. APPROX-RANDOM Venkatesan Guruswami, Euiwoong Lee
2015	A*	`conf`	LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes. SODA Badih Ghazi, Euiwoong Lee
2015	J	`jnl`	Nearly Optimal NP-Hardness of Unique Coverage. Electron. Colloquium Comput. Complex. Venkatesan Guruswami, Euiwoong Lee
2015	A*	`conf`	Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs. SODA Venkatesan Guruswami, Euiwoong Lee
2015	—	`conf`	Towards a Characterization of Approximation Resistance for Symmetric CSPs. APPROX-RANDOM Venkatesan Guruswami, Euiwoong Lee
2015	J	`jnl`	Towards a Characterization of Approximation Resistance for Symmetric CSPs. Electron. Colloquium Comput. Complex. Venkatesan Guruswami, Euiwoong Lee
2014	A	`conf`	Complexity of approximating CSP with balance / hard constraints. ITCS Venkatesan Guruswami, Euiwoong Lee
2014	J	`jnl`	Hardness of Graph Pricing through Generalized Max-Dicut. CoRR Euiwoong Lee
2014	J	`jnl`	Inapproximability of Feedback Vertex Set for Bounded Length Cycles. Electron. Colloquium Comput. Complex. Venkatesan Guruswami, Euiwoong Lee
2014	J	`jnl`	LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes. CoRR Badih Ghazi, Euiwoong Lee
2014	J	`jnl`	Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs. Electron. Colloquium Comput. Complex. Venkatesan Guruswami, Euiwoong Lee
2013	A*	`conf`	Clustering Affine Subspaces: Hardness and Algorithms. SODA Euiwoong Lee, Leonard J. Schulman
2013	J	`jnl`	Complexity of approximating CSP with Balance / Hard Constraints. Electron. Colloquium Comput. Complex. Venkatesan Guruswami, Euiwoong Lee
2013	A*	`conf`	Improved bounds on the price of stability in network cost sharing games. EC Euiwoong Lee, Katrina Ligett
2008	Misc	`conf`	Progress on pricing with peering. CISS Euiwoong Lee, David Buchfuhrer, Lachlan L. H. Andrew, Ao Tang, Steven H. Low