The domatic number of a graph is the maximum number of vertex disjoint
d...
In this paper we initiate the study of the temporal graph realization
pr...
Temporal graphs naturally model graphs whose underlying topology changes...
A graph is temporally connected if there exists a strict temporal path, ...
Motivated by biological processes, we introduce here the model of growin...
We investigate the computational complexity of finding temporally disjoi...
In a temporal network with discrete time-labels on its edges, entities a...
We introduce a natural but seemingly yet unstudied generalization of the...
This paper studies the maximum cardinality matching problem in stochasti...
In this paper we consider the following total functional problem: Given ...
In this paper, we introduce a new kind of duality for Linear Programming...
We study the computational complexity of finding maximum-cardinality tem...
Temporal graphs are used to abstractly model real-life networks that are...
Graph coloring is one of the most famous computational problems with
app...
A variety of potentially disease-spreading contact networks can be natur...
In this paper we study the problem of exploring a temporal graph (i.e. a...
We consider the problem of computing the size of each r-neighbourhood fo...
Modern, inherently dynamic systems are usually characterized by a networ...
A vertex x in a tournament T is called a king if for every vertex y of
T...
Kernelization is an important tool in parameterized algorithmics. The go...