Parameterized Algorithms at University of Warsaw, Lecture 12: W-hardness. Definition of fpt reductions, W[1]- and W[2]-hardness, quick glimpse on W-hierarchy, hardness of Multicolored Clique, Dominating Set, Set Cover, Hitting Set, Node k-Way Cut, List Coloring/tw, Odd Set
