7 citations · 9 across the 14 of their papers we have counts for
9 papers · 1 filter
Algorithmics for Safe Bicycle Network Design with Bounded Detours in Rural Areas
Till Fluschnik
We introduce the \emph{Safe Bicycle Network with Bounded Detours} (\emph{SBNBD}) problem, motivated by upgrading rural road networks for bicycle traffic. Given an undirected graph…
Placing Green Bridges Optimally for Robust Habitat Reconnection
Gero Ellmies, Till Fluschnik
We study the problem of robustly reconnecting habitats via the placement of green bridges at minimum total cost. Habitats are fragmented into patches and we seek to reconnect each…
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…
Placing Green Bridges Optimally, with Close-Range Habitats in Sparse Graphs
Christian Wallisch, Till Fluschnik, Leon Kellerhals
We study a network design problem motivated by the challenge of placing wildlife crossings to reconnect fragmented habitats of animal species, which is among the 17 goals towards s…
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…
Placing Green Bridges Optimally, with Habitats Inducing Cycles
Maike Herkenrath, Till Fluschnik, Francesco Grothe +1
Choosing the placement of wildlife crossings (i.e., green bridges) to reconnect animal species' fragmented habitats is among the 17 goals towards sustainable development by the UN.…