The use of static graphs for modelling and analysis of biological and biomedical data plays a
key role in biomedical research. However, many real-world scenarios present dynamic …

Spreading processes on graphs are a natural model for a wide variety of real-world
phenomena, including information spread over social networks and biological diseases …

Modern, inherently dynamic systems are usually characterized by a network structure which
is subject to discrete changes over time. Given a static underlying graph, a temporal graph …

We introduce a natural temporal analogue of Eulerian circuits and prove that, in contrast to
the static case, it is NP-hard to determine whether a given temporal graph is temporally …

We investigate the computational complexity of finding temporally disjoint paths and walks in
temporal graphs. There, the edge set changes over discrete time steps. Temporal paths and …

A graph is temporally connected if a strict temporal path exists from every vertex u to every
other vertex v. This paper studies temporal design problems for undirected temporally …

Abstract Let G=(V, E) be an undirected graph on n vertices and λ: E→ 2 N a map** that
assigns to every edge a non-empty set of integer labels (discrete times when the edge is …

Many real-world networks evolve over time, that is, new contacts appear and old contacts
may disappear. They can be modeled as temporal graphs where interactions between …

A graph whose edges only appear at certain points in time is called a temporal graph
(among other names). Such a graph is temporally connected if each ordered pair of vertices …

Motivated by the recent rapid growth of research for algorithms to cluster multi-layer and
temporal graphs, we study extensions of the classical Cluster Editing problem. In Multi-Layer …