Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.
Explores the role of higher-order topological properties in complex networks using topological data analysis for structural break and price anomaly detection.
