Euiwoong Lee
Person information
- affiliation: Carnegie Mellon University
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2019
- [c26]Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff:
A PTAS for ℓp-Low Rank Approximation. SODA 2019: 747-766 - [c25]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 - [c24]Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk:
Losing Treewidth by Separating Subsets. SODA 2019: 1731-1749 - 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. Information 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. Discrete 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]
- [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]
- [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]
- [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
Vijay Bhattiprolu
aka: Vijay V. S. P. Bhattiprolu
aka: Vijay V. S. P. Bhattiprolu
last updated on 2019-01-10 22:21 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint