Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications - Gramoz Goranci
On Dynamic Graph Approximations: The case of j-Trees
Vertex sparsification in dynamic algorithms and beyond by Gramoz Goranci
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms - Harald Räcke, TU Munich
PODC 2021 — Session 4 Talk 1 — Low-Congestion Shortcuts in Constant Diameter Graphs
Session 9B – Talk 1
Gramoz Goranci - Vertex sparsification in dynamic algorithms and beyond - UP Math Seminar
An almost-linear time deterministic algorithm for expander decomposition
Recent Applications of Expanders to Graph Algorithms - Thatchaphol Saranurak (Uni. of Michigan)
Guiding Dynamic Programing via Structural Probability for Accelerating Programming by Example
CodeCamp Day 16 | Solving more and Complex Dynamic Programming Problems
Part 8: cut matching game
Fast Dynamic Cuts, Distances and Effective Resistance via Vertex Sparsifier
Michael Dinitz: Datacenter Topologies: Expanders and Beyond
Incremental View Maintenance 1
Pseudo-Quasi-Random Boolean Functions (Zoom for Thought 11/02/21)
URACult Classics - Flaka Goranci
Danupon Na Nongai - New Perspectives on Classic Questions in the Theory of Graph Algorithms
Eigenvectors - SGT Online 2021
Low Diameter Graph Decompositions and Approximating Unique Games
