The Expander Hierarchy and its Applications to Dynamic Graph Algorithms - Harald Räcke, TU Munich
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms
Using Expanders for Fast Graph Algorithms - Thatchaphol Saranurak
Developments in Dynamic Graph Algorithms
On Dynamic Graph Approximations: The case of j-Trees
Dynamic graph algorithms against an adaptive adversary via Congestion Balancing
Danupon Na Nongai - New Perspectives on Classic Questions in the Theory of Graph Algorithms
Class 18, Video 2: Expander Graphs
PMSP - Expander graphs: Applications and combinatorial constructions I - Avi Wigderson
PhDOpen - Christian Wulff-Nilsen - Dynamic Graph Algorithms - 14th November 2019 - Part 1
An almost-linear time deterministic algorithm for expander decomposition
PhDOpen - Christian Wulff-Nilsen - Dynamic Graph Algorithms - 15th November 2019 - Part 2
Expander Decomposition and Pruning: Faster, Stronger, and Simpler.
The Margulis expanders
Michael Dinitz: Datacenter Topologies: Expanders and Beyond
Non-amenable groups admitting no sofic approximation by expander graphs - Gabor Kun
Near-Optimal Algorithms for Approximate Min-Cost Flow and Dynamic Shortest Paths
Expander Random Walks: A Fourier-Analytic Approach - Gil Cohen
High-Dimensional Expanders: How I learned to stop worrying and love group-theoretic constructions
Session 9B – Talk 1
