Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.
Covers integrating functions over graph surfaces in vector calculus, emphasizing the interpretation of divergence theorem and special cases of domain between two graphs.