Cenny Wenner is a Ph.D. student of the Theory Group at KTH Royal Institute of Technology and Stockholm University advised by professors Johan Håstad and Viggo Kann. His thesis topic is the hardness of approximating NP-hard optimization problems with a particular inclination towards studying the leverage points of modern techniques and whether the area really needs pesky unproven conjectures. In the author's spare time, he enjoys most geeky activities such as playing Go, Mahjong, programming, volunteering, and daydreaming about making a difference in the world when he grows up.