Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarEuiwoong Lee
Person information
- affiliation: Carnegie Mellon University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[i35]Anupam Gupta, David G. Harris, Euiwoong Lee, Jason Li:
Optimal Bounds for the k-cut Problem. CoRR abs/2005.08301 (2020)
2010 – 2019
- 2019
- [j11]Euiwoong Lee
:
Partitioning a graph into small pieces with applications to path transversal. Math. Program. 177(1-2): 1-19 (2019) - [j10]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu:
Beating the 2-approximation factor for global bicut. Math. Program. 177(1-2): 291-320 (2019) - [c29]Prahladh Harsha, Subhash Khot, Euiwoong Lee, Devanathan Thiruvenkatachari:
Improved 3LIN Hardness via Linear Label Cover. APPROX-RANDOM 2019: 9:1-9:16 - [c28]Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li:
Tight FPT Approximations for k-Median and k-Means. ICALP 2019: 42:1-42:14 - [c27]Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff:
A PTAS for ℓp-Low Rank Approximation. SODA 2019: 747-766 - [c26]Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Approximability of p → q Matrix Norms: Generalized Krivine Rounding and Hypercontractive Hardness. SODA 2019: 1358-1368 - [c25]Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk:
Losing Treewidth by Separating Subsets. SODA 2019: 1731-1749 - [c24]Anupam Gupta, Euiwoong Lee, Jason Li:
The number of minimum k-cuts: improving the Karger-Stein bound. STOC 2019: 229-240 - [i34]Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li:
Tight FPT Approximations for $k$-Median and k-Means. CoRR abs/1904.12334 (2019) - [i33]Anupam Gupta, Euiwoong Lee, Jason Li:
The Number of Minimum k-Cuts: Improving the Karger-Stein Bound. CoRR abs/1906.00417 (2019) - [i32]Anupam Gupta, Euiwoong Lee, Jason Li:
The Karger-Stein Algorithm is Optimal for k-cut. CoRR abs/1911.09165 (2019) - [i31]Sara Ahmadian, Vaggos Chatziafratis, Alessandro Epasto, Euiwoong Lee, Mohammad Mahdian, Konstantin Makarychev, Grigory Yaroslavtsev:
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. CoRR abs/1912.06983 (2019) - [i30]Prahladh Harsha, Subhash Khot, Euiwoong Lee, Devanathan Thiruvenkatachari:
Improved 3LIN Hardness via Linear Label Cover. Electronic Colloquium on Computational Complexity (ECCC) 26: 93 (2019) - 2018
- [j9]Venkatesan Guruswami, Euiwoong Lee:
Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs. Combinatorica 38(3): 547-599 (2018) - [j8]Badih Ghazi, Euiwoong Lee:
LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes. IEEE Trans. Inf. Theory 64(6): 4423-4437 (2018) - [c23]Euiwoong Lee, Sahil Singla:
Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities. ESA 2018: 57:1-57:14 - [c22]Anupam Gupta, Euiwoong Lee, Jason Li:
Faster Exact and Approximate Algorithms for k-Cut. FOCS 2018: 113-123 - [c21]Kijung Shin, Mohammad Hammoud, Euiwoong Lee, Jinoh Oh, Christos Faloutsos:
Tri-Fly: Distributed Estimation of Global and Local Triangle Counts in Graph Streams. PAKDD (3) 2018: 651-663 - [c20]Anupam Gupta, Euiwoong Lee, Jason Li:
An FPT Algorithm Beating 2-Approximation for k-Cut. SODA 2018: 2821-2837 - [i29]Kijung Shin, Euiwoong Lee, Jinoh Oh, Mohammad Hammoud, Christos Faloutsos:
DiSLR: Distributed Sampling with Limited Redundancy For Triangle Counting in Graph Streams. CoRR abs/1802.04249 (2018) - [i28]Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Inapproximability of Matrix p→q Norms. CoRR abs/1802.07425 (2018) - [i27]Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk:
Losing Treewidth by Separating Subsets. CoRR abs/1804.01366 (2018) - [i26]Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Approximating Operator Norms via Generalized Krivine Rounding. CoRR abs/1804.03644 (2018) - [i25]Euiwoong Lee, Sahil Singla:
Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities. CoRR abs/1806.09251 (2018) - [i24]Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff:
A PTAS for 𝓁p-Low Rank Approximation. CoRR abs/1807.06101 (2018) - [i23]Anupam Gupta, Euiwoong Lee, Jason Li:
Faster Exact and Approximate Algorithms for k-Cut. CoRR abs/1807.08144 (2018) - [i22]Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Inapproximability of Matrix p→q Norms. Electronic Colloquium on Computational Complexity (ECCC) 25: 37 (2018) - [i21]Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Approximating Operator Norms via Generalized Krivine Rounding. Electronic Colloquium on Computational Complexity (ECCC) 25: 97 (2018) - 2017
- [j7]Euiwoong Lee, Melanie Schmidt, John Wright:
Improved and simplified inapproximability for k-means. Inf. Process. Lett. 120: 40-43 (2017) - [j6]Euiwoong Lee:
APX-hardness of maximizing Nash social welfare with indivisible items. Inf. Process. Lett. 122: 17-20 (2017) - [j5]Venkatesan Guruswami, Euiwoong Lee:
Nearly Optimal NP-Hardness of Unique Coverage. SIAM J. Comput. 46(3): 1018-1028 (2017) - [j4]Venkatesan Guruswami, Euiwoong Lee:
Inapproximability of H-Transversal/Packing. SIAM J. Discret. Math. 31(3): 1552-1571 (2017) - [j3]Venkatesan Guruswami, Euiwoong Lee:
Towards a Characterization of Approximation Resistance for Symmetric CSPs. Theory of Computing 13(1): 1-24 (2017) - [c19]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu:
Global and Fixed-Terminal Cuts in Digraphs. APPROX-RANDOM 2017: 2:1-2:20 - [c18]Vijay Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee:
Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere. APPROX-RANDOM 2017: 31:1-31:20 - [c17]Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Weak Decoupling, Polynomial Folds and Approximate Optimization over the Sphere. FOCS 2017: 1008-1019 - [c16]Guru Guruganesh, Euiwoong Lee:
Understanding the Correlation Gap For Matchings. FSTTCS 2017: 32:1-32:15 - [c15]Euiwoong Lee:
Improved Hardness for Cut, Interdiction, and Firefighter Problems. ICALP 2017: 92:1-92:14 - [c14]Kijung Shin, Euiwoong Lee, Dhivya Eswaran, Ariel D. Procaccia:
Why You Should Charge Your Friends for Borrowing Your Stuff. IJCAI 2017: 395-401 - [c13]Janardhan Kulkarni, Euiwoong Lee, Mohit Singh:
Minimum Birkhoff-von Neumann Decomposition. IPCO 2017: 343-354 - [c12]Euiwoong Lee, Sahil Singla:
Maximum Matching in the Online Batch-Arrival Model. IPCO 2017: 355-367 - [c11]Euiwoong Lee:
Partitioning a Graph into Small Pieces with Applications to Path Transversal. SODA 2017: 1546-1558 - [i20]Kijung Shin, Euiwoong Lee, Dhivya Eswaran, Ariel D. Procaccia:
Why You Should Charge Your Friends for Borrowing Your Stuff. CoRR abs/1705.07343 (2017) - [i19]Guru Guruganesh, Euiwoong Lee:
Understanding the Correlation Gap for Matchings. CoRR abs/1710.06339 (2017) - [i18]Anupam Gupta, Euiwoong Lee, Jason Li:
An FPT Algorithm Beating 2-Approximation for k-Cut. CoRR abs/1710.08488 (2017) - 2016
- [j2]Venkatesan Guruswami, Euiwoong Lee:
Complexity of Approximating CSP with Balance / Hard Constraints. Theory Comput. Syst. 59(1): 76-98 (2016) - [j1]Venkatesan Guruswami, Euiwoong Lee:
Simple Proof of Hardness of Feedback Vertex Set. Theory of Computing 12(1): 1-11 (2016) - [c10]Venkatesan Guruswami, Euiwoong Lee:
Nearly Optimal NP-Hardness of Unique Coverage. SODA 2016: 1724-1730 - [i17]Vijay V. S. P. Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee:
Certifying Random Polynomials over the Unit Sphere via Sum of Squares Hierarchy. CoRR abs/1605.00903 (2016) - [i16]Euiwoong Lee:
Partitioning a Graph into Small Pieces with Applications to Path Transversal. CoRR abs/1607.05122 (2016) - [i15]Euiwoong Lee:
Improved Hardness for Cut, Interdiction, and Firefighter Problems. CoRR abs/1607.05133 (2016) - [i14]Vijay V. S. P. Bhattiprolu, Mrinalkanti Ghosh, Euiwoong Lee, Venkatesan Guruswami, Madhur Tulsiani:
Multiplicative Approximations for Polynomial Optimization Over the Unit Sphere. CoRR abs/1611.05998 (2016) - [i13]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu:
Global and fixed-terminal cuts in digraphs. CoRR abs/1612.00156 (2016) - [i12]Vijay V. S. P. Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Multiplicative Approximations for Polynomial Optimization Over the Unit Sphere. Electronic Colloquium on Computational Complexity (ECCC) 23: 185 (2016) - 2015
- [c9]Vijay V. S. P. Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee:
Approximate Hypergraph Coloring under Low-discrepancy and Related Promises. APPROX-RANDOM 2015: 152-174 - [c8]Venkatesan Guruswami, Euiwoong Lee:
Inapproximability of H-Transversal/Packing. APPROX-RANDOM 2015: 284-304 - [c7]Venkatesan Guruswami, Euiwoong Lee:
Towards a Characterization of Approximation Resistance for Symmetric CSPs. APPROX-RANDOM 2015: 305-322 - [c6]Venkatesan Guruswami, Euiwoong Lee:
Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs. SODA 2015: 822-836 - [c5]Badih Ghazi, Euiwoong Lee:
LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes. SODA 2015: 1326-1342 - [c4]Euiwoong Lee:
Hardness of Graph Pricing Through Generalized Max-Dicut. STOC 2015: 391-399 - [i11]Venkatesan Guruswami, Euiwoong Lee:
Inapproximability of $H$-Transversal/Packing. CoRR abs/1506.06302 (2015) - [i10]Vijay V. S. P. Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee:
Approximate Hypergraph Coloring under Low-discrepancy and Related Promises. CoRR abs/1506.06444 (2015) - [i9]Euiwoong Lee:
APX-Hardness of Maximizing Nash Social Welfare with Indivisible Items. CoRR abs/1507.01159 (2015) - [i8]Euiwoong Lee, Melanie Schmidt, John Wright:
Improved and Simplified Inapproximability for k-means. CoRR abs/1509.00916 (2015) - [i7]Venkatesan Guruswami, Euiwoong Lee:
Towards a Characterization of Approximation Resistance for Symmetric CSPs. Electronic Colloquium on Computational Complexity (ECCC) 22: 105 (2015) - [i6]Venkatesan Guruswami, Euiwoong Lee:
Nearly Optimal NP-Hardness of Unique Coverage. Electronic Colloquium on Computational Complexity (ECCC) 22: 155 (2015) - 2014
- [c3]Venkatesan Guruswami, Euiwoong Lee:
Complexity of approximating CSP with balance / hard constraints. ITCS 2014: 439-448 - [i5]Euiwoong Lee:
Hardness of Graph Pricing through Generalized Max-Dicut. CoRR abs/1405.0740 (2014) - [i4]Badih Ghazi, Euiwoong Lee:
LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes. CoRR abs/1410.4241 (2014) - [i3]Venkatesan Guruswami, Euiwoong Lee:
Inapproximability of Feedback Vertex Set for Bounded Length Cycles. Electronic Colloquium on Computational Complexity (ECCC) 21: 6 (2014) - [i2]Venkatesan Guruswami, Euiwoong Lee:
Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs. Electronic Colloquium on Computational Complexity (ECCC) 21: 43 (2014) - 2013
- [c2]Euiwoong Lee, Katrina Ligett:
Improved bounds on the price of stability in network cost sharing games. EC 2013: 607-620 - [c1]Euiwoong Lee, Leonard J. Schulman:
Clustering Affine Subspaces: Hardness and Algorithms. SODA 2013: 810-827 - [i1]Venkatesan Guruswami, Euiwoong Lee:
Complexity of approximating CSP with Balance / Hard Constraints. Electronic Colloquium on Computational Complexity (ECCC) 20: 125 (2013)
Coauthor Index
aka: Vijay V. S. P. Bhattiprolu
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org and opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy.
Citation data
Add a list of citing articles from to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2020-05-23 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
