Parameterized Algorithms - Cygan, Marek a Fomin, Fedor V. a Kowalik, Lukasz a Lokshtanov, Daniel a Marx, Daniel a Pilipczuk, Marcin a Pilipczuk, Michal a Saurabh, Saket

Part III presentscomplexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds.All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students.