Media Summary: Authors: Arnold Filtser (Bar-Ilan University); Michael Kapralov, Mikhail Makarov (EPFL) ITCS - Innovations in Theoretical ... I practiced this talk and recorded it. It was given at Weizmann Institute in Feb 2019. Thatchaphol Saranurak delivers Part 1 of the tutorial presentation "

Expander Decomposition In Dynamic Streams - Detailed Analysis & Overview

Authors: Arnold Filtser (Bar-Ilan University); Michael Kapralov, Mikhail Makarov (EPFL) ITCS - Innovations in Theoretical ... I practiced this talk and recorded it. It was given at Weizmann Institute in Feb 2019. Thatchaphol Saranurak delivers Part 1 of the tutorial presentation " What we're going to do today is to use the Thatchaphol Saranurak delivers Part 2 of the tutorial presentation " Computer Science/Discrete Mathematics Seminar II Topic: Using

Maximilian Probst Gutenberg (ETH Zurich) November 19, 2020. Joint work with Aaron Bernstein and Maximilian Probst Gutenberg This video mainly focuses on the technique called "congestion ... ... essentially what we're doing when we like apply these this Danupon Nanongkai and Thatchaphol Saranurak Presented at STOC'17 CMU Theory Lunch Talk Speaker: Henry Fleischmann Date: 11/19/2025 Title: Directed IGAFIT ALGORITHMIC COLLOQUIUM 2 Thatchaphol Saranurak, Toyota Technological Institute at Chicago

Photo Gallery

Expander Decomposition in Dynamic Streams
Expander Decomposition and Pruning: Faster, Stronger, and Simpler.
Thatchaphol Saranurak - Tutorial (Part 1): Expander Decompositions and Applications
Lecture 25: Dynamic Push Relabel (Part 2): Expander Decomposition for Degree Node-Weighting
Thatchaphol Saranurak - Tutorial (Part 2): Expander Decompositions and Applications
Using Expanders for Fast Graph Algorithms - Thatchaphol Saranurak
Deterministic Directed Expander Decomposition and Congestion Balancing with Applications
Dynamic graph algorithms against an adaptive adversary via Congestion Balancing
Lecture 27: Directed Expander Decomposition and Hierarchies
Lecture 30: Combinatorial Max Flow in n^2 Time (Part 3): Leaky Expander Decomposition and Hierarchy
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms
Dynamic Spanning Forest with Worst-case Update Time: Adaptive, Las Vegas, and O(n^{1/2-eps})-time
View Detailed Profile
Expander Decomposition in Dynamic Streams

Expander Decomposition in Dynamic Streams

Authors: Arnold Filtser (Bar-Ilan University); Michael Kapralov, Mikhail Makarov (EPFL) ITCS - Innovations in Theoretical ...

Expander Decomposition and Pruning: Faster, Stronger, and Simpler.

Expander Decomposition and Pruning: Faster, Stronger, and Simpler.

I practiced this talk and recorded it. It was given at Weizmann Institute in Feb 2019.

Thatchaphol Saranurak - Tutorial (Part 1): Expander Decompositions and Applications

Thatchaphol Saranurak - Tutorial (Part 1): Expander Decompositions and Applications

Thatchaphol Saranurak delivers Part 1 of the tutorial presentation "

Lecture 25: Dynamic Push Relabel (Part 2): Expander Decomposition for Degree Node-Weighting

Lecture 25: Dynamic Push Relabel (Part 2): Expander Decomposition for Degree Node-Weighting

What we're going to do today is to use the

Thatchaphol Saranurak - Tutorial (Part 2): Expander Decompositions and Applications

Thatchaphol Saranurak - Tutorial (Part 2): Expander Decompositions and Applications

Thatchaphol Saranurak delivers Part 2 of the tutorial presentation "

Using Expanders for Fast Graph Algorithms - Thatchaphol Saranurak

Using Expanders for Fast Graph Algorithms - Thatchaphol Saranurak

Computer Science/Discrete Mathematics Seminar II Topic: Using

Deterministic Directed Expander Decomposition and Congestion Balancing with Applications

Deterministic Directed Expander Decomposition and Congestion Balancing with Applications

Maximilian Probst Gutenberg (ETH Zurich) https://kyng.inf.ethz.ch/acseminar/2020-11-19_probst.html November 19, 2020.

Dynamic graph algorithms against an adaptive adversary via Congestion Balancing

Dynamic graph algorithms against an adaptive adversary via Congestion Balancing

Joint work with Aaron Bernstein and Maximilian Probst Gutenberg This video mainly focuses on the technique called "congestion ...

Lecture 27: Directed Expander Decomposition and Hierarchies

Lecture 27: Directed Expander Decomposition and Hierarchies

... essentially what we're doing when we like apply these this

Lecture 30: Combinatorial Max Flow in n^2 Time (Part 3): Leaky Expander Decomposition and Hierarchy

Lecture 30: Combinatorial Max Flow in n^2 Time (Part 3): Leaky Expander Decomposition and Hierarchy

Instead of a f

The Expander Hierarchy and its Applications to Dynamic Graph Algorithms

The Expander Hierarchy and its Applications to Dynamic Graph Algorithms

Gramoz Goranci (University of Toronto) https://kyng.inf.ethz.ch/acseminar/talk.html?id=2021-05-13_goranci.

Dynamic Spanning Forest with Worst-case Update Time: Adaptive, Las Vegas, and O(n^{1/2-eps})-time

Dynamic Spanning Forest with Worst-case Update Time: Adaptive, Las Vegas, and O(n^{1/2-eps})-time

Danupon Nanongkai and Thatchaphol Saranurak Presented at STOC'17 https://arxiv.org/abs/1611.03745.

Dynamic Mode Decomposition (Overview)

Dynamic Mode Decomposition (Overview)

In this video, we introduce the

Henry Fleischmann: Directed Expander Decompositions, a Gardener's Guide

Henry Fleischmann: Directed Expander Decompositions, a Gardener's Guide

CMU Theory Lunch Talk Speaker: Henry Fleischmann Date: 11/19/2025 Title: Directed

An almost-linear time deterministic algorithm for expander decomposition

An almost-linear time deterministic algorithm for expander decomposition

IGAFIT ALGORITHMIC COLLOQUIUM 2 Thatchaphol Saranurak, Toyota Technological Institute at Chicago