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.

Interests and Current Research
Approximation Algorithms
Hardness of Approximation
Spectral Graph Theory

Simple Proof of Hardness of Feedback Vertex Set (ECCC)
with Venkatesan Guruswami

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

Towards a Characterization of Approximation Resistance for Symmetric CSPs (ECCC)
with Venkatesan Guruswami

Inapproximability of H-Transversal/Packing (arXiv)
with Venkatesan Guruswami

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

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

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

Clustering Affine Spaces: 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.