Before revision:  [STACS '20] provided a 2^{O(\Delta\nu)}\cdot |{\mathcal G}|^{O(1)}-time algorithm to compute the maximum size of  \Delta-temporal matching in a temporal graph \mathcal G, where |\mathcal G| denotes the size of \mathcal G, and \nu is the \Delta-vertex cover number of \mathcal G. The \Delta-vertex cover number is the minimum number of vertices which are needed to hit (or cover ) all edges in any \Delta consecutive layers of the temporal graph  .
After revision:  [STACS '20] provided a 2^{O(\Delta\nu)}\cdot |{\mathcal G}|^{O(1)}-time algorithm to compute the maximum size of \Delta-temporal matching in a temporal graph \mathcal G, where |\mathcal G| denotes the size of \mathcal G, and \nu is the \Delta-vertex cover number of \mathcal G. The \Delta-vertex cover number is the minimum number of vertices which are needed to hit (or cover ) all edges in any \Delta consecutive layers of the temporal graph is upper-bounded by \nu .