8 citations · 35 across the 16 of their papers we have counts for
21 papers
Smooth Routing in Decaying Trees
Till Fluschnik, Amela Pucic, Malte Renken
Motivated by evacuation scenarios arising in extreme events such as flooding or forest fires, we study the problem of smoothly scheduling a set of paths in graphs where connections…
Locally Rainbow Paths
Till Fluschnik, Leon Kellerhals, Malte Renken
We introduce the algorithmic problem of finding a locally rainbow path of length connecting two distinguished vertices and in a vertex-colored directed graph. Herein…
Terrain-like Graphs and the Median Genocchi Numbers
Vincent Froese, Malte Renken
A graph with vertex set is terrain-like if, for any edge pair with , the edge also exists. Terrain-like graphs frequently appe…
Giant Components in Random Temporal Graphs
Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi +4
A temporal graph is a graph whose edges appear only at certain points in time. Recently, the second and the last three authors proposed a natural temporal analog of the Erdős-Rényi…
Delay-Robust Routes in Temporal Graphs
Eugen Füchsle, Hendrik Molter, Rolf Niedermeier +1
Most transportation networks are inherently temporal: Connections (e.g. flights, train runs) are only available at certain, scheduled times. When transporting passengers or commodi…
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays
Eugen Füchsle, Hendrik Molter, Rolf Niedermeier +1
Consider planning a trip in a train network. In contrast to, say, a road network, the edges are temporal, i.e., they are only available at certain times. Another important difficul…