Explores the application of the SIMPLE algorithm in solving Navier-Stokes equations and compares staggered grid vs. collocated grid approaches in numerical flow simulations.
Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.