{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:45:25Z","timestamp":1758271525303},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2018,2]]},"abstract":"<jats:p> 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. <\/jats:p>","DOI":"10.1142\/s0129054118400014","type":"journal-article","created":{"date-parts":[[2018,4,11]],"date-time":"2018-04-11T07:34:45Z","timestamp":1523432085000},"page":"143-163","source":"Crossref","is-referenced-by-count":6,"title":["Diverse Palindromic Factorization is NP-Complete"],"prefix":"10.1142","volume":"29","author":[{"given":"Hideo","family":"Bannai","sequence":"first","affiliation":[{"name":"Department of Informatics, Kyushu University, Japan"}]},{"given":"Travis","family":"Gagie","sequence":"additional","affiliation":[{"name":"Diego Portales University, Chile"}]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[{"name":"Department of Informatics, Kyushu University, Japan"}]},{"given":"Juha","family":"K\u00e4rkk\u00e4inen","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Helsinki Institute for Information Technology HIIT, University of Helsinki, Finland"}]},{"given":"Dominik","family":"Kempa","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Helsinki Institute for Information Technology HIIT, University of Helsinki, Finland"}]},{"given":"Marcin","family":"Pi\u0105tkowski","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Poland"}]},{"given":"Shiho","family":"Sugimoto","sequence":"additional","affiliation":[{"name":"Department of Informatics, Kyushu University, Japan"}]}],"member":"219","published-online":{"date-parts":[[2018,4,11]]},"reference":[{"key":"S0129054118400014BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2013.11.002"},{"key":"S0129054118400014BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2014.08.001"},{"key":"S0129054118400014BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2013.01.002"},{"key":"S0129054118400014BIB009","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"issue":"3","key":"S0129054118400014BIB014","first-page":"115","volume":"9","author":"Levin L.","year":"1973","journal-title":"Problems of Information Transmission"},{"issue":"1","key":"S0129054118400014BIB015","first-page":"75","volume":"8","author":"Ravsky O.","year":"2003","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"S0129054118400014BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.01.006"},{"key":"S0129054118400014BIB018","first-page":"115","volume-title":"Structures in Constructive Mathematics and Mathematical Logic, Part II","author":"Tseitin G. S.","year":"1968"},{"key":"S0129054118400014BIB019","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"S0129054118400014BIB020","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054118400014","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T12:27:26Z","timestamp":1565180846000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054118400014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":10,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2018,4,11]]},"published-print":{"date-parts":[[2018,2]]}},"alternative-id":["10.1142\/S0129054118400014"],"URL":"https:\/\/doi.org\/10.1142\/s0129054118400014","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2]]}}}