I am a PhD student in the research training group
Methods
for Discrete Structures at the
Humboldt University of Berlin.
My advisor is Martin Grohe.
During my MSc-studies, I was at
Saarland University
and at the
Max Planck Institute
for Computer Science in Saarbrücken, Germany.
My current research focuses on subexponential time complexity
and sparsifiability.
Contact
or request it
here.+49-30-2093-3116 (Phone) / +49-30-2093-3081 (Fax)
| Office: Haus IV, Room 4.425 Johann von Neumann-Haus Rudower Chaussee 25 D-12489 Berlin |
Postal Address: Humboldt-Universität zu Berlin Institut für Informatik Unter den Linden 6 D-10099 Berlin |
Publications
- Satisfiability Allows No Nontrivial Sparsification Unless
The Polynomial-Time Hierarchy Collapses
with Dieter van Melkebeek.
in preparation. - Exponential Time Complexity of the Permanent
and the Tutte Polynomial
with Thore Husfeldt and Martin Wahlén.
in preparation. - Complexity of the Bollobás-Riordan Polynomial
with Markus Bläser and Johann Makowsky.
Theory of Computing Systems (conference version: CSR 2008: 86-98). - Complexity and Approximability of the Cover
Polynomial
with Markus Bläser and Mahmoud Fouz.
to appear. - Complexity of the Cover Polynomial
with Markus Bläser.
ICALP 2007: 801-812.
Education
| since 2007 | PhD-student at the Humboldt University of Berlin. |
| 2007 | MSc Computer Science at
Saarland University.
Master's Thesis "Complexity of the Cover Polynomial". |
| 2006 | BSc Computer Science at
Saarland University.
Bachelor's Thesis "Seed Points in PDE-Driven Interpolation". |
Trivia
Some links, pointing to resources about English, LaTeX, Travelling, and Music.