Diverse Palindromic Factorization Is NP-complete

Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto. Diverse Palindromic Factorization Is NP-complete. In Igor Potapov, editor, Developments in Language Theory - 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings. Volume 9168 of Lecture Notes in Computer Science, pages 85-96, Springer, 2015. [doi]

@inproceedings{BannaiGIKKPPS15,
  title = {Diverse Palindromic Factorization Is NP-complete},
  author = {Hideo Bannai and Travis Gagie and Shunsuke Inenaga and Juha Kärkkäinen and Dominik Kempa and Marcin Piatkowski and Simon J. Puglisi and Shiho Sugimoto},
  year = {2015},
  doi = {10.1007/978-3-319-21500-6_6},
  url = {http://dx.doi.org/10.1007/978-3-319-21500-6_6},
  researchr = {https://researchr.org/publication/BannaiGIKKPPS15},
  cites = {0},
  citedby = {0},
  pages = {85-96},
  booktitle = {Developments in Language Theory - 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings},
  editor = {Igor Potapov},
  volume = {9168},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-21499-3},
}