Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.
Explores rigorous upper and lower bounds for isotropic phase composites and their microstructure arrangement, focusing on laminated plates and stress-strain relationships.
