Radu Curticapean
Radu Curticapean
Basic Algorithms Research Copenhagen, IT University of Copenhagen
Verified email at itu.dk
Cited by
Cited by
Homomorphisms are a good basis for counting small subgraphs
R Curticapean, H Dell, D Marx
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
Complexity of counting subgraphs: Only the boundedness of the vertex-cover number counts
R Curticapean, D Marx
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 130-139, 2014
Counting Matchings of Size k is #W[1]-Hard
R Curticapean
Automata, Languages, and Programming, 352-363, 2013
Counting crossing-free structures
V Alvarez, K Bringmann, R Curticapean, S Ray
Proceedings of the twenty-eighth annual symposium on Computational geometry …, 2012
The simple, little and slow things count: on parameterized counting complexity
R Curticapean
Block interpolation: A framework for tight exponential-time counting complexity
R Curticapean
Information and Computation 261, 265-280, 2018
Weighted counting of k-matchings is #W [1]-hard
M Bläser, R Curticapean
Parameterized and Exact Computation, 171-181, 2012
Parameterizing the permanent: Genus, apices, minors, evaluation mod 2k
R Curticapean, M Xia
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 994-1009, 2015
Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus
R Curticapean, D Marx
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
Finding detours is fixed-parameter tractable
I Bezáková, R Curticapean, H Dell, FV Fomin
arXiv preprint arXiv:1607.07737, 2016
Counting perfect matchings in graphs that exclude a single-crossing minor
R Curticapean
arXiv preprint arXiv:1406.4056, 2014
Parity separation: A scientifically proven method for permanent weight loss
R Curticapean
arXiv preprint arXiv:1511.07480, 2015
A tight lower bound for counting Hamiltonian cycles via matrix rank
R Curticapea, N Lindzey, J Nederlof
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
The complexity of the cover polynomials for planar graphs of bounded degree
M Bläser, R Curticapean
International Symposium on Mathematical Foundations of Computer Science, 96-107, 2011
A fixed-parameter perspective on# BIS
R Curticapean, H Dell, F Fomin, LA Goldberg, J Lapinskas
Algorithmica 81 (10), 3844-3864, 2019
Counting edge-injective homomorphisms and matchings on restricted graph classes
R Curticapean, H Dell, M Roth
arXiv preprint arXiv:1702.05447, 2017
A quantization framework for smoothed analysis of Euclidean optimization problems
R Curticapean, M Künnemann
Algorithmica 73 (3), 483-510, 2015
Counting problems in parameterized complexity
R Curticapean
13th International Symposium on Parameterized and Exact Computation (IPEC 2018), 2019
Counting matchings with k unmatched vertices in planar graphs
R Curticapean
arXiv preprint arXiv:1607.08192, 2016
Counting edge-injective homomorphisms and matchings on restricted graph classes
R Curticapean, H Dell, M Roth
Theory of Computing Systems 63 (5), 987-1026, 2019
The system can't perform the operation now. Try again later.
Articles 1–20