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

July 1-3, 2026 | Le Havre, France

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.

 

Wednesday, July 1, 2026

08:30 – 08:50
Registration
08:50 – 09:00
Welcome & Introduction
09:00 – 10:00
Invited Talk 1: Christian Scheideler
Session Chair: TBA

Supervised Distributed Computing

10:00 – 10:30
Coffee Break
10:30 – 12:00
SESSION 1: Temporal Graphs I
Session Chair: TBA

Complexity gaps between point and interval temporal graphs for some reachability problems
Guillaume Aubian, Filippo Brunelli, Feodor Dragan, Guillaume Ducoffe, Michel Habib, Allen Ibiapina and Laurent Viennot

FO and MSO model checking on temporal graphs
Michelle Döring, Jessica Enright, Laura Larios-Jones and George Skretas

Brief Announcement: Exploration of always S-connected temporal graphs
Duncan Adamson and Paul G. Spirakis

Brief Announcement: Revisiting the realizability of periodic temporal graphs with bounded stretch
Julia Meusel, Nils Morawietz, Matthias Müller-Hannemann and Klaus Reinhardt

12:00 – 13:00
SESSION 2: Open Problems I
Session Chair: George B. Mertzios and Andrea Richa
13:00 – 14:30
Lunch
14:30 – 16:00
SESSION 3: Mobile Robots and Programmable Matter
Session Chair: TBA

Asynchronous rendezvous of anonymous deterministic mobile automata in the plane
Mohamed Anouar Baaziz and Andrzej Pelc

Searching for an eventually-emerging black hole in rings
François Bonnet, Quentin Bramas and Anissa Lamani

Brief Announcement: Leader election with noisy reconfigurable circuits in the Amoebot model
Daniel Warner and Christian Scheideler

Brief Announcement: Time-travel planning with tenet turnstiles
Thibaut Blanc, Quentin Bramas, Jean-Romain Luttringer and Sebastien Tixeuil

16:00 – 16:30
Coffee Break
16:30 – 18:00
SESSION 4: Distributed and Online Algorithms
Session Chair: TBA

Broadcasts in anonymous, dynamic networks: A new algorithm and impossibility results
Volker Turau

Asymptotic subspace consensus in dynamic networks
Matthias Függer and Thomas Nowak

Online algorithms for set packing with renewable capacities
Anya Chaturvedi, William K. Moses Jr., Christian Scheideler and Prudence Wong

18:00 – 18:30
SESSION 5: Open Problems II, Interaction / Research
Session Chair: George B. Mertzios and Andrea Richa

Thursday, July 2, 2026

09:00 – 10:00
Invited Talk 2: Paola Flocchini
Session Chair: TBA

Moving and Computing: Changing Shape and Dancing under Sequential Schedulers

10:00 – 10:30
Coffee Break
10:30 – 12:00
SESSION 6: Temporal Graphs II
Session Chair: TBA

Robust temporal cut
Jessica Enright, Thomas Erlebach, Kitty Meeks and Nils Morawietz

Designing sparse temporal graphs satisfying connectivity requirements
Thomas Bellitto, Jules Bouton Popper, Justine Cauvi, Bruno Escoffier and Raphaëlle Maistre

On sufficient conditions for short journeys in temporal graphs
David Ilcinkas, Nils Morawietz and Antoine Toullalan

12:00 – 13:00
SESSION 7: Open Problems III
Session Chair: George B. Mertzios and Andrea Richa
13:00 – 14:30
Lunch
14:30 – 15:30
SESSION 8: Best Papers
Session Chair: George B. Mertzios

Best student paper: Extending Ghouila-Houri’s characterization of comparability graphs to temporal graphs
Pierre Charbit, Michel Habib and Amalia Sorondo

Best paper: Families of tractable problems with respect to vertex-interval-membership width and its generalisations
Jessica Enright, Samuel Hand, Laura Larios-Jones and Kitty Meeks

15:30 – 16:00
Coffee Break
16:00 – 17:30
Business Meeting
18:00 – 22:00
Social Event

Friday, July 3, 2026

09:00 – 10:00
Invited Talk 3: Stefan Schmid
Session Chair: TBA

Revolutionizing Datacenter Networks with Reconfigurable Topologies: Vision, Algorithmic Foundations and Challenges

10:00 – 10:30
Coffee Break
10:30 – 12:00
SESSION 9: Temporal Graphs III
Session Chair: TBA

Label correcting algorithms for the multiobjective temporal shortest path problem
Edina Marica, Clemens Thielen and Alina Wittmann

Minimize the sum of waiting times in periodic temporal trees
Julia Meusel, Nils Morawietz, Matthias Müller-Hannemann and Klaus Reinhardt

Brief Announcement: A special case of maximum flow over time with network changes
Kristin Sheridan and Shuchi Chawla

Brief Announcement: Demand-aware consistent hashing with bounded loads and greedy routing
Arash Pourdamghani, Chen Avin and Stefan Schmid

12:00 – 12:30
SESSION 10: Open Problems IV (Wrap up)
Session Chair: George B. Mertzios and Andrea Richa
12:30 – 14:00
Lunch
14:00 – 15:30
SESSION 11: Programmable Matter
Session Chair: TBA

Sublinear-time reconfiguration of programmable matter with joint movements
Manish Kumar, Othon Michail, Andreas Padalkin and Christian Scheideler

Nanobot algorithms for treatment of diffuse cancer
Noble Harasha and Nancy Lynch

Brief Announcement: Fault-tolerant 3D leader election in the Amoebot model
Daniel Warner and Christian Scheideler

Brief Announcement: Adaptive self-organization in anonymous dynamic networks
Garrett Parzych and Joshua Daymude

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

Contact

Email: sand2026@listes.univ-lehavre.fr