Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
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…
cs.DS2025
The Complexity of Transitively Orienting Temporal Graphs
George B. Mertzios, Hendrik Molter, Malte Renken +2
In a temporal network with discrete time-labels on its edges, entities and information can only ``flow'' along sequences of edges whose time-labels are non-decreasing (resp. increa…
cs.DS2024
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…