Radu Curticapean

Available identifiers

zbMath Open curticapean.raduMaRDI QIDQ893319

List of research outcomes

Publication	Date of Publication	Type
A full complexity dichotomy for immanant families	2023-11-14	Paper
Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths	2023-09-20	Paper
Count on CFI graphs for #P-hardness	2023-05-08	Paper
https://portal.mardi4nfdi.de/entity/Q5875640	2023-02-03	Paper
Determinants from homomorphisms	2022-04-22	Paper
https://portal.mardi4nfdi.de/entity/Q5009461	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5111385	2020-05-27	Paper
https://portal.mardi4nfdi.de/entity/Q5111872	2020-05-27	Paper
The Exponential Time complexity of counting (quantum) graph homomorphisms	2020-02-24	Paper
Finding Detours is Fixed-Parameter Tractable	2019-11-27	Paper
A fixed-parameter perspective on \#BIS	2019-09-10	Paper
Counting edge-injective homomorphisms and matchings on restricted graph classes	2019-08-27	Paper
https://portal.mardi4nfdi.de/entity/Q4967222	2019-07-03	Paper
Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus	2018-07-16	Paper
Block interpolation: a framework for tight exponential-time counting complexity	2018-06-14	Paper
https://portal.mardi4nfdi.de/entity/Q4636623	2018-04-19	Paper
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank	2018-03-15	Paper
https://portal.mardi4nfdi.de/entity/Q4606302	2018-03-02	Paper
Parity Separation: A Scientifically Proven Method for Permanent Weight Loss	2017-12-19	Paper
Homomorphisms are a good basis for counting small subgraphs	2017-08-17	Paper
A quantization framework for smoothed analysis of Euclidean optimization problems	2015-11-19	Paper
Block interpolation: a framework for tight exponential-time counting complexity	2015-10-27	Paper
Counting triangulations and other crossing-free structures via onion layers	2015-06-26	Paper
Counting crossing-free structures	2014-08-07	Paper
A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems	2013-09-17	Paper
Counting Matchings of Size k Is $\sharp$ W[1-Hard]	2013-08-06	Paper
Weighted Counting of k-Matchings Is #W[1-Hard]	2013-01-07	Paper
The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree	2011-08-17	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Radu Curticapean