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 …

A temporal graph is a dynamic graph where every edge is assigned a set of integer time
labels that indicate at which discrete time step the edge is available. In this paper, we study …

SARS-CoV-2 was independently introduced to the UK at least 1300 times by June 2020.
Given a population with dynamic pairwise connections, we ask if the entire population could …

Many real-world networks, such as transportation or trade networks, are dynamic in the
sense that the edge set may change over time, but these changes are known in advance …

Logistics and transportation networks require a large amount of resources to realize
necessary connections between locations and minimizing these resources is a vital aspect …

We discuss a variety of extensions of connected components in temporal graphs, focusing
on extensions using connectivity over time through temporal paths (or journeys). Starting …

Reachability and other path-based measures on temporal graphs can be used to
understand spread of infection, information, and people in modelled systems. Due to delays …

In many settings there is a need to reduce the spread of something undesirable, such as a
virus, through a network. Typically, the network in which the spreading process takes place …

Temporal graphs extend ordinary graphs with discrete time that affects the availability of
edges. We consider solving games played on temporal graphs where one player aims to …

In train networks, carefully-chosen delays may be beneficial for certain passengers, who
would otherwise miss some connection. Given a simple temporal graph and a set of …