We introduce graph motif parameters, a class of graph parameters that depend only on the
frequencies of constant-size induced subgraphs. Classical works by Lovász show that many …

Counting graphlets is a well-studied problem in graph mining and social network analysis.
Recently, several papers explored very simple and natural approaches based on Monte …

For a class C of graphs,# Sub (C) is the counting problem that, given a graph H from C and
an arbitrary graph G, asks for the number of subgraphs of G isomorphic to H. It is known that …

Counting graphlets is a well-studied problem in graph mining and social network analysis.
Recently, several papers explored very simple and natural algorithms based on Monte Carlo …

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 …

For a fixed graph property Φ and integer k≥ 1, consider the problem of counting the induced
k-vertex subgraphs satisfying Φ in an input graph G. This problem can be solved by brute …

Simplicial complexes are higher-order combinatorial structures which have been used to
represent real-world complex systems. In this paper, we concentrate on the local patterns in …

In this thesis, we study the parameterized complexity of counting problems, as introduced by
Flum and Grohe. This area mainly involves questions of the following kind: On inputs x with …

The concept of compactor has been introduced in Kim et al.(2018) as a general data-
reduction concept for parametrized counting problems. For a function F: Σ∗→ N and a …

We study the computational complexity of the problem# IndSub (Φ) of counting k-vertex
induced subgraphs of a graph G that satisfy a graph property Φ. Our main result establishes …