Sangxia Huang is a Ph.D. student at KTH Royal Institute of Technology, Stockholm, Sweden, advised by Johan Håstad. His research interest is computational complexity, and in particular, approximation algorithms and hardness of approximation for Constraint Satisfaction Problems (CSPs) and other combinatorial optimization problems. He grew up in Shanghai, China, and spent his undergraduate days at Shanghai Jiao Tong University. During his spare time, he enjoys reading, playing billiards, and traveling. He is also an avid Arsenal fan.