My main research interests are the following topics of theoretical computer science.
In the summer term of 2016 both „Parameterized Complexity“ (MA-INF 1211) and „Computational Complexity“ (MA-INF 1214) are offered. Despite the similar names these are fairly different lectures: PC is an algorithms-oriented lecture, and features only a small amount of hardness proofs when they are useful to show limitations of algorithms. CC is a complexity lecture containing essentially no algorithms, and focusing on the classification of problems as needing certain amounts of (usually) time or space to solving them.
SS 2016 Parameterized Complexity MA-INF 1211
SS 2016 Computational Complexity MA-INF 1214
SS 2016 Seminar Parameterized Complexity MA-INF 1212
SS 2016 Lab Parameterized Complexity MA-INF 1317
WS 2016/17 Logik und diskrete Strukturen BA-INF 011 (send email if you would like to be a tutor)
If you would like to be a tutor for this lecture please send an email to Mrs. Bertram.
WS 2016/17 Seminar Parameterized Complexity MA-INF 1212
SS 2017 Parameterized Complexity MA-INF 1211
SS 2017 Lab Parameterized Complexity MA-INF 1317 (send email if you want a lab in WS 2016/17!)
It is intended to have the lab every summer. If you would like to take the lab in the winter term then contact me by email.
|Since January 2015||Professor for theoretical computer science at University of Bonn|
|November 2012 - December 2014||Junior research group leader at Technical University Berlin|
|September 2012 - October 2012||Postdoc at Max-Planck-Institute for Informatics|
|September 2010 - October 2012||Postdoc at Utrecht University working with Hans L. Bodlaender|
|March 2008 - August 2010||PhD student at Max-Planck-Institute for Informatics in Saarbrücken supervised by Kurt Mehlhorn|
|October 2002 - February 2008||Studies in Computer Science at Friedrich-Schiller University in Jena|
* Member of IPEC steering committee from 2016 to 2019
An up to date list of my publications can be found at dblp.org.