Danupon Na Nongai - New Perspectives on Classic Questions in the Theory of Graph Algorithms
TCS+ talk: Danupon Nanongkai
Negative-Weight Single-Source Shortest Paths in Near-linear TimeDanupon Nanongkai
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms - Harald Räcke, TU Munich
Michael Dinitz: Datacenter Topologies: Expanders and Beyond
Recent Applications of Expanders to Graph Algorithms - Thatchaphol Saranurak (Uni. of Michigan)
Federico Vigolo - Expander graphs (Lecture 1)
Some Emergency Barriers to Worst-Case Dynamic MST
An almost-linear time deterministic algorithm for expander decomposition
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications - Gramoz Goranci
Jeroen Schillewaert (Auckland), Constructing highly regular expanders from hyperbolic Coxeter groups
Locally testable codes with constant rate, distance, and locality, Part I - Irit Dinur
Proofs and Circuits: Connections via Interpolation and Lifting
PODC 2021 — Session 4 Talk 1 — Low-Congestion Shortcuts in Constant Diameter Graphs
Session 9B – Talk 1
Part 8: cut matching game
Non-amenable groups admitting no sofic approximation by expander graphs - Gabor Kun
Expander Decomposition and Pruning: Faster, Stronger, and Simpler.
Research Discussion on Graphs and Groups - Lecture 12
