@InProceedings{brunelli_et_al:LIPIcs.SAND.2023.4,
author = {Brunelli, Filippo and Viennot, Laurent},
title = {{Computing Temporal Reachability Under Waiting-Time Constraints in Linear Time}},
booktitle = {2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)},
pages = {4:1--4:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-275-4},
ISSN = {1868-8969},
year = {2023},
volume = {257},
editor = {Doty, David and Spirakis, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2023.4},
URN = {urn:nbn:de:0030-drops-179402},
doi = {10.4230/LIPIcs.SAND.2023.4},
annote = {Keywords: temporal reachability, temporal graph, temporal path, temporal walk, waiting-time constraints, restless temporal walk, linear time}
}