Welcome to the website to the tutorial class of Introduction to Parameterized Algorithms (lecturers Jiri Fiala and Martin Koutecky).
This class is co-taught with Martin Korecek.
The lecture's website is here (it might not exist yet).
If you have a feeling that
You will get credit for solving homework. There will be a homework set every two weeks. You need 66 % of the points to obtain the credit.
Submit your homework solutions in the Postal Owl.
The enrollment token is fc4adb329e07.
I encourage discussing homework solutions among yourselves. However, make sure you create the submitted solution on your own.
Using computer algebra systems is fully allowed and encouraged in your solutions. Ideally, please send a link/certificate in the complexity sense to how you used it for solving the problem. So e.g. a Wolfram alpha URL that includes your expression.
| Date | Topic | Task statement | Solutions | Remarks |
| (by Tung) | Kernelization | Handwritten solutions | ||
| (by Martin) | Branch & Bound | Handwritten solutions | ||
| (by Tung) | Randomized FPT algorithm for Longest Path problem via Color Coding | Included in the task statement | ||
| (by Martin) | Branch & Bound: but much spicier | TODO | ||
| (by Martin) | Integer programming and neighborhood diversity | |||
| (by Martin) | Harder kernelization | |||
| (by Martin) | Iterative compression | We had a crash course on the technique and solved a couple of exercises. Everything I talked about is taken from Chapter 4 of the Parameterized Algorithms book. | ||
| (by Martin) | Integer programming & neighborhood diversity vol. 2 | |||
| (by Martin) | Hard problems | Most of the tutorial, I talked about the W hierarchy and (S)ETH. We only solved exercise 1. | ||
| (by Martin) | TBD | |||
| (by Martin) | TBD | |||
| (by Martin) | TBD |