10 citations · 37 across the 29 of their papers we have counts for
1 paper · 2 filters
Jannis Bulian, Anuj Dawar
A commonly studied means of parameterizing graph problems is the deletion distance from triviality (Guo et al. 2004), which counts vertices that need to be deleted from a graph to…