Radu Curticapean
Radu Curticapean
Bestätigte E-Mail-Adresse bei
Zitiert von
Zitiert von
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
The simple, little and slow things count: on parameterized counting complexity
R Curticapean
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
Block interpolation: A framework for tight exponential-time counting complexity
R Curticapean
Information and Computation 261, 265-280, 2018
Finding detours is fixed-parameter tractable
I Bezáková, R Curticapean, H Dell, FV Fomin
SIAM Journal on Discrete Mathematics 33 (4), 2326-2345, 2019
Counting crossing-free structures
V Alvarez, K Bringmann, R Curticapean, S Ray
Proceedings of the twenty-eighth annual symposium on Computational geometry …, 2012
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
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
Counting problems in parameterized complexity
R Curticapean
13th international symposium on parameterized and exact computation (IPEC 2018), 2019
Weighted counting of k-matchings is #W [1]-hard
M Bläser, R Curticapean
Parameterized and Exact Computation, 171-181, 2012
Counting perfect matchings in graphs that exclude a single-crossing minor
R Curticapean
arXiv preprint arXiv:1406.4056, 2014
A fixed-parameter perspective on# BIS
R Curticapean, H Dell, F Fomin, LA Goldberg, J Lapinskas
Algorithmica 81, 3844-3864, 2019
A full complexity dichotomy for immanant families
R Curticapean
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
Parity separation: A scientifically proven method for permanent weight loss
R Curticapean
arXiv preprint arXiv:1511.07480, 2015
The exponential-time complexity of counting (quantum) graph homomorphisms
H Chen, R Curticapean, H Dell
Graph-Theoretic Concepts in Computer Science: 45th International Workshop …, 2019
The complexity of the cover polynomials for planar graphs of bounded degree
M Bläser, R Curticapean
Mathematical Foundations of Computer Science 2011: 36th International …, 2011
Parameterizing the Permanent: Hardness for fixed excluded minors
R Curticapean, M Xia
Symposium on Simplicity in Algorithms (SOSA), 297-307, 2022
Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths
R Curticapean, H Dell, T Husfeldt
arXiv preprint arXiv:2107.00629, 2021
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20