{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:08Z","timestamp":1759063808869,"version":"3.40.3"},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319236599"},{"type":"electronic","value":"9783319236605"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-23660-5_14","type":"book-chapter","created":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T12:05:10Z","timestamp":1440590710000},"page":"160-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Square-Density Increasing Mappings"],"prefix":"10.1007","author":[{"given":"Florin","family":"Manea","sequence":"first","affiliation":[]},{"given":"Shinnosuke","family":"Seki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,27]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jcta.1997.2843","volume":"82","author":"AS Fraenkel","year":"1998","unstructured":"Fraenkel, A.S., Simpson, J.: How many squares can a string contain? J. Comb. Theory Ser. A 82, 112\u2013120 (1998)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.jcta.2005.01.006","volume":"112","author":"L Ilie","year":"2005","unstructured":"Ilie, L.: A simple proof that a word of length $$n$$ has at most $$2n$$ distinct squares. J. Comb. Theory Ser. A 112(1), 163\u2013164 (2005)","journal-title":"J. Comb. Theory Ser. A"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.tcs.2007.03.025","volume":"380","author":"L Ilie","year":"2007","unstructured":"Ilie, L.: A note on the number of squares in a word. Theoret. Comput. Sci. 380, 373\u2013376 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.dam.2014.08.016","volume":"180","author":"A Deza","year":"2015","unstructured":"Deza, A., Franek, F., Thierry, A.: How many double squares can a string contain? Discrete Appl. Math. 180, 52\u201369 (2015)","journal-title":"Discrete Appl. Math."},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-21458-5_9","volume-title":"Combinatorial Pattern Matching","author":"A Deza","year":"2011","unstructured":"Deza, A., Franek, F., Jiang, M.: A d-step approach for distinct squares in strings. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 77\u201389. Springer, Heidelberg (2011)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-319-04298-5_30","volume-title":"SOFSEM 2014: Theory and Practice of Computer Science","author":"N Jonoska","year":"2014","unstructured":"Jonoska, N., Manea, F., Seki, S.: A stronger square conjecture on binary words. In: Geffert, V., Preneel, B., Rovan, B., \u0160tuller, J., Tjoa, A.M. (eds.) SOFSEM 2014. LNCS, vol. 8327, pp. 339\u2013350. Springer, Heidelberg (2014)"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-642-59136-5_8","volume-title":"Handbook of Formal Languages","author":"H J\u00fcrgensen","year":"1997","unstructured":"J\u00fcrgensen, H., Konstantinidis, S.: Codes. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 511\u2013607. Springer, Heidelberg (1997)"}],"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-319-23660-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T11:55:05Z","timestamp":1676030105000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23660-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319236599","9783319236605"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23660-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}