RC
Radu Curticapean
cs.CCcs.DSmath.COcs.DMmath.RTcs.CGcs.LOcs.SC
On Valency
published · living versionsW_cyr6d6kg·v1 · currentpublished
W_cn6fa5jx·v1published
Preprints & journals
27 papers in the corpus · 2013–2026When Are Monomial Symmetric Polynomials Hard?2610.25181v1 · Markus Blaser, Radu Curticapean, Sagnik Dutta et al.2026 · 0 citationsarXivon Valency
A Dense Weisfeiler-Leman Algorithm for Deciding Bounded-Cliquewidth Homomorphism Indistinguishability2608.13382v1 · Radu Curticapean, Daniel Neuen, Amir Nikabadi et al.2026 · 0 citationsarXiv
Counting Small Induced Subgraphs: Hardness of Symmetry-Based Properties2606.31803v2 · Radu Curticapean, Mingjun Liu2026 · 0 citationsarXiv
Planar Perfect Matching Counting is as Hard as Determinants2606.03975v1 · Radu Curticapean, Jiaheng Wang2026 · 0 citationsarXiv
Beyond Bilinear Complexity: What Works and What Breaks with Many Modes?2602.11975v1 · Cornelius Brand, Radu Curticapean, Petteri Kaski et al.2026 · 0 citationsarXiv
Which graph motif parameters count?2507.12244v1 · Markus Blaser, Radu Curticapean, Julian Dorfler et al.2025 · 0 citationsarXiv
Faster Convolutions: Yates and Strassen Revisited2505.22410v1 · Cornelius Brand, Radu Curticapean, Baitian Li et al.2025 · 0 citationsarXiv
Can You Link Up With Treewidth?2410.02606v2 · Radu Curticapean, Simon Doring, Daniel Neuen et al.2024 · 0 citationsarXiv
Counting Small Induced Subgraphs: Hardness via Fourier Analysis2407.07051v3 · Radu Curticapean, Daniel Neuen2024 · 1 citationarXiv
Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture2404.04987v2 · Andreas Bjorklund, Radu Curticapean, Thore Husfeldt et al.2024 · 2 citationsarXiv
Count on CFI graphs for #P-hardness2305.04767v1 · Radu Curticapean2023 · 2 citationsarXiv
Determinants from homomorphisms2204.10718v1 · Radu Curticapean2022 · 0 citationsarXiv
Parameterizing the Permanent: Hardness for -minor-free graphs2108.12879v1 · Radu Curticapean, Mingji Xia2021 · 1 citationarXiv
Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths2107.00629v1 · Radu Curticapean, Holger Dell, Thore Husfeldt2021 · 2 citationsarXiv
A full complexity dichotomy for immanant families2102.04340v1 · Radu Curticapean2021 · 5 citationsarXiv
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank1709.02311v2 · Radu Curticapean, Nathan Lindzey, Jesper Nederlof2017 · 12 citationsarXiv
Homomorphisms Are a Good Basis for Counting Small Subgraphs1705.01595v1 · Radu Curticapean, Holger Dell, D'aniel Marx2017 · 82 citationsarXiv
Counting edge-injective homomorphisms and matchings on restricted graph classes1702.05447v2 · Radu Curticapean, Holger Dell, Marc Roth2017 · 3 citationsarXiv
A Fixed-Parameter Perspective on #BIS1702.05543v4 · Radu Curticapean, Holger Dell, Fedor Fomin et al.2017 · 3 citationsarXiv
Counting matchings with k unmatched vertices in planar graphs1607.08192v1 · Radu Curticapean2016 · 2 citationsarXiv
Finding Detours is Fixed-parameter Tractable1607.07737v2 · Ivona Bez'akov'a, Radu Curticapean, Holger Dell et al.2016 · 44 citationsarXiv
Parity Separation: A Scientifically Proven Method for Permanent Weight Loss1511.07480v1 · Radu Curticapean2015 · 4 citationsarXiv
Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity1511.02910v2 · Radu Curticapean2015 · 18 citationsarXiv
Parameterizing the Permanent: Genus, Apices, Minors, Evaluation mod 2^k1511.02321v1 · Radu Curticapean, Mingji Xia2015 · 17 citationsarXiv
Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts1407.2929v1 · Radu Curticapean, D'aniel Marx2014 · 63 citationsarXiv
Counting perfect matchings in graphs that exclude a single-crossing minor1406.4056v1 · Radu Curticapean2014 · 7 citationsarXiv
Counting Triangulations and other Crossing-free Structures via Onion Layers1312.4628v1 · Victor Alvarez, Karl Bringmann, Radu Curticapean et al.2013 · 10 citationsarXiv
Career total: 47 works. 27 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.