My Photo

Euiwoong Lee


7503 Gates Hillman Center
Computer Science Department
Carnegie Mellon University

Email: euiwoonl at cs dot cmu dot edu

I am a PhD student at the Computer Science Department at Carnegie Mellon University. I am fortunate to be advised by Venkatesan Guruswami. I am supported by Samsung Scholarship and Simons Award for Graduate Students in TCS.

Interests and Current Research
Approximation Algorithms
Hardness of Approximation
Convex Hierarchies (e.g., Sum of Squares, Sherali-Adams)

Improved Hardness for Cut, Interdiction, and Firefighter Problems (arXiv)

Multistage Matching and Vertex Cover
with Sahil Singla

Maximum Matchings in Non-uniform Random Graphs
with Guru Guruganesh

Partitioning a Graph into Small Pieces with Applications to Path Transversal (arXiv)

Certifying Random Polynomials over the Unit Sphere via Sum of Squares Hierarchy (arXiv)
with Vijay Bhattiprolu and Venkatesan Guruswami

APX-Hardness of Maximizing Nash Social Welfare with Indivisible Items (arXiv)

Improved and Simplified Inapproximability for k-means (arXiv)
with Melanie Schmidt and John Wright

Simple Proof of Hardness of Feedback Vertex Set (ToC)
with Venkatesan Guruswami
Theory of Computing '16 (Note)

Nearly Optimal NP-hardness of Unique Coverage (ECCC)
with Venkatesan Guruswami
SODA '16

Approximate Hypergraph Coloring under Low-discrepancy and Related Promises (arXiv)
with Vijay Bhattiprolu and Venkatesan Guruswami

Towards a Characterization of Approximation Resistance for Symmetric CSPs (ECCC)
with Venkatesan Guruswami
Journal version: To appear in Theory of Computing (Invited)

Inapproximability of H-Transversal/Packing (arXiv)
with Venkatesan Guruswami
Earlier version: Inapproximability of Feedback Vertex Set for Bounded Length Cycles (ECCC)

Hardness of Graph Pricing Through Generalized Max-Dicut (arXiv)
STOC '15

Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs (ECCC)
with Venkatesan Guruswami
SODA '15
Journal version: To appear in Combinatorica

LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes (arXiv)
with Badih Ghazi
SODA '15

Complexity of Approximating CSP with Balance/Hard Constraints (ECCC)
with Venkatesan Guruswami
ITCS '14
Journal version: Theory of Computing Systems '16 (Link)

Improved Bounds on the Price of Stability in Network Cost Sharing Games (PDF)
with Katrina Ligett
EC '13

Clustering Affine Subspaces: Hardness and Algorithms (PDF)
with Leonard Schulman
SODA '13

Progress on Pricing with Peering (PDF)
with David Buchfuhrer, Lachlan Andrew, Ao Tang, and Steven Low
CISS '08

Pricing in the Presence of Peering (PDF)
with David Buchfuhrer, Lachlan Andrew, Ao Tang, and Steven Low
Allerton '07

Here is my CV.