Below is the overall program of SAND 2023. A printable version of the program is here.

Inquiries can be sent at

June 18

Welcome reception(starting at 7:30 pm):
Hotel Duomo
Via S. Maria, 94
Grand Hotel Duomo

June 19

8:30-8:50 Registration
8:50-9:00 Introduction
9:00-9:50 Keynote: Kitty Meeks, University of Glasgow
In search of useful temporal graph parameters
(Chair: TBD)
9:50-10:30 Coffee Break
10:30-12:10 Session 1: Temporal and Dynamic Graph Algorithms (Chair: TBD)

10:30 - 10:55 Restless Temporal Graph Exploration
Thomas Bellitto, Cyril Conchon-Kerjan and Bruno Escoffier

10:55 - 11:20 Dynamic Graphs Generators Analysis: an Illustrative Case Study
Vincent Bridonneau, Frédéric Guinand and Yoann Pigné

11:20 - 11:45 (best student paper award) Snapshot Disjointness in Temporal Graphs
Allen Ibiapina and Ana Silva

11:45 - 12:10 Adaptive Collective Responses to Local Stimuli in Anonymous Dynamic Networks
Shunhao Oh, Dana Randall and Andrea Richa
12:10-14:30 Lunch
14:30-15:45 Session 2: Dynamic Graph Algorithms

14:30 - 14:55 (best paper award) When Should You Wait Before Updating?: Toward a Robustness Refinement
Swan Dubois, Laurent Feuilloley, Franck Petit and Mikaël Rabie

14:55 - 15:20 Bond Percolation in Small-World Graphs with Power-Law Distribution
Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan and Isabella Ziccardi

15:45-16:30 Coffee Break
16:30-17:45 Session 3: Mobile Computing and Robotics (Chair: TBD)

16:30 - 16:55 Partial Gathering of Mobile Agents in Dynamic Tori
Masahiro Shibata, Naoki Kitamura, Ryota Eguchi, Yuichi Sudo, Junya Nakamura and Yonghwan Kim

16:55 - 17:20 Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines
Joshua Ani, Michael Coulombe, Erik D. Demaine, Yevhenii Diomidov, Timothy Gomez, Dylan Hendrickson and Jayson Lynch

17:20 - 17:45 Covert Computation in the Abstract Tile-Assembly Model
Robert M. Alaniz, David Caballero, Timothy Gomez, Elise Grizzell, Andrew Rodriguez, Robert Schweller and Tim Wylie
18:00-19:00 Business Meeting
20:00- Social Dinner

June 20

9:00-9:50 Keynote: Nicola Santoro, Carleton University
Moving in Time-Varying Graphs
(Chair: TBD)
9:50-10:30 Coffee Break
10:30-11:20 Session 4: Temporal Graph Algorithms (Chair: TBD)

10:30 - 10:55 Complexity of the Temporal Shortest Path Interdiction Problem
Jan Boeckmann, Clemens Thielen and Alina Wittmann

10:55 - 11:20 Computing Temporal Reachability under Waiting-Time Constraints in Linear Time
Filippo Brunelli and Laurent Viennot

11:30 - 12:30 Open Problems
12:30-14:30 Lunch
14:30-15:20 Keynote: Fabian Kuhn, Albert-Ludwigs-Universität
Deterministic Rounding: An Algorithmic Tool for Efficient Deterministic Distributed Symmetry Breaking
(Chair: TBD)
15:20-16:00 Coffee Break
16:00-17:15 Session 5: Dynamic Networks and Distributed Algorithms (Chair: TBD)

16:00 - 16:25 A Connectivity-Sensitive Approach to Consensus Dynamics
Bernard Chazelle and Kritkorn Karntikoon

16:25 - 16:50 Making Self-Stabilizing Algorithms for any Locally Greedy Problem
Mikaël Rabie, Johanne Cohen, Laurence Pilard and Jonas Sénizergues

16:50 - 17:15 Multistage Shortest Path: Instances and Practical Evaluation
Markus Chimani and Niklas Troost
17:15-17:30 Conference Closure