Radu Curticapean

activity

20162026

most citedA Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank

1 citations · 4 across the 12 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

cs.CC2021★ 1 cited

Parameterizing the Permanent: Hardness for $K_{8}$ -minor-free graphs

Radu Curticapean, Mingji Xia

In the 1960s, statistical physicists discovered a fascinating algorithm for counting perfect matchings in planar graphs. Valiant later showed that the same problem is #P-hard for g…

cs.CC2021

Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths

Radu Curticapean, Holger Dell, Thore Husfeldt

We systematically investigate the complexity of counting subgraph patterns modulo fixed integers. For example, it is known that the parity of the number of $k$ -matchings can be det…

cs.CC2021

A full complexity dichotomy for immanant families

Radu Curticapean

Given an integer $n \geq 1$ and an irreducible character $χ_{λ}$ of $S_{n}$ for some partition $λ$ of $n$ , the immanant $imm_{λ} : C^{n \times n} \to C$ maps matri…

Parameterizing the Permanent: Hardness for K8​-minor-free graphs

Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths

A full complexity dichotomy for immanant families

Parameterizing the Permanent: Hardness for $K_{8}$ -minor-free graphs