All talks listed in Pacific Time. Schedule subject to change.

–
Coffee and Check-In
–
Opening Remarks
–
Almost-linear Time Algorithms for Partially Dynamic Graphs

Rasmus Kyng (ETH Zurich)
–
Break
–
Differentially Private Matchings

Quanquan Liu (Yale University)
–
Lunch (on your own)
–
One Attack to Rule Them All: Cardinality Sketches under Adaptive Inputs

Edith Cohen (Google and TAU)
–
Break
–
Talk by

Deeksha Adil (ETH Zurich)
–
Reception
–
Coffee and Check-In
–
Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness

David Woodruff (Carnegie Mellon University)
–
Break
–
Decremental Matching in Weighted Non-Bipartite Graphs

Jiale Chen (Stanford University)
–
Lunch (on your own)
–
Faster single-source shortest paths with negative real weights via proper hop distance

Kent Quanrud (Purdue University)
–
Break
–
Coffee and Check-In
–
Near-Optimal Approximate Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs

Gramoz Goranci (University of Vienna)
–
Break
–
Simpler and Faster Spectral Sparsification for Eulerian Directed Graphs (Part 1)

Arun Jambulapati (University of Texas at Austin),
Sushant Sachdeva (University of Toronto)
–
Lunch (on your own)
–
Simpler and Faster Spectral Sparsification for Eulerian Directed Graphs (Part 2)

Sushant Sachdeva (University of Toronto),
Arun Jambulapati (University of Texas at Austin)
–
Break
–
Open Problems Session
–
Coffee and Check-In
–
Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth

Sorrachai Yingchareonthawornchai (Institute for Theoretical Studies, ETH Zurich)
–
Break
–
Streaming Algorithms for Network Design

Sepideh Mahabadi (Microsoft Research)
–
Closing Remarks