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 …

We study the design of small cost temporally connected graphs, under various constraints.
We mainly consider undirected graphs of n vertices, where each edge has an associated set …

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 …

We study the design of small cost temporally connected graphs, under various constraints.
We mainly consider undirected graphs of n vertices, where each edge has an associated set …

We study how we can accelerate the spreading of information in temporal graphs via
delaying operations; a problem that captures real-world applications varying from …

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 …

A temporal graph can be viewed as a sequence of static graphs indexed by discrete time
steps. The vertex set of each graph in the sequence remains the same; however, the edge …

A temporal graph is a graph in which vertices communicate with each other at specific time,
eg, A calls B at 11 am and talks for 7 minutes, which is modeled by an edge from A to B with …

A temporal graph with lifetime L is a sequence of L graphs G 1,…, GL, called layers, all of
which have the same vertex set V but can have different edge sets. The underlying graph is …

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 …