10 citations · 23 across the 31 of their papers we have counts for
Showing 2019 · math.COShow all
2 papers · 2 filters
math.CO2019★ 1 cited
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal
Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani +2
Let , and , respectively, denote the size of a minimum vertex cover, minimum feedback vertex set and minimum odd cycle transversal in a graph . One can a…
math.CO2019
Clique-Width for Hereditary Graph Classes
Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
Clique-width is a well-studied graph parameter owing to its use in understanding algorithmic tractability: if the clique-width of a graph class is bounded by a constant,…