Computing a (short) path between two vertices is one of the most fundamental primitives in
graph algorithmics. In recent years, the study of paths in temporal graphs, that is, graphs …

Temporal graphs have time-stamped edges. Building on previous work, we study the
problem of finding a small vertex set (the separator) whose removal destroys all temporal …

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 investigate for temporal graphs the computational complexity of separating two distinct
vertices s and z by vertex deletion. In a temporal graph, the vertex set is fixed but the edges …

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 …

Temporal graphs naturally model graphs whose underlying topology changes over time.
Recently, the problems Temporal Vertex Cover (or TVC) and Sliding-Window Temporal …

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 …

Graph coloring is one of the most famous computational problems with applications in a
wide range of areas such as planning and scheduling, resource allocation, and pattern …

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