activity
20162026
most citedCounting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness

2 citations · 4 across the 7 of their papers we have counts for

collaborators
Showing 2022Show all

1 paper · 1 filter

cs.CC2022★ 1 cited

The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree

Marco Bressan, Matthias Lanzinger, Marc Roth

We study the fixed-parameter tractability of the following fundamental problem: given two directed graphs and , count the number of copies of in .…