Recognizing binary shuffle squares is NP-hard

Laurent Bulteau, Stéphane Vialette. Recognizing binary shuffle squares is NP-hard. Theoretical Computer Science, 806:116-132, 2020. [doi]

@article{BulteauV20,
  title = {Recognizing binary shuffle squares is NP-hard},
  author = {Laurent Bulteau and Stéphane Vialette},
  year = {2020},
  doi = {10.1016/j.tcs.2019.01.012},
  url = {https://doi.org/10.1016/j.tcs.2019.01.012},
  researchr = {https://researchr.org/publication/BulteauV20},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {806},
  pages = {116-132},
}