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, my study is that of 2-variable constraint satisfaction problems and the Unique Games and d-to-1 conjectures. I am working towards improved unconditional hardness of approximation results for 2-CSPs and towrads proving or circumventing the Unique Games and/or d-to-1 conjectures. Peripherally, hard vs easy instances, SDP gaps, relation between variants, PCP/label cover variants, and neat general results.