All talks are listed in Pacific time. *Schedule subject to change*

–
Coffee and Check-in
–
Opening Remarks
–
Lightning Talks
Video
–
Approximating Edit Distance in the Fully Dynamic Model

Barna Saha (UC San Diego)
Video
–
Break
–
Recent Advances in Diversity Maximization in the Offline and Composable Coreset Models

Sepideh Mahabadi (Microsoft Research)
Video
–
Lunch
–
Optimizing Dynamic-Graph Data Structures on Multicores with the Locality-First Strategy

Helen Xu
Video
–
Parallelism in Dynamic Graph Algorithms

Guy Blelloch (Carnegie Mellon University)
Video
–
Reception
–
Coffee and Check-in
–
Recent Progress on Sublinear Time Algorithms for Maximum Matching: Upper Bounds

Soheil Behnezhad (Northeastern University)
Video
–
A Blackbox Reduction for Adaptive Adversaries using Differential Privacy

Thatchaphol Saranurak (University of Michigan)
Video
–
Break
–
Dynamic Algorithms for 𝑘-center on Graphs

Sebastian Forster (University of Salzburg)
Video
–
Lunch
–
Parallel Batch-Dynamic Graph Representations

Laxman Dhulipala (University of Maryland)
Video
–
Break
–
Dynamic Matching: Rounding & Sparsification (And New Tools)

David Wajc (Technion -- Israel Institute of Technology)
Video
–
Discussion Time
–
Coffee and Check-in
–
Decremental Shortest Paths against an Adaptive Adversary

Aaron Bernstein (Rutgers University)
Video
–
Practical Dynamic Graph Algorithms: Data Structures and Connections Between Models

Quanquan Liu (Northwestern University)
Video
–
Break
–
Online List Labeling: Breaking the log^2 n Barrier

Nicole Wein (University of Michigan)
Video
–
Lunch
–
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates

Sayan Bhattacharya (University of Warwick)
Video
–
Break
–
Dynamic PageRank: Additive Error and Batch Recomputation

Jakub Lacki (Google Research)
Video
–
Discussion Time
–
Coffee and Check-in
–
Dynamic Graphs on the GPU

John Owens (UC Davis)
Video
–
On Engineering Dynamic Graph Algorithms

Kathrin Hanauer (University of Vienna)
Video
–
Break
–
On Dynamic Graph Approximations: The case of j-Trees

Gramoz Goranci (University of Vienna)
Video
–
Lunch
–
Minimum Isolating Cuts: A New Tool for Solving Minimum Cut Problems

Jason Li (Simons Institute, UC Berkeley)
Video
–
Break
–
Faster High Accuracy Multi-Commodity Flows via Graph Techniques

Jan van der Brand (KTH Royal Institute of Technology)
Video
–
Discussion Time
–
Coffee and Check-in
–
Recent Progress on Sublinear Time Algorithms for Maximum Matching: Lower Bounds

Soheil Behnezhad (Northeastern University)
Video
–
Parallel Batch-Dynamic Graph Algorithms

Julian Shun (MIT)
Video
–
Accelerating the Multiplicative-Weights Framework for Graph Linear Programs

Omri Weinstein (Princeton University)
Video
–
Workshop Concludes