{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:09:46Z","timestamp":1761620986770},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,5,16]],"date-time":"2008-05-16T00:00:00Z","timestamp":1210896000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1007\/s10852-008-9086-9","type":"journal-article","created":{"date-parts":[[2008,5,15]],"date-time":"2008-05-15T09:35:54Z","timestamp":1210844154000},"page":"291-310","source":"Crossref","is-referenced-by-count":10,"title":["Gray Codes, Loopless Algorithm and Partitions"],"prefix":"10.1007","volume":"7","author":[{"given":"Toufik","family":"Mansour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ghalib","family":"Nassar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,16]]},"reference":[{"issue":"13","key":"9086_CR1","doi-asserted-by":"crossref","first-page":"1559","DOI":"10.1016\/j.disc.2006.09.007","volume":"307","author":"J.-L. Baril","year":"2007","unstructured":"Baril, J.-L.: Gray code for permutations with a fixed number of cycles. Disc. Math. 307(13), 1559\u20131571 (2007)","journal-title":"Disc. Math."},{"key":"9086_CR2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.dam.2003.06.002","volume":"140","author":"J.-L. Baril","year":"2004","unstructured":"Baril, J.-L., Vajnovszki, V.: Gray code for derangements. Discrete Appl. Math. 140, 207\u2013221 (2004)","journal-title":"Discrete Appl. Math."},{"key":"9086_CR3","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1145\/321765.321781","volume":"20","author":"G. Ehrlich","year":"1973","unstructured":"Ehrlich, G.: Loopless algorithms for generating permutations, combinations, and other combinatorial configurations. J. Assoc. Comput. Mach. 20, 500\u2013513 (1973)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9086_CR4","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1090\/S0025-5718-1963-0159764-2","volume":"17","author":"S.M. Johson","year":"1963","unstructured":"Johson, S.M.: Generating of permutations by adjacent transposition. Math. Comput. 17, 282\u2013285 (1963)","journal-title":"Math. Comput."},{"key":"9086_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1006\/eujc.1996.0005","volume":"17","author":"M. Klazar","year":"1996","unstructured":"Klazar, M.: On abab-free and abba-free set partitions. Eur. J. Comb. 17, 53\u201368 (1996)","journal-title":"Eur. J. Comb."},{"key":"9086_CR6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0020-0190(92)90170-Z","volume":"41","author":"C.W. Ko","year":"1992","unstructured":"Ko, C.W., Ruskey, F.: Generating permutations of a bag by interchanges. Inf. Process. Lett. 41, 263\u2013269 (1992)","journal-title":"Inf. Process. Lett."},{"key":"9086_CR7","unstructured":"Korsh, J.F., LaFollette, P.S.: Loopless array generation of multiset permutations. Technical Report, Department of CIS, PA, USA (2002)"},{"key":"9086_CR8","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1006\/jagm.1997.0889","volume":"25","author":"J.F. Korsh","year":"1997","unstructured":"Korsh, J.F., Lipschutz, S.: Generating multiset permutations in constant time. J. Algorithms 25, 321\u2013335 (1997)","journal-title":"J. Algorithms"},{"issue":"1","key":"9086_CR9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0166-218X(92)90204-N","volume":"36","author":"D. Roelants van Baronaigien","year":"1992","unstructured":"Roelants van Baronaigien, D., Ruskey, F.: Generating permutations with given ups and downs. Disc. Appl. Math. 36(1), 57\u201365 (1992)","journal-title":"Disc. Appl. Math."},{"key":"9086_CR10","unstructured":"Ruskey, F.: Combinatorial Generation. See http:\/\/www.cs.sunysb.edu\/~algorith\/implement\/ruskey\/implement.shtml"},{"key":"9086_CR11","first-page":"85","volume":"10","author":"F. Ruskey","year":"1994","unstructured":"Ruskey, F., Savage, C.D.: Gray codes for set partitions and restricted growth tails. Aust. J. Combin. 10, 85\u201396 (1994)","journal-title":"Aust. J. Combin."},{"key":"9086_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511805967","volume-title":"Enumerative Combinatorics, vol. 1","author":"R. Stanley","year":"1997","unstructured":"Stanley, R.: Enumerative Combinatorics, vol. 1. Cambridge University Press, Cambridge, UK (1997)"},{"key":"9086_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4968-9","volume-title":"Constructive Combinatorics","author":"D. Stanton","year":"1986","unstructured":"Stanton, D., White, D.: Constructive Combinatorics. Springer-Verlag, Berlin Heidelberg New York (1986)"},{"key":"9086_CR14","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/3-540-46632-0_25","volume":"1741","author":"T. Takaoka","year":"1999","unstructured":"Takaoka, T., An O(1) time algorithm for generating multiset permutations. Lect. Notes Comput. Sci. 1741, 237\u2013246 (1999)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9086_CR15","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1145\/368637.368660","volume":"5","author":"H.F. Trotter","year":"1962","unstructured":"Trotter, H.F.: Algorithm 115, permutations. Commun. ACM 5, 434\u2013435 (1962)","journal-title":"Commun. ACM"},{"key":"9086_CR16","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/S0304-3975(03)00228-7","volume":"307","author":"V. Vajnovszki","year":"2003","unstructured":"Vajnovszki, V.: A loopless algorithm for generating the permutations of a multiset. Theor. Comput. Sci. 307, 415\u2013431 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"9086_CR17","first-page":"95","volume":"36","author":"T. Walsh","year":"2001","unstructured":"Walsh, T.: Gray codes for involutions. J. Combin. Math. Combin. Comput. 36, 95\u2013118 (2001)","journal-title":"J. Combin. Math. Combin. Comput."}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-008-9086-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-008-9086-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-008-9086-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:26:30Z","timestamp":1559255190000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-008-9086-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,16]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["9086"],"URL":"https:\/\/doi.org\/10.1007\/s10852-008-9086-9","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,16]]}}}