Radu Curticapean joins BARC
BARC welcomes a new postdoc Radu Curticapean to the team.
Radu Curticapean joins BARC as a postdoctoral researcher as of March 2018. Radu received his PhD in 2015 from Saarland University, Germany, and has since been a postdoc at the Hungarian Academy of Sciences in Budapest, interrupted by a two-semester fellowship at the Simons Institute for the Theory of Computing in Berkeley.
Radu’s main research area is counting complexity, and his interests include parameterized and fine-grained complexity theory, graph minor theory and, somewhat recently, the theory of graph limits.
Radu received the 2016 EATCS Distinguished Dissertation Award for his doctoral thesis, supervised by Markus Bläser at Saarland University, holds best student paper awards from the European Symposium on Algorithms (2013, with Marvin Künnemann) and the International Colloquium on Automata, Languages, and Programming (2013 and 2015), and a best paper award from the International Symposium on Parameterized and Exact Computation (2017, with Dell, Fomin, Goldberg, and Lapinskas).
On Friday March 9 Radu will give his introduction talk in HCØ, Aud 08. For more info please check out the BARC Events site.
