A graph with vertex set {1,…,n} is terrain-like if, for any edge
pair {a...
A temporal graph is a graph whose edges appear only at certain points in...
Most transportation networks are inherently temporal: Connections (e.g.
...
Consider planning a trip in a train network. In contrast to, say, a road...
Proximity graphs have been studied for several decades, motivated by
app...
Removing all connections between two vertices s and z in a graph by remo...
To address the dynamic nature of real-world networks, we generalize
comp...
The world is rarely static – many problems need not only be solved once ...
We study spreading processes in temporal graphs, i. e., graphs whose
con...
In a temporal network with discrete time-labels on its edges, entities a...
A graph whose edges only appear at certain points in time is called a
te...
Given an undirected n-vertex graph and k pairs of terminal vertices
(s_1...
Treewidth is arguably the most important structural graph parameter lead...
The classical, linear-time solvable Feedback Edge Set problem is concern...
Time-evolving or temporal graphs gain more and more popularity when stud...
Time-evolving or temporal graphs gain more and more popularity when stud...
We prove a bijection between the triangulations of the 3-dimensional cyc...
Isolation has been shown to be a valuable concept in the world of clique...
We study terrain visibility graphs, a well-known graph class closely rel...
The connections within many real-world networks change over time. Thus, ...