Cenny Wenner,
homepage of

I am a PhD student of the Theoretical Computer Science group at the Royal Institute of Technology (KTH) and Stockholm University. My main supervisor is Johan Håstad and my co-supervisor is Viggo Kann.

My broad research topic is that of Johan's group, inapproximability of NP-hard problems. More specifically I study PCPs and the unique games conjecture. In particular, I am interested in when gap unique games are easy and when they are equivalent to the unique games conjecture. I'm working on topics such as graphs of certain degree, integrality gaps, expansion properties, variants of UGC, and reductions between variants of unique games and NP-hard problems.