Abstract
In this thesis, we continue the research on well-known NP-hard problems
by looking at them from two lenses, namely, parameterized complexity and
restriction of input to classes of graphs forbidding certain subgraphs. In the first part, we study the parameterized as well as classical complexity of the well-known problem Edge-Multiway Cut with
... read more