Program of Workshop on Foundations of Distributed and Parallel Graph Algorithms (Venice 2026)
Monday (May 18)
- 09:00 - 09:30 Coffee
- 09:30 - 09:45 Welcome
- 09:45 - 10:45 Pierre Fraigniaud
- Algorithmic Meta-Theorems for Distributed Computing
- 10:45 - 11:30 Coffee break
- 11:30 - 12:00 Christian Konrad
- The Semi-Robust Communication Complexity of Maximum Matching
- 12:00 - 12:30 Francesco d'Amore
- Distributed Algorithms for Local Potential Problems
- 12:30 - 14:30 Lunch at OKE Zattere
- 15:00 - 15:30 Seth Gilbert
- Byzantine Agreement with Predictions
- 15:30 - 16:00 Slobodan Mitrović
- Sparsification Framework for Directed Densest Subgraph in MPC, Semi-Streaming, and Sublinear-Time Model
- 16:00 - 16:30 Coffee break
- 16:30 - 18:00 Open Problem Session + Research discussions
- 18:00 - 19:00 Welcome reception
Tuesday (May 19)
- 09:00 - 09:30 Coffee
- 09:30 - 10:30 Seth Pettie
- Survey of the Distributed Lovász Local Lemma
- 10:30 - 11:00 Coffee break
- 11:00 - 11:30 Gustav Schmid
- LCLs with and without knowledge of n
- 11:30 - 12:00 Yuval Emek
- Self-Stabilizing Algorithms in the Uniform Port Model
- 12:00 - 12:30 Sebastian Brandt
- On Distributed Lower Bound Techniques and a Gap in the Distributed Complexity Landscape
- 13:00 - 14:30 Lunch at Ristorante San Trovaso
- 15:00 - 15:30 Anish Mukherjee
- Towards Optimal-pass Semi-streaming Matchings and Beyond
- 15:30 - 16:00 Yi-Jun Chang
- Distributed Minimum Weight Cycle Approximation
- 16:00 - 16:30 Coffee break
- 16:30 - 18:00 Research discussions
Wednesday (May 20)
- 09:00 - 09:30 Coffee
- 09:30 - 10:30 Ronitt Rubinfeld
- Graph k-Coloring in Average Sublinear Time
- 10:30 - 11:00 Coffee break
- 11:00 - 11:30 Gopinath Mishra
- Graph Coloring Problems in the Two Party Communication Model
- 11:30 - 12:00 Amitabh Trehan
- Amnesiac Flooding and Self-Healing
- 12:00 - 12:30 François Le Gall
- Challenges in Quantum Distributed Computing
- 12:30 - 14:30 Lunch at OKE Zattere
- 15:00 - 15:30 Yannic Maus
- Robust Shattering Arguments (part 1)
- 15:30 - 16:00 Alexandre Nolin
- Robust Shattering Arguments (part 2)
- 16:00 - 16:30 Coffee break
- 16:30 - 18:00 Research discussions
- 19:00 - 26:15 Dinner at Ristorante Vecia Cavana
Thursday (May 21)
- 09:00 - 09:30 Coffee
- 09:30 - 10:30 Aaron Schild
- Breaking Barriers and Closing Gaps for MIS and MM by Understanding Vertex Survival Probability
- 10:30 - 11:00 Coffee break
- 11:00 - 11:30 Gregory Schwartzman
- What Can We Learn from Neuronal Connectivity Alone?
- 11:30 - 12:00 Hsin-Hao Su
- Neighborhood Similarity: A New Application and Technique
- 12:00 - 12:30 Ami Paz
- Zero-Knowledge Distributed Certification
- 13:00 - 15:00 Lunch at Ristorante San Trovaso
- 15:00 - 19:00 Research discussions
Webpage with abstracts and slides
The workshop is by invitation only
Dates
May 18 - 21, 2026
Location
Palazzo Giustinian Lolin, Calle Giustinian, 2893, 30124 Venezia, Italy
Organizers:
- Alkida Balliu (Gran Sasso Science Institute (GSSI))
- Artur Czumaj (University of Warwick)
- Peter Davies-Peck (Durham University)