Parameter­ized Complexity school lectures

These lectures are from two schools on parameterized complexity. The 2014 ASPAK lectures at IMSc covered intractability through the W-hierarchy, lower bounds based on ETH and SETH, Cut & Count, polynomial methods for finding paths, and matroids. The 2016 lectures (at a school under the National Mathematics Initiative) covered kernels, iterative compression, chromatic coding and bidimensionality, and lower bounds for both FPT algorithms and kernels. Together they cover both sides of the field: techniques for designing fast parameterized algorithms, and tools for showing when such algorithms are unlikely to exist.