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 …

We study the problem $\#\mathrm {EdgeSub}(\Phi) $ of counting $ k $-edge subgraphs
satisfying a given graph property $\Phi $ in a large host graph $ G $. Building upon the …

Given a graph property, we consider the problem EdgeSub, where the input is a pair of a
graph and a positive integer, and the task is to compute the number of-edge subgraphs in …

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 …

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 study the problems of counting copies and induced copies of a small pattern graph $ H $
in a large host graph $ G $. Recent work fully classified the complexity of those problems …

A homomorphism between graphs H and G, possibly with vertex-colors, is a function f: V
(ℋ)→ V (G) that preserves colors and edges. Many interesting graph parameters are finite …

Given a class of graphs H, the problem⊕ Sub (H) is defined as follows. The input is a graph
H∈ H together with an arbitrary graph G. The problem is to compute, modulo 2, the number …

We consider algorithms for finding and counting small, fixed graphs in sparse host graphs. In
the non-sparse setting, the parameters treedepth and treewidth play a crucial role in fast …

We consider this question for a wide range of tools. Besides tools using pre-and
postcondition contracts, we also include tools with other notions of contracts for software. A …