2 citations · 2 across the 1 of their papers we have counts for
Showing cs.CCShow 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.CC2019
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…