Radu Curticapean is a PhD student in the computational complexity group at Saarland University. His main research area is counting complexity. Curticapean is also interested in parameterized complexity theory (especially for counting problems), lower bounds under the different exponential-time hypotheses, graph minor theory and, to a lesser extent, smoothed analysis.