Invited Paper: Simple, Strict, Proper, Happy: A Study of Reachability in Temporal Graphs. - Arnaud Casteigts; Timothée Corsini; Writika Sarkar (SSS, 2022)

Simple, strict, proper, happy: A study of reachability in temporal graphs. - Arnaud Casteigts; Timothée Corsini; Writika Sarkar (Theor. Comput. Sci., 2024)