2 citations · 2 across the 1 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.CC2020
Recognizing Proper Tree-Graphs
Steven Chaplick, Petr A. Golovach, Tim A. Hartmann +1
We investigate the parameterized complexity of the recognition problem for the proper -graphs. The -graphs are the intersection graphs of connected subgraphs of a subdivision…
cs.DS2020
An Investigation of the Recoverable Robust Assignment Problem
Dennis Fischer, Tim A. Hartmann, Stefan Lendl +1
We investigate the so-called recoverable robust assignment problem on balanced bipartite graphs with vertices, a mainstream problem in robust optimization: For two given linea…