IMSc Webinar

Parameterized Complexity of Conflict-Free Solutions

Lawqueen Kanesh

The Institute of Mathematical Sciences

In this thesis we consider several classical problems in graph algorithms and parameterized complexity. We study their conflict-free variants and generalization in hypergraphs from the perspective of parameterized complexity. In the conflict-free variant of a classical problem Q, together with the input of the Q we are also given a conflict graph H and the aim is to find a solution to Q which is also an independent set in H.

Join at: meet.google.com/hkg-cqnk-yeb