Unknotting number and number of Reidemeister moves needed for unlinking (Q664710)

Using the unknotting number, the authors introduce a link diagram invariant similar to a knot invariant given in [\textit{T. Hass} and \textit{T. Nowik}, Math. Ann. 342, 125--137 (2008; Zbl 1161.57002)]. They give an example of an infinite sequence of diagrams of the trivial two-component link that need quadratic number of Reidemeister moves for being splitted with respect to the number of crossings.