132 citations · 262 across the 12 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2015
Fixed-parameter Tractable Distances to Sparse Graph Classes
Jannis Bulian, Anuj Dawar
We show that for various classes C of sparse graphs, and several measures of distance to such classes (such as edit distance and elimination distance), the problem of determining t…
cs.DS2014
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
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…