The following pages link to (Q4967222):
Displaying 9 items.
- Counting induced subgraphs: a topological approach to \#W[1]-hardness (Q786040) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- Counting induced subgraphs: an algebraic approach to \(\#\)W[1]-hardness (Q832520) (← links)
- The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
- Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
- Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
- Counting problems in parameterized complexity (Q5009461) (← links)
- Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
- Parameterised counting in logspace (Q6093373) (← links)