In this paper, we design efficient algorithms to approximately count the number of edges of a
given k-hypergraph, and to sample an approximately uniform random edge. The hypergraph …

We study the parameterized complexity of# IndSub (Φ), where given a graph G and an
integer k, the task is to count the number of induced subgraphs on k vertices that satisfy the …

For a fixed graph property $\Phi $ and integer $ k\geq 1$, the problem $\#\mathrm
{IndSub}(\Phi, k) $ asks to count the induced $ k $-vertex subgraphs satisfying $\Phi $ in an …

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

A graph property is a function $\Phi $ that maps every graph to {0, 1} and is invariant under
isomorphism. In the $\# IndSub (\Phi) $ problem, given a graph $ G $ and an integer $ k …

We introduce a new framework for the analysis of preprocessing routines for parameterized
counting problems. Existing frameworks that encapsulate parameterized counting problems …

We study the problem of counting answers to unions of conjunctive queries (UCQs) under
structural restrictions on the input query. Concretely, given a class C of UCQs, the problem# …

A central result of Marx [ToC'10] proves that there are $ k $-vertex graphs $ H $ of maximum
degree $3 $ such that $ n^{o (k/\log k)} $ time algorithms for detecting colorful $ H …

We study the problems of counting copies and induced copies of a small pattern graph in a
large host graph. Recent work fully classified the complexity of those problems according to …

We investigate the complexity of parameterised holant problems $\textsc {p-Holant}(\mathcal
{S}) $ for families of signatures~ $\mathcal {S} $. The parameterised holant framework was …