7 papers
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…
Scheduling Tasks towards Energy Autarky: Benefits and Computational Costs of Flexibility
Robert Bredereck, Till Fluschnik, Klaus Heeger
We study the autarky problem: given an energy forecast, a battery, and a set of energy-consuming jobs with time windows, decide whether all jobs can be scheduled without requiring…
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…
Maximizing Index Diversity in Committee Elections
Paula Böhm, Robert Bredereck, Till Fluschnik
We introduce two models of multiwinner elections with approval preferences and labelled candidates that take the committee's diversity into account. One model aims to find a commit…
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…