2 citations · 8 across the 14 of their papers we have counts for
4 papers · 1 filter
Multistage Graph Problems on a Global Budget
Klaus Heeger, Anne-Sophie Himmel, Frank Kammer +3
Time-evolving or temporal graphs gain more and more popularity when studying the behavior of complex networks. In this context, the multistage view on computational problems is amo…
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters
Robert Bredereck, Klaus Heeger, Dušan Knop +1
We continue and extend previous work on the parameterized complexity analysis of the NP-hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening earlier…
Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters
Matthias Bentert, Klaus Heeger, Dušan Knop
In the presented paper we study the Length-Bounded Cut problem for special graph classes as well as from a parameterized-complexity viewpoint. Here, we are given a graph , two v…
The stable marriage problem with ties and restricted edges
Ágnes Cseh, Klaus Heeger
In the stable marriage problem, a set of men and a set of women are given, each of whom has a strictly ordered preference list over the acceptable agents in the opposite class. A m…