18 citations · 81 across the 40 of their papers we have counts for
4 papers · 1 filter
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…
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs
Robert Bredereck, Vincent Froese, Marcel Koseler +3
There has been intensive work on the parameterized complexity of the typically NP-hard task to edit undirected graphs into graphs fulfilling certain given vertex degree constraints…
Network-Based Vertex Dissolution
René van Bevern, Robert Bredereck, Jiehua Chen +3
We introduce a graph-theoretic vertex dissolution model that applies to a number of redistribution scenarios such as gerrymandering in political districting or work balancing in an…
Partitioning Perfect Graphs into Stars
René van Bevern, Robert Bredereck, Laurent Bulteau +4
The partition of graphs into "nice" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size st…