Abstract for talk by Michael Fellows

Title: Cliques in Parameterized Hardness
 
Problems about cliques underpin most hardness results in parameterized complexity, both in the sense of W-hardness, and in the “more modern” optimality program. The talk will survey the basic ideas, and give a how-to tutorial on proving W[1]-hardness results by reductions from MULTICOLOR CLIQUE.