Unshuffling a square is NP-hard

Sam Buss, Michael Soltys. Unshuffling a square is NP-hard. J. Comput. Syst. Sci., 80(4):766-776, 2014. [doi]

Abstract

Abstract is missing.