1 citations · 1 across the 9 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2025
The Directed Disjoint Paths Problem with Congestion
Matthias Bentert, Dario Cavallaro, Amelie Heindl +3
The classic result by Fortune, Hopcroft, and Wyllie [TCS~'80] states that the directed disjoint paths problem is NP-complete even for two pairs of terminals. Extending this well-kn…
cs.DM2023
Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model
Matthias Bentert, Jannik Schestag, Frank Sommer
We study a generalization of the classic Spanning Tree problem that allows for a non-uniform failure model. More precisely, edges are either \emph{safe} or \emph{unsafe} and we ass…