7 citations · 7 across the 4 of their papers we have counts for
6 papers · 1 filter
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…
Parameterized Algorithms for Diverse Multistage Problems
Leon Kellerhals, Malte Renken, Philipp Zschoche
The world is rarely static -- many problems need not only be solved once but repeatedly, under changing conditions. This setting is addressed by the "multistage" view on computatio…
Temporal Reachability Minimization: Delaying vs. Deleting
Hendrik Molter, Malte Renken, Philipp Zschoche
We study spreading processes in temporal graphs, i. e., graphs whose connections change over time. These processes naturally model real-world phenomena such as infectious diseases…
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…
Enumerating Isolated Cliques in Temporal Networks
Hendrik Molter, Rolf Niedermeier, Malte Renken
Isolation is a concept from the world of clique enumeration that is mostly used to model communities that do not have much contact to the outside world. Herein, a clique is conside…