Saarland University
Department of Computer Science
Computational Complexity
Computational Complexity




Radu Curticapean

I was a PhD student in the computational complexity group at Saarland University and defended my thesis in June 2015. Currently, I am a post-doc at the Institute for Computer Science and Control of the Hungarian Academy of Sciences. Fortunately, this rather unwieldy name abbreviates to MTA SZTAKI. At said place, I'm part of the PARAMTIGHT group. For two semesters, I also was a fellow at the Simons Institute in Berkeley.

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

Address: Universität des Saarlandes
Campus Geb E1 3
Postfach 42 (Bläser)
66123 Saarbrücken
Office: Building E1.3 423
Phone: +49 681 302-5585
Email: [my last name] at


Radu Curticapean.
Counting Matchings with k Unmatched Vertices in Planar Graphs
24th European Symposium on Algorithms (ESA 2016). To appear.
Radu Curticapean.
Parity Separation: A Scientifically Proven Method for Permanent Weight Loss.
43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). To appear.
Radu Curticapean and Dániel Marx.
Tight Conditional Lower Bounds for Counting Perfect Matchings on Graphs of Bounded Treewidth and Cliquewidth
27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016).
Radu Curticapean and Mingji Xia.
Parameterizing the Permanent: Genus, Apices, Minors, Evaluation mod 2^k
56th Annual Symposium on Foundations of Computer Science (FOCS 2015).
Radu Curticapean.
Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity.
42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015).
Radu Curticapean, Dániel Marx.
Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts
55th Annual Symposium on Foundations of Computer Science (FOCS 2014).
Radu Curticapean, Marvin Künnemann.
A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems.
21st European Symposium on Algorithms (ESA 2013).
Radu Curticapean.
Counting Matchings of Size k is #W[1]-hard.
40th International Colloquium on Automata, Languages and Programming (ICALP 2013).
Markus Bläser, Radu Curticapean.
Weighted Counting of k-Matchings is #W[1]-hard
7th International Symposium on Parameterized and Exact Computation (IPEC 2012).
Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray.
Counting Crossing Free Structures
Symposuim on Computational Geometry 2012 (SoCG 2012).
Markus Bläser, Radu Curticapean.
The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree
36th International Symposium on Mathematical Foundations of Computer Science (MFCS 2011).

Teaching Support

Links you might find useful