2 citations · 2 across the 1 of their papers we have counts for
5 papers
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…
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…
The Complexity of Packing Edge-Disjoint Paths
Jan Dreier, Janosch Fuchs, Tim A. Hartmann +4
We introduce and study the complexity of Path Packing. Given a graph and a list of paths, the task is to embed the paths edge-disjoint in . This generalizes the well known H…
Dispersing obnoxious facilities on a graph
Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl +1
We study a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the interior of the edges. The goal i…
Target Set Selection Parameterized by Clique-Width and Maximum Threshold
Tim A. Hartmann
The Target Set Selection problem takes as an input a graph and a non-negative integer threshold $ \mbox{thr}(v) $ for every vertex . A vertex can get active as soon as a…