Euiwoong Lee is a Ph.D. student at Carnegie Mellon University, advised by Venkatesan Guruswami. He received his B.S. (2009) and M.S (2012) degrees from California Institute of Technology. Euiwoong is broadly interested in the approximate solvability of optimization problems, and his work has touched upon central topics in constraint satisfaction, graph theory, coding theory, game theory, combinatorial optimization and the power of linear/semidefinite programs. He has published in a variety of theoretical computer science conferences such as STOC, SODA, ITCS and EC. Euiwoong resolved a well-known open question on the approximability of a graph pricing problem where there are single-minded buyers each interested in a bundle of two items and the goal is to price items to maximize revenue. Euiwoong has also proved powerful hardness results for coloring hypergraphs that admit highly structured colorings. His work addresses all three aspects — algorithms, hardness and mathematical programming — that together bear upon the rich theory of approximability.