Computing subset vertex covers in H-free graphs

Brettell, Nick; Oostveen, Jelle J.; Pandey, Sukanya; Paulusma, Daniël; Rauch, Johannes; van Leeuwen, Erik Jan

doi:10.1016/j.tcs.2025.115088

Computing subset vertex covers in H-free graphs

Brettell, Nick; Oostveen, Jelle J.; Pandey, Sukanya; Paulusma, Daniël; Rauch, Johannes; van Leeuwen, Erik Jan

Authors

Nick Brettell

Jelle J. Oostveen

Sukanya Pandey

Professor Daniel Paulusma daniel.paulusma@durham.ac.uk
Professor

Johannes Rauch

Erik Jan van Leeuwen

Citation

Brettell, N., Oostveen, J. J., Pandey, S., Paulusma, D., Rauch, J., & van Leeuwen, E. J. (2025). Computing subset vertex covers in H-free graphs. Theoretical Computer Science, 1032, Article 115088. https://doi.org/10.1016/j.tcs.2025.115088

Journal Article Type	Article
Acceptance Date	Jan 25, 2025
Online Publication Date	Jan 30, 2025
Publication Date	Mar 29, 2025
Deposit Date	Feb 13, 2025
Publicly Available Date	Feb 13, 2025
Journal	Theoretical Computer Science
Print ISSN	0304-3975
Publisher	Elsevier
Peer Reviewed	Peer Reviewed
Volume	1032
Article Number	115088
DOI	https://doi.org/10.1016/j.tcs.2025.115088
Public URL	https://durham-repository.worktribe.com/output/3362739