{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:32:11Z","timestamp":1758274331845},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214578"},{"type":"electronic","value":"9783642214585"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21458-5_9","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T17:11:27Z","timestamp":1309194687000},"page":"77-89","source":"Crossref","is-referenced-by-count":3,"title":["A d-Step Approach for Distinct Squares in Strings"],"prefix":"10.1007","author":[{"given":"Antoine","family":"Deza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frantisek","family":"Franek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mei","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Baker, A., Deza, A., Franek, F.: On the structure of relatively short run-maximal strings, AdvOL Technical Report 2011\/02, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada"},{"key":"9_CR2","unstructured":"Deza, A., Franek, F.: A d-step analogue for runs on strings, AdvOL Technical Report 2010\/02, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jcta.1997.2843","volume":"82","author":"A.S. Fraenkel","year":"1998","unstructured":"Fraenkel, A.S., Simpson, J.: How Many Squares Can a String Contain? Journal of Combinatorial Theory Series A\u00a082(1), 112\u2013120 (1998)","journal-title":"Journal of Combinatorial Theory Series A"},{"issue":"1","key":"9_CR4","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. Journal of Combinatorial Theory Series A\u00a0112(1), 163\u2013164 (2005)","journal-title":"Journal of Combinatorial Theory Series A"},{"issue":"3","key":"9_CR5","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. Theoretical Computer Science\u00a0380(3), 373\u2013376 (2007)","journal-title":"Theoretical Computer Science"},{"key":"9_CR6","unstructured":"Matschke, B., Santos, F., Weibel, C.: The width of 5-prismatoids and smaller non-Hirsch polytopes (2011), \n                    \n                      http:\/\/www.cs.dartmouth.edu\/~weibel\/hirsch.php"},{"key":"9_CR7","unstructured":"Santos, F.: A counterexample to the Hirsch conjecture, arXiv:1006.2814v1 (2010)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21458-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T10:04:58Z","timestamp":1553853898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21458-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214578","9783642214585"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21458-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}