@inproceedings { ,
title = {Computing weighted subset transversals in H-free graphs},
abstract = {For the Odd Cycle Transversal problem, the task is to nd a small set S of vertices in a graph that intersects every cycle of odd length. The Subset Odd Cycle Transversal requires S to intersect only those odd cycles that include a vertex of a distinguished vertex subset T. If we are given weights for the vertices, we ask instead that S has small weight: this is the problem Weighted Subset Odd Cycle Transversal. We prove an almost-complete complexity dichotomy for Weighted Subset Odd Cycle Transversal for graphs that do not contain a graph H as an induced subgraph. Our general approach can also be used for Weighted Subset Feedback Vertex Set, which enables us to generalize a recent result of Papadopoulos and Tzimas.},
conference = {WADS 2021},
doi = {10.1007/978-3-030-83508-8\_17},
isbn = {978-3-030-83507-1},
note = {EPrint Processing Status: Full text deposited in DRO},
pages = {229-242},
publicationstatus = {Published},
publisher = {Springer Verlag},
url = {https://durham-repository.worktribe.com/output/1139387},
keyword = {Algorithms and Complexity in Durham (ACiD)},
year = {2024},
author = {Brettell, N. and Johnson, M. and Paulusma, D.}
editor = {Lubiw, A. and Salavatipour, M. and He, M.}
}