{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T12:55:52Z","timestamp":1772715352342,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540575689","type":"print"},{"value":"9783540482338","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57568-5_250","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:09:03Z","timestamp":1330243743000},"page":"201-208","source":"Crossref","is-referenced-by-count":21,"title":["Simple combinatorial Gray codes constructed by reversing sublists"],"prefix":"10.1007","author":[{"given":"Frank","family":"Ruskey","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0012-365X(84)90179-1","volume":"48","author":"M. Buck","year":"1984","unstructured":"M. Buck and D. Wiedemann, Gray Codes with Restricted Density, Discrete Mathematics, 48 (1984) 163\u2013171.","journal-title":"Discrete Mathematics"},{"key":"22_CR2","first-page":"215","volume":"69","author":"P.J. Chase","year":"1989","unstructured":"P.J. Chase, Combination Generation and Graylex Ordering, Congressus Numerantium, 69 (1989) 215\u2013242.","journal-title":"Congressus Numerantium"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/2422.322413","volume":"31","author":"P. Eades","year":"1984","unstructured":"P. Eades, M. Hickey and R. Read, Some Hamilton Paths and a Minimal Change Algorithm, Journal of the ACM, 31 (1984) 19\u201329.","journal-title":"Journal of the ACM"},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0020-0190(84)90091-7","volume":"19","author":"P. Eades","year":"1984","unstructured":"P. Eades and B. McKay, An Algorithm for Generating Subsets of Fixed Size with a Strong Minimal Change Property, Information Processing Letters, 19 (1984) 131\u2013133.","journal-title":"Information Processing Letters"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1145\/321765.321781","volume":"20","author":"G. Ehrlich","year":"1973","unstructured":"G. Ehrlich, Loopless Algorithms for Generating Permutations, Combinations and Other Combinatorial Configurations, Journal of the ACM, 20 (1973) 500\u2013513.","journal-title":"Journal of the ACM"},{"key":"22_CR6","unstructured":"J.A. Fill and E.M. Reingold, Solutions Manual for Combinatorial Algorithms: Theory and Practice, Prentice-Hall, 1977."},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0001-8708(82)90032-9","volume":"43","author":"S.C. Milne","year":"1982","unstructured":"S.C. Milne, Restricted Growth Functions, Rank Row Matchings of Partition Lattices, and q-Stirling Numbers, Advances in Mathematics, 43 (1982) 173\u2013196.","journal-title":"Advances in Mathematics"},{"key":"22_CR8","volume-title":"Combinatorial Algorithms","author":"E.M. Reingold","year":"1977","unstructured":"E.M. Reingold, J. Nievergelt and N. Deo, Combinatorial Algorithms, Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1977."},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/0196-6774(90)90030-I","volume":"11","author":"F. Ruskey","year":"1990","unstructured":"F. Ruskey and A. Proskurowski, Generating Binary Trees by Transpositions, J. Algorithms, 11 (1990) 68\u201384.","journal-title":"J. Algorithms"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0196-6774(89)90007-2","volume":"10","author":"C.S. Savage","year":"1989","unstructured":"C.S. Savage, Gray Code Sequences of Partitions, J. Algorithms, 10 (1989) 577\u2013595.","journal-title":"J. Algorithms"},{"key":"22_CR11","unstructured":"Herbert S. Wilf, Combinatorial Algorithms: An Update, SIAM CBMS-55, 1989."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57568-5_250.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:06:19Z","timestamp":1619557579000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_250"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_250","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}