Before revision:  With an open-source implementation  we demonstrate that the algorithm can scale to large temporal graphs with tens of millions of edges, despite the problem being NP-hard.
After revision:  In particular, parameterized by the length of a path k sought, we show the problems can be solved in O(2^k k m \Delta) time and O(n \tau) space, where n is the number of vertices, m the number of edges, \Delta the maximum resting time and \tau the maximum timestamp of an input temporal graph. In addition, we prove that the algorithms presented for the restless reachability problems in vertex-colored temporal graphs are optimal under plausible complexity-theoretic assumptions. Finally, with an open-source implementation we demonstrate that the algorithm can scale to large temporal graphs with tens of millions of edges, despite the problem being NP-hard.