Using Expanders for Fast Graph Algorithms - Thatchaphol Saranurak
Using expanders for dynamic graph algorithms: a survey of tools by Thatchaphol Saranurak
Expanders and Communication-Avoiding Algorithms - Oded Schwartz
Recent Applications of Expanders to Graph Algorithms - Thatchaphol Saranurak (Uni. of Michigan)
Thatchaphol Saranurak - Tutorial (Part 1): Expander Decompositions and Applications
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
Introduction to Length-Constrained Expanders and Expander Decompositions
Expander Graphs (full lecture) || @ CMU || Lecture 16 of CS Theory Toolkit
Cycles and trees in (pseudo)random graphs 1, Hong Liu
Deterministic Directed Expander Decomposition and Congestion Balancing with Applications
Jeroen Schillewaert (Auckland), Constructing highly regular expanders from hyperbolic Coxeter groups
Class 18, Video 2: Expander Graphs
Expander Graph Application 2: Derandomization || @ CMU || Lecture 16c of CS Theory Toolkit
High Dimensional Expanders - Ori Parzanchevski
Expander Decomposition and Pruning: Faster, Stronger, and Simpler.
Techniques for combinatorial optimization: Spectral Graph Theory and Semidefinite Programming
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and ...
Expanders -Lecture 3 - Part 6.mp4
Fast mixing via polymers for random graphs with unbounded degree
