Saarland University
Department of Computer Science
Computational Complexity
Computational Complexity




Radu Curticapean

I'm a post-doc at Basic Algorithms Research Copenhagen (BARC). Previously I 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 in Berkeley. Before all that, I was a PhD student in the computational complexity group at Saarland University and defended my thesis in 2015.

My main research area is counting complexity. I am 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, in smoothed analysis.

Contact Information

Lágymányosi u. 11.
H-1111 Budapest
Email: [my first name].[my last name] at gmail dot com

Selected Recent Publications

For a full list, please consider my DBLP page.

A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank
Radu Curticapean, Nathan Lindzey, Jesper Nederlof
Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018)
Homomorphisms Are a Good Basis for Counting Small Subgraphs
Radu Curticapean, Holger Dell, Dániel Marx
49th Annual ACM Symposium on the Theory of Computing (STOC 2017)
Tight Conditional Lower Bounds for Counting Perfect Matchings on Graphs of Bounded Treewidth and Cliquewidth
Radu Curticapean, Dániel Marx
27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016)
Parameterizing the Permanent: Genus, Apices, Minors, Evaluation mod 2^k
Radu Curticapean, Mingji Xia
56th Annual Symposium on Foundations of Computer Science (FOCS 2015)
Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity.
Radu Curticapean
42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015)

Teaching Support

Links you might find useful