The fixed parameter approach to a problem is a technique of designing an algorithm to solve combinatorially hard problems. A parameterized problem has an input instance x as well as a parameter k which is sufficiently small ...

This thesis presents a comprehensive study of the parameterized complexity of several graph-theoretic problems, with a focus on graph modification, separation, and vertex splitting. The investigation is primarily motivated ...