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

–
Coffee and Check-in
–
Opening Remarks
–
Lightning Talks
–
Approximating Edit Distance in the Fully Dynamic Model
Barna Saha (UC San Diego)
–
Break
–
Recent Advances in Diversity Maximization in the Offline and Composable Coreset Models
Sepideh Mahabadi (Microsoft Research)
–
Lunch
–
Optimizing Dynamic-Graph Data Structures on Multicores with the Locality-First Strategy
Helen Xu
–
Parallelism in Dynamic Graph Algorithms
Guy Blelloch (Carnegie Mellon University)
–
Reception
–
Coffee and Check-in
–
Recent Progress on Sublinear Time Algorithms for Maximum Matching: Upper Bounds
Soheil Behnezhad (Northeastern University)
–
A Blackbox Reduction for Adaptive Adversaries using Differential Privacy
Thatchaphol Saranurak (University of Michigan)
–
Break
–
Dynamic Algorithms for 𝑘-center on Graphs
Sebastian Forster (University of Salzburg)
–
Lunch
–
Parallel Batch-Dynamic Graph Representations
Laxman Dhulipala (University of Maryland)
–
Break
–
Dynamic Matching: Rounding & Sparsification (And New Tools)
David Wajc (Technion -- Israel Institute of Technology)
–
Discussion Time
–
Coffee and Check-in
–
Decremental Shortest Paths against an Adaptive Adversary
Aaron Bernstein (Rutgers University)
–
Practical Dynamic Graph Algorithms: Data Structures and Connections Between Models
Quanquan Liu (Northwestern University)
–
Break
–
Online List Labeling: Breaking the log^2 n Barrier
Nicole Wein (Simons Institute)
–
Lunch
–
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates
Sayan Bhattacharya (University of Warwick)
–
Break
–
Dynamic PageRank: Additive Error and Batch Recomputation
Jakub Lacki (Google Research)
–
Discussion Time
–
Coffee and Check-in
–
Dynamic Graphs on the GPU
John Owens (UC Davis)
–
On Engineering Dynamic Graph Algorithms
Kathrin Hanauer (University of Vienna)
–
Break
–
On Dynamic Graph Approximations: The case of j-Trees
Gramoz Goranci (University of Vienna)
–
Lunch
–
Minimum Isolating Cuts: A New Tool for Solving Minimum Cut Problems
Jason Li (Simons Institute, UC Berkeley)
–
Break
–
Faster High Accuracy Multi-Commodity Flows via Graph Techniques
Jan van der Brand (KTH Royal Institute of Technology)
–
Discussion Time
–
Coffee and Check-in
–
Recent Progress on Sublinear Time Algorithms for Maximum Matching: Lower Bounds
Soheil Behnezhad (Northeastern University)
–
Parallel Batch-Dynamic Graph Algorithms
Julian Shun (MIT)
–
Accelerating the Multiplicative-Weights Framework for Graph Linear Programs
Omri Weinstein (Princeton University)
–
Workshop Concludes