Jayakrishnan M
(The Institute of Mathematical Sciences, 2021)
This thesis is divided into two parts, and deals with the parameterized complexity analysis of two classes of problems: (i) graph partitioning problems and (ii) crossing minimisation problems. The first of these, graph ...