{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:46Z","timestamp":1759638886644},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677871"},{"type":"electronic","value":"9783540449683"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44968-x_33","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T04:37:43Z","timestamp":1196311063000},"page":"330-339","source":"Crossref","is-referenced-by-count":7,"title":["Generating Necklaces and Strings with Forbidden Substrings"],"prefix":"10.1007","author":[{"given":"Frank","family":"Ruskey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joe","family":"Sawada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,7,21]]},"reference":[{"key":"33_CR1","unstructured":"A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974."},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511574931"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1137\/S0097539798344112","volume":"29","author":"F. Ruskey","year":"1999","unstructured":"F. Ruskey, J. Sawada, An efficient algorithm for generating necklaces of fixed density, SIAM Journal on Computing, 29 (1999) 671\u2013684.","journal-title":"SIAM Journal on Computing"},{"key":"33_CR4","unstructured":"F. Ruskey, J. Sawada, A fast algorithm to generate unlabeled necklaces, 11th Annual ACM-SIGACT Symposium on Discrete Algorithms (SODA), 2000, 256\u2013262."},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"R.P. Stanley, Enumerative Combinatorics, Volume I, Wadsworth & Brooks\/Cole, 1986.","DOI":"10.1007\/978-1-4615-9763-6"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44968-X_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T04:16:58Z","timestamp":1557029818000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44968-X_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677871","9783540449683"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-44968-x_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}