pith. sign in

Radu Curticapean

Identifiers

  • name variant Radu Curticapean 0.60 · backfill

Papers (13)

  1. Planar Perfect Matching Counting is as Hard as Determinants cs.CC · 2026 · author #1
  2. A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank cs.DS · 2017 · author #1
  3. Homomorphisms Are a Good Basis for Counting Small Subgraphs cs.DS · 2017 · author #1
  4. A Fixed-Parameter Perspective on #BIS cs.CC · 2017 · author #1
  5. Counting edge-injective homomorphisms and matchings on restricted graph classes cs.CC · 2017 · author #1
  6. Counting matchings with k unmatched vertices in planar graphs cs.CC · 2016 · author #1
  7. Finding Detours is Fixed-parameter Tractable cs.DS · 2016 · author #2
  8. Parity Separation: A Scientifically Proven Method for Permanent Weight Loss cs.CC · 2015 · author #1
  9. Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity cs.CC · 2015 · author #1
  10. Parameterizing the Permanent: Genus, Apices, Minors, Evaluation mod 2^k cs.CC · 2015 · author #1
  11. Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts cs.CC · 2014 · author #1
  12. Counting perfect matchings in graphs that exclude a single-crossing minor cs.DS · 2014 · author #1
  13. Counting Triangulations and other Crossing-free Structures via Onion Layers cs.CG · 2013 · author #3

Mentions

  • 1511.07480 #1 · backfill · confidence 0.70 Radu Curticapean
  • 1511.02910 #1 · backfill · confidence 0.70 Radu Curticapean
  • 1511.02321 #1 · backfill · confidence 0.70 Radu Curticapean
  • 2606.03975 #1 · arxiv_oai · confidence 0.70 Radu Curticapean
  • 1407.2929 #1 · backfill · confidence 0.70 Radu Curticapean
  • 1406.4056 #1 · backfill · confidence 0.70 Radu Curticapean
  • 1312.4628 #3 · backfill · confidence 0.70 Radu Curticapean

Frequent Coauthors