activity
20142025
most citedA Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs

25 citations · 79 across the 15 of their papers we have counts for

collaborators
Showing 2020Show all

2 papers · 1 filter

cs.DS2020

Computing Weighted Subset Transversals in -Free Graphs

Nick Brettell, Matthew Johnson, Daniel Paulusma

For the Odd Cycle Transversal problem, the task is to find a small set of vertices in a graph that intersects every cycle of odd length. The Subset Odd Cycle Transversal proble…

cs.DS2020

Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective

Hans Bodlaender, Nick Brettell, Matthew Johnson +3

We consider the classical problems (Edge) Steiner Tree and Vertex Steiner Tree after restricting the input to some class of graphs characterized by a small set of forbidden induced…