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 …

We study spreading processes in temporal graphs, that is, graphs whose connections
change over time. More precisely, we investigate how such a spreading process, emerging …

In static graphs, the betweenness centrality of a graph vertex measures how many times this
vertex is part of a shortest path between any two graph vertices. Betweenness centrality is …

Dynamic networks are a complex subject. Not only do they inherit the complexity of static
networks (as a particular case); they are also sensitive to definitional subtleties that are a …

We study Steiner Forest on H-subgraph-free graphs, that is, graphs that do not contain some
fixed graph H as a (not necessarily induced) subgraph. We are motivated by a recent …

In this paper we initiate the study of the temporal graph realization problem with respect to
the fastest path durations among its vertices, while we focus on periodic temporal graphs …

In this paper we initiate the study of the\emph {temporal graph realization} problem with
respect to the fastest path durations among its vertices, while we focus on periodic temporal …

In this paper, we study the complexity of the\textit {periodic temporal graph realization}
problem with respect to upper bounds on the fastest path durations among its vertices. This …