The 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND)

June 9-11, 2025 | Liverpool, UK

Conference Program

The SAND program includes 16 regular papers, 8 brief announcements, and 3 keynotes. Each regular paper is allocated a 30-minute slot, and each brief announcement a 15-minute slot, both including time for questions. Apart from the coffee breaks, coffee will also be available each morning from 08:30 to 09:00.

Monday, June 9, 2025

08:30 – 08:50
Registration
08:50 – 09:00
Welcome & Introduction
09:00 – 10:00
Invited Talk 1
Details to follow
10:00 – 10:30
Coffee Break
10:30 – 12:00
SESSION 1: Temporal Graphs I
Session Chair: TBA

Matching and Edge Cover in Temporal Graphs
Lapo Cioni, Riccardo Dondi, Ana Shirley Ferreira Da Silva, Andrea Marino, Jason Schoeters

Temporal Dominating Set and Temporal Vertex Cover under the Lense of Degree Restrictions
Anton Herrmann, Christian Komusiewicz, Nils Morawietz, Frank Sommer

Brief Announcement: The Shortest Temporal Exploration Problem
Antoine Toullalan, Stefan Balev, Éric Sanlaville

Brief Announcement: Exploring Word-Representable Temporal Graphs
Duncan Adamson

12:00 – 13:00
SESSION 2: Open Problems I
13:00 – 14:30
Lunch
14:30 – 16:00
SESSION 3: Mobile Robots and Agents
Session Chair: TBA

Fault Detection and Identification by Autonomous Mobile Robots
Caterina Feletti, Stefano Clemente

Self-Stabilizing Weakly Byzantine Perpetual Gathering of Mobile Agents
Jion Hirose, Ryota Eguchi, Yuichi Sudo

Hardness of Traversing Gadget Systems with Small Bandwidth
MIT Gadgets Group, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Markus Hecher, Jayson Lynch

16:00 – 16:30
Coffee Break
16:30 – 18:00
SESSION 4: Tile Systems and Programmable Matter
Session Chair: TBA

Fractals in Seeded Tile Automata
Asher Haun, Ryan Knobel, Adrian Salinas, Ramiro Santos, Robert Schweller, Tim Wylie

On the Runtime of Local Mutual Exclusion for Anonymous Dynamic Networks
Anya Chaturvedi, Joshua Daymude, Andrea Richa

Brief Announcement: Intrinsic Universality in Seeded Active Tile Self-Assembly
Tim Gomez, Elise Grizzell, Asher Haun, Ryan Knobel, Tom Peters, Robert Schweller, Tim Wylie

Brief Announcement: Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits
Nada Almalki, Siddharth Gupta, Othon Michail, Andreas Padalkin

18:00 – 18:30
SESSION 5: Open Problems II, Interaction / Research
18:30 – 20:00

Tuesday, June 10, 2025

09:00 – 10:00
Invited Talk 2
Details to follow
10:00 – 10:30
Coffee Break
10:30 – 12:00
SESSION 6: Temporal Graphs II
Session Chair: TBA

Dismountability in Temporal Cliques Revisited
Daniele Carnevale, Arnaud Casteigts, Timothée Corsini

Temporal Connectivity Augmentation
Thomas Bellitto, Jules Bouton Popper, Bruno Escoffier

Spanner Enumeration for Temporal Graphs
Kazuhiro Kurita, Andrea Marino, Jason Schoeters, Takeaki Uno

12:00 – 13:00
SESSION 7: Open Problems III
13:00 – 14:30
Lunch
14:30 – 15:30
SESSION 8: Best Papers
Session Chair: TBA
Best student paper:
Undecidability of the Emptiness Problem for Weak Models of Distributed Computing
Flavio Principato, Javier Esparza, Philipp Czerner
Best paper:
The Expressive Power of Uniform Population Protocols with Logarithmic Space
Philipp Czerner, Vincent Fischer, Roland Guttenberg
15:30 – 16:00
Coffee Break
16:00 – 17:30
Business Meeting
18:00 – 22:00

Wednesday, June 11, 2025

09:00 – 10:00
Invited Talk 3
Details to follow
10:00 – 10:30
Coffee Break
10:30 – 12:00
SESSION 9: Temporal Graphs III
Session Chair: TBA

Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs
David Kutner, Anouk Sommer

Restless Exploration and Token Dissemination in Vertex-Permuted Graphs
Kamran Ayoubi, Lata Narayanan

Brief Announcement: Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases
Julia Meusel, Matthias Müller-Hannemann, Klaus Reinhardt

Brief Announcement: Broadcast via Mobile Agents in a Dynamic Network: Interplay of Graph Properties & Agents
William K. Moses Jr., Amanda Redlich, Frederick Stock

12:00 – 12:30
SESSION 10: Open Problems IV (Wrap up)
12:30 – 14:00
Lunch
14:00 – 15:30
SESSION 11: Dynamic Algorithms and Populations Protocols
Session Chair: TBA

On b-Matching and Fully-Dynamic Maximum k-Edge Coloring
Antoine El-Hayek, Kathrin Hanauer, Monika Henzinger

Dynamic Debt Swapping in Financial Networks
Henri Froese, Martin Hoefer, Lisa Wilhelmi

Brief Announcement: Anonymous Distributed Localisation via Spatial Population Protocols
Leszek Gąsieniec, Łukasz Kuszner, Ehsan Latif, Ramviyas Parasuraman, Paul Spirakis, Grzegorz Stachowiak

Brief Announcement: Reachability and Coverability in Deletion-only Chemical Reaction Networks
Bin Fu, Timothy Gomez, Ryan Knobel, Austin Luchsinger, Marco Rodriguez, Adrian Salinas, Robert Schweller, Tim Wylie

15:30 – 16:00
Coffee Available
16:00
End of SAND 2025 Conference