Gramoz Goranci - Vertex sparsification in dynamic algorithms and beyond - UP Math Seminar
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications - Gramoz Goranci
Vertex sparsification in dynamic algorithms and beyond by Gramoz Goranci
Fast Dynamic Cuts, Distances and Effective Resistance via Vertex Sparsifier
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms
Session 9B – Talk 1
On Dynamic Graph Approximations: The case of j-Trees
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms - Harald Räcke, TU Munich
Recent Applications of Expanders to Graph Algorithms - Thatchaphol Saranurak (Uni. of Michigan)
URACult Classics - Flaka Goranci
Dynamic Algorithms for 𝑘-center on Graphs
PODC 2021 — Session 4 Talk 1 — Low-Congestion Shortcuts in Constant Diameter Graphs
Faster High Accuracy Multi-Commodity Flows via Graph Techniques
Michael Dinitz: Datacenter Topologies: Expanders and Beyond
An almost-linear time deterministic algorithm for expander decomposition
Danupon Na Nongai - New Perspectives on Classic Questions in the Theory of Graph Algorithms
Analytic methods
FOCS 2024 8C Near-Optimal (1+epsilon)-Approximate Fully-Dynamic All-Pairs Shortest Paths in Planar
Low Diameter Graph Decompositions and Approximating Unique Games
Non-amenable groups admitting no sofic approximation by expander graphs - Gabor Kun
Guiding Dynamic Programing via Structural Probability for Accelerating Programming by Example
Irit Dinur - High Dimensional Expanders in Theoretical Computer Science (October 27, 2021)
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates
Eigenvectors - SGT Online 2021
Federico Vigolo - Expander graphs (Lecture 1)
