Accepted Papers

List of Accepted Papers

Full Papers

Snapshot disjointness in temporal graphs
Allen Ibiapina and Ana Silva (best student paper)

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

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

Adaptive Collective Responses to Local Stimuli in Anonymous Dynamic Networks
Shunhao Oh, Dana Randall and Andrea Richa

Complexity of the Temporal Shortest Path Interdiction Problem
Jan Boeckmann, Clemens Thielen and Alina Wittmann

Restless temporal graph exploration
Thomas Bellitto, Cyril Conchon-Kerjan and Bruno Escoffier

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

Partial gathering of mobile agents in dynamic tori
Masahiro Shibata, Naoki Kitamura, Ryota Eguchi, Yuichi Sudo, Junya Nakamura and Yonghwan Kim

Computing Temporal Reachability under Waiting-Time Constraints in Linear Time
Filippo Brunelli and Laurent Viennot

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

Multistage Shortest Path: Instances and Practical Evaluation
Markus Chimani and Niklas Troost

A Connectivity-Sensitive Approach to Consensus Dynamics
Bernard Chazelle and Kritkorn Karntikoon

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

Covert Computation in the Abstract Tile-Assembly Model
Robert M. Alaniz, David Caballero, Timothy Gomez, Elise Grizzell, Andrew Rodriguez, Robert Schweller and Tim Wylie