Radu Curticapean

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 36

Top Venues

Saarland University (PHD)

Education History

Saarland University

PHD

Publications

Radu Curticapean
Count on CFI graphs for #P-hardness. SODA (2024)
Andreas Björklund, Radu Curticapean, Thore Husfeldt, Petteri Kaski, Kevin Pratt
time? Fast deterministic set partitioning under the asymptotic rank conjecture. CoRR (2024)
Radu Curticapean, Daniel Neuen
Counting Small Induced Subgraphs: Hardness via Fourier Analysis. CoRR (2024)
Radu Curticapean
Count on CFI graphs for #P-hardness. CoRR (2023)
Radu Curticapean, Nutan Limaye, Srikanth Srinivasan
On the VNP-hardness of Some Monomial Symmetric Polynomials. Electron. Colloquium Comput. Complex. (2022)
Radu Curticapean
Determinants from Homomorphisms. ESA (2022)
Radu Curticapean
Determinants from homomorphisms. CoRR (2022)
Radu Curticapean, Mingji Xia
Parameterizing the Permanent: Hardness for fixed excluded minors. SOSA (2022)
Radu Curticapean, Nutan Limaye, Srikanth Srinivasan
On the VNP-Hardness of Some Monomial Symmetric Polynomials. FSTTCS (2022)
Radu Curticapean, Holger Dell, Thore Husfeldt
Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. ESA (2021)
Radu Curticapean
A full complexity dichotomy for immanant families. CoRR (2021)
Radu Curticapean, Holger Dell, Thore Husfeldt
Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths. CoRR (2021)
Radu Curticapean, Mingji Xia
-minor-free graphs. CoRR (2021)
Radu Curticapean
A full complexity dichotomy for immanant families. STOC (2021)
Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman, Saket Saurabh
Parameterized Streaming Algorithms for Min-Ones d-SAT. FSTTCS (2019)
Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
A Fixed-Parameter Perspective on #BIS. Algorithmica 81 (10) (2019)
Hubie Chen, Radu Curticapean, Holger Dell
The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms. WG (2019)
Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin
Finding Detours is Fixed-Parameter Tractable. SIAM J. Discret. Math. 33 (4) (2019)
Radu Curticapean, Holger Dell, Marc Roth
Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes. Theory Comput. Syst. 63 (5) (2019)
Radu Curticapean
Block interpolation: A framework for tight exponential-time counting complexity. Inf. Comput. 261 (2018)
Radu Curticapean, Nathan Lindzey, Jesper Nederlof
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. SODA (2018)
Radu Curticapean
Counting Problems in Parameterized Complexity. IPEC (2018)
Radu Curticapean, Nathan Lindzey, Jesper Nederlof
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. CoRR (2017)
Radu Curticapean, Holger Dell, Marc Roth
Counting edge-injective homomorphisms and matchings on restricted graph classes. CoRR (2017)
Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
A Fixed-Parameter Perspective on #BIS. IPEC (2017)
Radu Curticapean, Holger Dell, Dániel Marx
Homomorphisms Are a Good Basis for Counting Small Subgraphs. CoRR (2017)
Radu Curticapean, Holger Dell, Marc Roth
Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes. STACS (2017)
Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin
Finding Detours is Fixed-Parameter Tractable. ICALP (2017)
Radu Curticapean, Holger Dell, Dániel Marx
Homomorphisms are a good basis for counting small subgraphs. STOC (2017)
Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
A Fixed-Parameter Perspective on #BIS. CoRR (2017)
Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin
Finding Detours is Fixed-parameter Tractable. CoRR (2016)
Radu Curticapean
Counting Matchings with k Unmatched Vertices in Planar Graphs. ESA (2016)
Radu Curticapean, Dániel Marx
Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus. SODA (2016)
Radu Curticapean
Parity Separation: A Scientifically Proven Method for Permanent Weight Loss. ICALP (2016)
Radu Curticapean
Counting matchings with k unmatched vertices in planar graphs. CoRR (2016)
Radu Curticapean
The simple, little and slow things count: on parameterized counting complexity. Bull. EATCS 120 (2016)
Radu Curticapean
Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity. ICALP (1) (2015)
Radu Curticapean, Mingji Xia
Parameterizing the Permanent: Genus, Apices, Minors, Evaluation mod 2^k. CoRR (2015)
Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray
Counting Triangulations and Other Crossing-Free Structures via Onion Layers. Discret. Comput. Geom. 53 (4) (2015)
Radu Curticapean, Mingji Xia
Parameterizing the Permanent: Genus, Apices, Minors, Evaluation Mod 2k. FOCS (2015)
Radu Curticapean
Parity Separation: A Scientifically Proven Method for Permanent Weight Loss. CoRR (2015)
Radu Curticapean, Marvin Künnemann
A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems. Algorithmica 73 (3) (2015)
Radu Curticapean
Die einfachen, kleinen und langsamen Dinge zählen: Über die parametrisierte Komplexität von Zählproblemen. Ausgezeichnete Informatikdissertationen (2015)
Radu Curticapean
Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity. CoRR (2015)
Radu Curticapean
Counting perfect matchings in graphs that exclude a single-crossing minor. CoRR (2014)
Radu Curticapean, Dániel Marx
Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts. FOCS (2014)
Radu Curticapean, Dániel Marx
Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts. CoRR (2014)
Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray
Counting Triangulations and other Crossing-free Structures via Onion Layers. CoRR (2013)
Radu Curticapean
Counting Matchings of Size k Is W[1]-Hard. ICALP (1) (2013)
Radu Curticapean, Marvin Künnemann
A quantization framework for smoothed analysis on Euclidean optimization problems. CTW (2013)
Radu Curticapean, Marvin Künnemann
A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems. ESA (2013)
Markus Bläser, Radu Curticapean
Weighted Counting of k-Matchings Is #W[1]-Hard. IPEC (2012)
Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray
Counting crossing-free structures. SCG (2012)
Markus Bläser, Radu Curticapean
The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree. MFCS (2011)

Radu Curticapean.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Radu Curticapean