The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree. - Markus Bläser; Radu Curticapean (MFCS, 2011)

Counting crossing-free structures. - Victor Alvarez 001; Karl Bringmann; Radu Curticapean; Saurabh Ray (SCG, 2012)

Weighted Counting of k-Matchings Is #W[1]-Hard. - Markus Bläser; Radu Curticapean (IPEC, 2012)

Counting Matchings of Size k Is W[1]-Hard. - Radu Curticapean (ICALP (1), 2013)

Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts. - Radu Curticapean; Dániel Marx (FOCS, 2014)

Counting perfect matchings in graphs that exclude a single-crossing minor. - Radu Curticapean (CoRR, 2014)

Parameterizing the Permanent: Genus, Apices, Minors, Evaluation Mod 2k. - Radu Curticapean; Mingji Xia (FOCS, 2015)

Die einfachen, kleinen und langsamen Dinge zählen: Über die parametrisierte Komplexität von Zählproblemen. - Radu Curticapean (Ausgezeichnete Informatikdissertationen, 2015)

A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems. - Radu Curticapean; Marvin Künnemann (Algorithmica, 2015)

Parameterizing the Permanent: Genus, Apices, Minors, Evaluation mod 2^k. - Radu Curticapean; Mingji Xia (CoRR, 2015)

Counting Triangulations and Other Crossing-Free Structures via Onion Layers. - Victor Alvarez 001; Karl Bringmann; Radu Curticapean; Saurabh Ray (Discret. Comput. Geom., 2015)

The simple, little and slow things count: on parameterized counting complexity. - Radu Curticapean (2015)

Counting Matchings with k Unmatched Vertices in Planar Graphs. - Radu Curticapean (ESA, 2016)

Parity Separation: A Scientifically Proven Method for Permanent Weight Loss. - Radu Curticapean (ICALP, 2016)

Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus. - Radu Curticapean; Dániel Marx (SODA, 2016)

The simple, little and slow things count: on parameterized counting complexity. - Radu Curticapean (Bull. EATCS, 2016)

Homomorphisms are a good basis for counting small subgraphs. - Radu Curticapean; Holger Dell; Dániel Marx (STOC, 2017)

Counting Problems in Parameterized Complexity. - Radu Curticapean (IPEC, 2018)

A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. - Radu Curticapean; Nathan Lindzey; Jesper Nederlof (SODA, 2018)

Block interpolation: A framework for tight exponential-time counting complexity. - Radu Curticapean (Inf. Comput., 2018)

Parameterized Streaming Algorithms for Min-Ones d-SAT. - Akanksha Agrawal 001; Arindam Biswas 001; Édouard Bonnet; Nick Brettell; Radu Curticapean; Dániel Marx; Tillmann Miltzow; Venkatesh Raman 001; Saket Saurabh 001 (FSTTCS, 2019)

The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms. - Hubie Chen; Radu Curticapean; Holger Dell (WG, 2019)

A Fixed-Parameter Perspective on #BIS. - Radu Curticapean; Holger Dell; Fedor V. Fomin; Leslie Ann Goldberg; John Lapinskas (Algorithmica, 2019)

Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes. - Radu Curticapean; Holger Dell; Marc Roth (Theory Comput. Syst., 2019)

Finding Detours is Fixed-Parameter Tractable. - Ivona Bezáková; Radu Curticapean; Holger Dell; Fedor V. Fomin (SIAM J. Discret. Math., 2019)

Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. - Radu Curticapean; Holger Dell; Thore Husfeldt (ESA, 2021)

A full complexity dichotomy for immanant families. - Radu Curticapean (STOC, 2021)

Parameterizing the Permanent: Hardness for K8-minor-free graphs. - Radu Curticapean; Mingji Xia (CoRR, 2021)

Determinants from Homomorphisms. - Radu Curticapean (ESA, 2022)

Parameterizing the Permanent: Hardness for fixed excluded minors. - Radu Curticapean; Mingji Xia (SOSA, 2022)

On the VNP-hardness of Some Monomial Symmetric Polynomials. - Radu Curticapean; Nutan Limaye; Srikanth Srinivasan 001 (Electron. Colloquium Comput. Complex., 2022)

Count on CFI graphs for #P-hardness. - Radu Curticapean (SODA, 2024)

Chromatic number in 1.9999n time? Fast deterministic set partitioning under the asymptotic rank conjecture. - Andreas Björklund; Radu Curticapean; Thore Husfeldt; Petteri Kaski; Kevin Pratt (CoRR, 2024)

Monotone Bounded-Depth Complexity of Homomorphism Polynomials. - C. S. Bhargav; Shiteng Chen; Radu Curticapean; Prateek Dwivedi 001 (MFCS, 2025)

Which Graph Motif Parameters Count? - Markus Bläser; Radu Curticapean; Julian Dörfler; Christian Ikenmeyer (MFCS, 2025)

Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture. - Andreas Björklund; Radu Curticapean; Thore Husfeldt; Petteri Kaski; Kevin Pratt (SODA, 2025)

Counting Small Induced Subgraphs: Hardness via Fourier Analysis. - Radu Curticapean; Daniel Neuen (SODA, 2025)

Can You Link Up With Treewidth? - Radu Curticapean; Simon Döring; Daniel Neuen; Jiaheng Wang 002 (STACS, 2025)

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial. - Radu Curticapean; Simon Döring; Daniel Neuen (CoRR, 2025)

Faster Convolutions: Yates and Strassen Revisited. - Cornelius Brand; Radu Curticapean; Baitian Li; Kevin Pratt (CoRR, 2025)