| 2025 | ESA | Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial. | Radu Curticapean, Simon Dring, Daniel Neuen |
| 2025 | MFCS | Monotone Bounded-Depth Complexity of Homomorphism Polynomials. | C. S. Bhargav, Shiteng Chen, Radu Curticapean, Prateek Dwivedi |
| 2025 | MFCS | Which Graph Motif Parameters Count? | Markus Blser, Radu Curticapean, Julian Drfler, Christian Ikenmeyer |
| 2025 | SODA | Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture. | Andreas Bjrklund, Radu Curticapean, Thore Husfeldt, Petteri Kaski, Kevin Pratt |
| 2025 | SODA | Counting Small Induced Subgraphs: Hardness via Fourier Analysis. | Radu Curticapean, Daniel Neuen |
| 2025 | STACS | Can You Link Up With Treewidth? | Radu Curticapean, Simon Dring, Daniel Neuen, Jiaheng Wang |
| 2024 | SODA | Count on CFI graphs for #P-hardness. | Radu Curticapean |
| 2022 | ESA | Determinants from Homomorphisms. | Radu Curticapean |
| 2021 | ESA | Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. | Radu Curticapean, Holger Dell, Thore Husfeldt |
| 2021 | STOC | A full complexity dichotomy for immanant families. | Radu Curticapean |
| 2019 | WG | The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms. | Hubie Chen, Radu Curticapean, Holger Dell |
| 2018 | SODA | A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. | Radu Curticapean, Nathan Lindzey, Jesper Nederlof |
| 2017 | ICALP | Finding Detours is Fixed-Parameter Tractable. | Ivona Bezkov, Radu Curticapean, Holger Dell, Fedor V. Fomin |
| 2017 | STOC | Homomorphisms are a good basis for counting small subgraphs. | Radu Curticapean, Holger Dell, Dniel Marx |
| 2017 | STACS | Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes. | Radu Curticapean, Holger Dell, Marc Roth |
| 2016 | ESA | Counting Matchings with k Unmatched Vertices in Planar Graphs. | Radu Curticapean |
| 2016 | ICALP | Parity Separation: A Scientifically Proven Method for Permanent Weight Loss. | Radu Curticapean |
| 2016 | SODA | Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus. | Radu Curticapean, Dniel Marx |
| 2015 | FOCS | Parameterizing the Permanent: Genus, Apices, Minors, Evaluation Mod 2k. | Radu Curticapean, Mingji Xia |
| 2015 | ICALP | Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity. | Radu Curticapean |
| 2014 | FOCS | Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts. | Radu Curticapean, Dniel Marx |
| 2013 | ESA | A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems. | Radu Curticapean, Marvin Knnemann |
| 2013 | ICALP | Counting Matchings of Size k Is W[1]-Hard. | Radu Curticapean |
| 2011 | MFCS | The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree. | Markus Blser, Radu Curticapean |