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 …

Most transportation networks are inherently temporal: Connections (eg flights, train runs) are
only available at certain, scheduled times. When transporting passengers or commodities …

The betweenness centrality of a vertex v is an important centrality measure that quantifies
how many optimal paths between pairs of other vertices visit v. Computing betweenness …

A graph is temporally connected if there exists a strict temporal path, ie a path whose edges
have strictly increasing labels, from every vertex $ u $ to every other vertex $ v $. In this …

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 …

We study the network untangling problem introduced by Rozenshtein et al.(Data Min. Knowl.
Disc. 35 (1), 213–247, 2021), which is a variant of Vertex Cover on temporal graphs–graphs …

Consider planning a trip in a train network. In contrast to, say, a road network, the edges are
temporal, ie, they are only available at certain times. Another important difficulty is that trains …

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 a temporal graph, each edge appears and can be traversed at specific points in time. In
such a graph, temporal reachability of one node from another is naturally captured by the …

Treewidth is arguably the most important structural graph parameter leading to
algorithmically beneficial graph decompositions. Triggered by a strongly growing interest in …