This thesis studies algorithms mainly in the parameterized complexity framework. The thesis has three conceptual parts, (i) efficient computation of representative families, and its application in FPT and exact algorithms, ...