The multi-type Moran process is an evolutionary process on a connected g...
Given a class of graphs ℋ, the problem
⊕𝖲𝗎𝖻(ℋ) is defined as follows. Th...
We study the fixed-parameter tractability of the following fundamental
p...
We study the problems of counting copies and induced copies of a small
p...
We study the computational complexity of the problem #IndSub(Φ)
of count...
We study the problem #EdgeSub(Φ) of counting k-edge
subgraphs satisfying...
We study the complexity of approximating the number of answers to a smal...
We study the problems of counting the homomorphisms, counting the copies...
Given a graph property Φ, we consider the problem
𝙴𝚍𝚐𝚎𝚂𝚞𝚋(Φ), where the ...
We study the problem of computing the parity of the number of homomorphi...
Given a graph property Φ, the problem #𝖨𝗇𝖽𝖲𝗎𝖻(Φ) asks, on
input a graph ...
Counting homomorphisms from a graph H into another graph G is a
fundamen...
We study the problem #IndSub(P) of counting all induced subgraphs of siz...
We study the weak call-by-value λ-calculus as a model for
computational ...
Conjunctive queries select and are expected to return certain tuples fro...
We investigate the problem #IndSub(Φ) of counting all induced
subgraphs ...