Parameterized Algorithms Course Description Notes FPT Slice Wise Polynomial Time Parameterized Languages Kernelization A parameterized problem is in FPT iff it admits a kernel Kernelization Algorithm for Vertex Cover Kernelization Algorithm for Feedback Arc Set in Tournament Kernelization Algorithm for Edge Clique Cover Crown Decomposition Crown Lemma 3k Vertex Cover Kernelization Algorithm Kernelization Algorithm for MAXSAT Expansion Lemma Extended Hall’s Lemma Sunflower Lemma Kernelization Algorithm for d-Hitting Set MOCs Complexity Theory Practicle Information References