Differences

This shows you the differences between two versions of the page.

--- teaching:2026ss:param_algo:start [2026/06/18 15:38] – [Exercise Sheets] eschmidt
+++ teaching:2026ss:param_algo:start [2026/07/06 11:47] (current) – [Lecture] blaesius
@@ Line 56: / Line 56: @@
   - Above Lower Bound, LP-Duality, Lenstra: {{ :teaching:2026ss:param_algo:06-above-lower-bound-duality-lenstra.pdf |with clicks}}, {{ :teaching:2026ss:param_algo:06-above-lower-bound-duality-lenstra-print.pdf |without clicks}}
   - Color Coding: {{ :teaching:2026ss:param_algo:07-color-coding.pdf |with clicks}}, {{ :teaching:2026ss:param_algo:07-color-coding-print.pdf |without clicks}}
+  - Kernel Lower Bounds: {{ :teaching:2026ss:param_algo:08-kernel-lower-bounds.pdf |with clicks}}, {{ :teaching:2026ss:param_algo:08-kernel-lower-bounds-print.pdf |without clicks}}
+  - Treewidth & Dynamic Programming: {{ :teaching:2026ss:param_algo:09-treewidth.pdf |with clicks}}, {{ :teaching:2026ss:param_algo:09-treewidth-print.pdf |without clicks}}
+  - Courcelle's Theorem & Chordal Graphs: {{ :teaching:2026ss:param_algo:10-courcelle-chordal-graphs.pdf |with clicks}}, {{ :teaching:2026ss:param_algo:10-courcelle-chordal-graphs-print.pdf |without clicks}}
 ===== Exercise Session =====
-  * {{ :teaching:2026ss:param_algo:01-exercise.pdf | Exercise 1}}
+  * {{ :teaching:2026ss:param_algo:01-exercise.pdf | Exercise 1}} -- Bounded Search Trees
-  * {{ :teaching:2026ss:param_algo:02-exercise.pdf | Exercise 2}}
+  * {{ :teaching:2026ss:param_algo:02-exercise.pdf | Exercise 2}} -- Iterative Compression
-  * {{ :teaching:2026ss:param_algo:03-exercise.pdf | Exercise 3}}
+  * {{ :teaching:2026ss:param_algo:03-exercise.pdf | Exercise 3}} -- Kernelization
-  * {{ :teaching:2026ss:param_algo:04-exercise.pdf | Exercise 4}}
+  * {{ :teaching:2026ss:param_algo:04-exercise.pdf | Exercise 4}} -- ILPs and Color Coding
+  * {{ :teaching:2026ss:param_algo:05-exercise.pdf | Exercise 5}} -- Kernel Lower Bounds
 ===== Exercise Sheets =====
 Solutions to the sheets should be submitted via the ILIAS course (https://ilias.studium.kit.edu/ilias.php?baseClass=ilrepositorygui&ref_id=2902870)
@@ Line 68: / Line 73: @@
   * {{ :teaching:2026ss:param_algo:sheet02.pdf | Sheet 2}}, files for implementation task: {{ :teaching:2026ss:param_algo:vertex_cover_assignment.zip | vertex_cover_assignment.zip}}, {{ :teaching:2026ss:param_algo:solution02.pdf | Solution 2}}
   * {{ :teaching:2026ss:param_algo:sheet03.pdf | Sheet 3}}, files for implementation task: {{ :teaching:2026ss:param_algo:closest_string.zip | closest_string.zip}}, {{ :teaching:2026ss:param_algo:solution03.pdf | Solution 3}}
-  * {{ :teaching:2026ss:param_algo:sheet04.pdf | Sheet 4}}
+  * {{ :teaching:2026ss:param_algo:sheet04.pdf | Sheet 4}}, {{ :teaching:2026ss:param_algo:solution04.pdf | Solution 4}}
-  *   {{ :teaching:2026ss:param_algo:sheet05.pdf | Sheet 5}}, files for implementation task: {{ :teaching:2026ss:param_algo:closest_string_ilp.zip |}}
+  *   {{ :teaching:2026ss:param_algo:sheet05.pdf | Sheet 5}}, files for implementation task: {{ :teaching:2026ss:param_algo:closest_string_ilp.zip | closest_string_ilp.zip}}, {{ :teaching:2026ss:param_algo:solution05.pdf | Solution 5}}
+  * {{ :teaching:2026ss:param_algo:sheet06.pdf | Sheet 6}}, files for implementation task: {{ :teaching:2026ss:param_algo:independent_set_twdp.zip |}}
 ===== Active Sessions =====
   - Bounded Search Trees: {{ :teaching:2026ss:param_algo:01-active-search-tree.pdf |slides}} {{ :teaching:2026ss:param_algo:01-active-search-tree-notes.pdf |solution notes}}
   - Color Coding: {{ :teaching:2026ss:param_algo:05-color-coding.pdf |slides}}
+  - Treewidth: {{ :teaching:2026ss:param_algo:03-treewidth.pdf |slides}}