On the public citation graph
Some Hard Families of Parameterized Counting Problems
0 signed · 27 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-29953-xopenalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/3-540-36136-7_40openalex-snapshot
Approximation Algorithms for Some Parameterized Counting Problems
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_3openalex-snapshot
A Combinatorial Problem in Geometry
inferredcites →https://doi.org/10.1007/978-3-540-70575-8openalex-snapshot
Automata, Languages and Programming
inferredcites →https://doi.org/10.1007/978-3-540-70575-8_48openalex-snapshot
Understanding the Complexity of Induced Subgraph Isomorphisms
inferredcites →https://doi.org/10.1007/978-3-642-39206-1_30openalex-snapshot
Counting Matchings of Size k Is $\sharp$ W[1]-Hard
inferredcites →https://doi.org/10.1016/j.jcss.2014.11.015openalex-snapshot
The parameterised complexity of counting connected subgraphs and graph motifs
inferredcites →https://doi.org/10.1016/j.tcs.2004.08.008openalex-snapshot
The complexity of counting homomorphisms seen from the other side
inferredcites →https://doi.org/10.1016/j.tcs.2008.09.065openalex-snapshot
On the parameterized complexity of multiple-interval graph problems
inferredcites →https://doi.org/10.1109/ccc.2007.21openalex-snapshot
On Parameterized Path and Chordless Path Problems
inferredcites →https://doi.org/10.1109/focs.2014.22openalex-snapshot
Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts
inferredcites →https://doi.org/10.1137/s0097539703427203openalex-snapshot
The Parameterized Complexity of Counting Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00453-018-0404-yopenalex-snapshot
Randomised Enumeration of Small Witnesses Using a Decision Oracle
inferred← citeshttps://doi.org/10.1007/s00453-020-00676-9openalex-snapshot
Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness
inferred← citeshttps://doi.org/10.1007/s00453-021-00894-9openalex-snapshot
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness
inferred← citeshttps://doi.org/10.1007/s00493-016-3338-5openalex-snapshot
The parameterised complexity of counting even and odd induced subgraphs
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100837openalex-snapshot
Parameterised counting complexity theory
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.019openalex-snapshot
The challenges of unbounded treewidth in parameterised subgraph counting problems
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00128openalex-snapshot
Counting Small Induced Subgraphs Satisfying Monotone Properties
inferred← citeshttps://doi.org/10.1137/1.9781611977912.74openalex-snapshot
Count on CFI graphs for #P-hardness
inferred← citeshttps://doi.org/10.1137/20m1365624openalex-snapshot
Counting Small Induced Subgraphs Satisfying Monotone Properties
inferred← citeshttps://doi.org/10.1137/22m1479804openalex-snapshot
Parameterized Counting and Cayley Graph Expanders
inferred← citeshttps://doi.org/10.1137/22m1512211openalex-snapshot
Counting Small Induced Subgraphs with Hereditary Properties
inferred← citeshttps://doi.org/10.1145/3055399.3055502openalex-snapshot
Homomorphisms are a good basis for counting small subgraphs
inferred← citeshttps://doi.org/10.1145/3519935.3520008openalex-snapshot
Counting small induced subgraphs with hereditary properties
inferred← citeshttps://doi.org/10.1145/3618260.3649644openalex-snapshot
Counting Small Induced Subgraphs with Edge-Monotone Properties
inferred← citeshttps://doi.org/10.48550/arxiv.1410.3375openalex-snapshot
The parameterised complexity of counting even and odd induced subgraphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.