Invited Paper: Simple, Strict, Proper, Happy: A Study of Reachability in Temporal Graphs.

Arnaud Casteigts, Timothe Corsini, Writika Sarkar

Browse the full SSS paper archive.