Parameterized complexity of distances to sparse graph classes

@inproceedings{Bulian2017ParameterizedCO,
  title={Parameterized complexity of distances to sparse graph classes},
  author={Jannis Bulian},
  year={2017}
}
This dissertation offers contributions to the area of parameterized complexity theory, which studies the complexity of computational problems in a multivariate framework. We demonstrate that for graph problems, many popular parameters can be understood as distances that measure how far a graph is from belonging to a class of sparse graphs. We introduce the… CONTINUE READING