{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T01:44:56Z","timestamp":1776822296230,"version":"3.51.2"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031975479","type":"print"},{"value":"9783031975486","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-97548-6_15","type":"book-chapter","created":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:48:52Z","timestamp":1751194132000},"page":"166-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Shuffle Squares and\u00a0Nest-Free Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0258-6143","authenticated-orcid":false,"given":"Jaros\u0142aw","family":"Grytczuk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5291-2701","authenticated-orcid":false,"given":"Bart\u0142omiej","family":"Pawlik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0742-7694","authenticated-orcid":false,"given":"Andrzej","family":"Ruci\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,30]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1016\/j.jcta.2013.01.001","volume":"120","author":"M Axenovich","year":"2012","unstructured":"Axenovich, M., Person, Y., Puzynina, S.: A regularity lemma and twins in words. J. Combin. Theory Ser. A 120, 733\u2013743 (2012)","journal-title":"J. Combin. Theory Ser. A"},{"key":"15_CR2","doi-asserted-by":"publisher","unstructured":"Basu, A., Ruci\u0144ski, A.: How far are ternary words from shuffle squares? Ars Math. Contemp. 25(3), #P3.08 (2024). https:\/\/doi.org\/10.26493\/1855-3974.3211.86d","DOI":"10.26493\/1855-3974.3211.86d"},{"key":"15_CR3","unstructured":"Bukh, B.: unpublished note (2013) (1 page)"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.tcs.2019.01.012","volume":"806","author":"L Bulteau","year":"2020","unstructured":"Bulteau, L., Vialette, S.: Recognizing binary shuffle squares is NP-hard. Theor. Comput. Sci. 806, 116\u2013132 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2022.10.028","volume":"941","author":"L Bulteau","year":"2023","unstructured":"Bulteau, L., Jug\u00e9, V., Vialette, S.: On shuffled-square-free words. Theor. Comput. Sci. 941, 91\u2013103 (2023)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1016\/j.jcss.2013.11.002","volume":"80","author":"S Buss","year":"2014","unstructured":"Buss, S., Soltys, M.: Unshuffling a square is NP-hard. J. Comput. System Sci. 80, 766\u2013776 (2014)","journal-title":"J. Comput. System Sci."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"D\u0119bski, M., Grytczuk, J., Pawlik, B., Przyby\u0142o, J., \u015aleszy\u0144ska-Nowak, M.: Words avoiding tangrams. Ann. Comb. (2024)","DOI":"10.1007\/s00026-024-00736-9"},{"key":"15_CR8","unstructured":"Fortuna, W.: O hipotezie ABBA (in Polish). In: Presentation at The VIII Students\u2019 Conference \u017bmirlacz, AGH Cracow (2024)"},{"key":"15_CR9","unstructured":"Grytczuk, J., Pawlik, B., Rucinski, A.: Graphic images of shuffle squares. arXiv:2503.22043"},{"key":"15_CR10","unstructured":"Grytczuk, J., Pawlik, B., Pleszczy\u0144ski, M.: Variations on shuffle squares. arxiv:2308.13882"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"103883","DOI":"10.1016\/j.ejc.2023.103883","volume":"116","author":"X He","year":"2024","unstructured":"He, X., Huang, E., Nam, I., Thaper, R.: Shuffle squares and reverse shuffle squares. Europ. J. Combin. 116, 103883 (2024)","journal-title":"Europ. J. Combin."},{"key":"15_CR12","first-page":"131","volume":"107","author":"D Henshall","year":"2012","unstructured":"Henshall, D., Rampersad, N., Shallit, J.: Shuffling and unshuffling. Bullet. EATCS 107, 131\u2013142 (2012)","journal-title":"Bullet. EATCS"},{"key":"15_CR13","unstructured":"Komisarski, A.: Personal communication"},{"key":"15_CR14","unstructured":"Ochem, P., Pierron, T.: 4-tangrams are 4-avoidable. arxiv:2502.20774"}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97548-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T01:21:31Z","timestamp":1776820891000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97548-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031975479","9783031975486"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97548-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"30 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WORDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorics on Words","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nancy","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/words2025.loria.fr\/en\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}