Wg qcolorable
Kernelization Complexity of Colorful Motifs
Research in CS
Connected Dominating Set and Short Cycles
Expansions for Reductions
Cheat Sheets for Hard Problems
A Kernel for Planar F-deletion: The Connected Case
From FVS to F-Deletion
Efficient Simplification: The (im)possibilities
Kernels for Planar F-Deletion (Restricted Variants)
Separators with Non-Hereditary Properties
Lower bounds on kernelization
01 - 01 January - Sorting
08 - 25 Jan - Divide and Conquer
13 - 06 Feb - Dynamic Programming
04 - 15 Jan - Heap Sort
05 - 18 Jan - The Sorting Wrap-Up
10 - 29 Jan - Recursion Part 2
11 - 03 Feb - From Recursion to Dynamic Programming
