Helsinki · Finland
20–24 August 2018
13th International Symposium on Parameterized and Exact Computation
Radu Curticapean · IT University of Copenhagen
Counting Problems in Parameterized Complexity
Radu is currently a post-doc at Basic Algorithms Research Copenhagen (BARC) and the IT University of Copenhagen. Previously, he was a post-doc at the Institute for Computer Science and Control of the Hungarian Academy of Sciences (MTA SZTAKI) in Budapest, and also a research fellow at the Simons Institute for the Theory of Computation at UC Berkeley. He graduated from Saarland University in 2015 with his thesis "The simple, little and slow things count: on parameterized counting complexity", supervised by Markus Bläser.
Radu’s main research areas are counting complexity and parameterized complexity theory, lower bounds under the different exponential-time hypotheses, and he recently also became interested in the theory of graph limits.