@InProceedings{casteigts_et_al:LIPIcs.SAND.2022.9,
author = {Casteigts, Arnaud and Corsini, Timoth\'{e}e and Hocquard, Herv\'{e} and Labourel, Arnaud},
title = {{Robustness of Distances and Diameter in a Fragile Network}},
booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)},
pages = {9:1--9:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-224-2},
ISSN = {1868-8969},
year = {2022},
volume = {221},
editor = {Aspnes, James and Michail, Othon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.9},
URN = {urn:nbn:de:0030-drops-159514},
doi = {10.4230/LIPIcs.SAND.2022.9},
annote = {Keywords: Dynamic networks, Longest path, Series-parallel graphs, Rooted minors}
}