Lectures related to Branch-decomposition

Covers the implementation and analysis of disjoint sets data structure and introduces the concept of minimum spanning trees.

Covers the concept of matroids, focusing on matroid intersection and the properties of subsets of a ground set.

Explores worst-case complexity in computer science and the importance of real-life complexity in algorithm selection.

Explores optimal integer programming, Gomory cuts, and an iterative rounding heuristic.

Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.