8 citations · 35 across the 16 of their papers we have counts for
4 papers · 1 filter
Sharp Thresholds in Random Simple Temporal Graphs
Arnaud Casteigts, Michael Raskin, Malte Renken +1
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 is c…
Using a geometric lens to find k disjoint shortest paths
Matthias Bentert, André Nichterlein, Malte Renken +1
Given an undirected -vertex graph and pairs of terminal vertices , the -Disjoint Shortest Paths (-DSP)-problem asks whether there are …
As Time Goes By: Reflections on Treewidth for Temporal Graphs
Till Fluschnik, Hendrik Molter, Rolf Niedermeier +2
Treewidth is arguably the most important structural graph parameter leading to algorithmically beneficial graph decompositions. Triggered by a strongly growing interest in temporal…
Feedback Edge Sets in Temporal Graphs
Roman Haag, Hendrik Molter, Rolf Niedermeier +1
The classical, linear-time solvable Feedback Edge Set problem is concerned with finding a minimum number of edges intersecting all cycles in a (static, unweighted) graph. We provid…