Cenny Wenner is a PhD student in the Theoretical Computer Science group at the Royal Institute of Technology (KTH) and Stockholm University. His main supervisor is Johan Håstad and his co-supervisor is Viggo Kann. Wenner's broad research topic is inapproximability of NP-hard problems. More specifically, he studies 2-variable constraint satisfaction problems and the Unique Games and d-to-1 conjectures. He is working towards improved unconditional hardness of approximation results for 2-CSPs, and towards proving or circumventing the Unique Games and/or d-to-1 conjectures. Wenner is also interested in hard vs easy instances, SDP gaps, relations between variants, PCP/label cover variants, and neat general results.