Euiwoong Lee

Contact

Address:
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


Education
PhD, Computer Science, Carnegie Mellon University, 2012-Present.
MS, Computer Science, Caltech, 2012.
BS, Computer Science and Mathematics, Caltech, 2009.


Publications
Hardness of Graph Pricing Through Generalized Max-Dicut (arXiv)
Submitted

Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs (ECCC)
with Venkatesan Guruswami
Submitted

Inapproximability of Feedback Vertex Set for Bounded Length Cycles (ECCC)
with Venkatesan Guruswami
Submitted

Complexity of Approximating CSP with Balance/Hard Constraints (ECCC)
with Venkatesan Guruswami
in Innovations in Theoretical Computer Science (ITCS) 2014

Improved Bounds on the Price of Stability in Network Cost Sharing Games (PDF)
with Katrina Ligett
in ACM Conference on Electronic Commerce (EC) 2013

Clustering Affine Spaces: Hardness and Algorithms (PDF)
with Leonard Schulman
in ACM-SIAM Symposium on Discrete Algorithms (SODA) 2013

Progress on Pricing with Peering (PDF)
with David Buchfuhrer, Lachlan Andrew, Ao Tang, and Steven Low
in Conference on Information Sciences and Systems (CISS) 2008

Pricing in the Presence of Peering (PDF)
with David Buchfuhrer, Lachlan Andrew, Ao Tang, and Steven Low
in Allerton Conference on Communication, Control and Computing 2007

Here is my CV.