@inproceedings{4f6e0b1a13784c5a86cc225af467f61c,
title = "Diverse palindromic factorization is NP-complete",
abstract = "We prove that it is NP-complete to decide whether a given string can be factored into palindromes that are each unique in the factorization.",
author = "Hideo Bannai and Travis Gagie and Shunsuke Inenaga and Juha K{\"a}rkk{\"a}inen and Dominik Kempa and Marcin Pi{\c a}tkowski and Puglisi, {Simon J.} and Shiho Sugimoto",
note = "Funding Information: M. Pi{\c a}tkowski—Supported by a research fellowship within the project “Enhancing Educational Potential of Nicolaus Copernicus University in the Disciplines of Mathematical and Natural Sciences” (project no. POKL.04.01.01-00-081/10). Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 19th International Conference on Developments in Language Theory, DLT 2015 ; Conference date: 27-07-2015 Through 30-07-2015",
year = "2015",
doi = "10.1007/978-3-319-21500-6_6",
language = "English",
isbn = "9783319214993",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "85--96",
editor = "Igor Potapov",
booktitle = "Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings",
address = "Germany",
}