{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:30:40Z","timestamp":1743150640217,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":42,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819628445"},{"type":"electronic","value":"9789819628452"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-2845-2_19","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T15:59:56Z","timestamp":1740067196000},"page":"296-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximize the\u00a0Rightmost Digit:Gray Codes for\u00a0Restricted Growth Strings"],"prefix":"10.1007","author":[{"given":"Yuan","family":"Qiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joe","family":"Sawada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6816-4368","authenticated-orcid":false,"given":"Aaron","family":"Williams","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,21]]},"reference":[{"key":"19_CR1","volume-title":"Matters Computational: Ideas, Algorithms, Source Code","author":"J Arndt","year":"2010","unstructured":"Arndt, J.: Matters Computational: Ideas, Algorithms, Source Code. Springer, Heidelberg (2010)"},{"key":"19_CR2","unstructured":"Behrooznia, N., M\u00fctze, T.: Listing spanning trees of outerplanar graphs by pivot exchanges. arXiv preprint arXiv:2409.15793 (2024)"},{"issue":"7","key":"19_CR3","doi-asserted-by":"publisher","first-page":"884","DOI":"10.1016\/j.jcta.2009.12.007","volume":"117","author":"M Bousquet-M\u00e9lou","year":"2010","unstructured":"Bousquet-M\u00e9lou, M., Claesson, A., Dukes, M., Kitaev, S.: (2+ 2)-free posets, ascent sequences and pattern avoiding permutations. J. Comb. Theory Ser. A 117(7), 884\u2013909 (2010)","journal-title":"J. Comb. Theory Ser. A"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Cameron, B., Grubb, A., Sawada, J.: Pivot Gray codes for the spanning trees of a graph ft. the fan. Graphs Comb. 40(4), 78 (2024)","DOI":"10.1007\/s00373-024-02808-2"},{"issue":"3","key":"19_CR5","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s00453-022-01022-x","volume":"85","author":"B Cameron","year":"2023","unstructured":"Cameron, B., Sawada, J., Therese, W., Williams, A.: Hamiltonicity of k-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality. Algorithmica 85(3), 717\u2013744 (2023)","journal-title":"Algorithmica"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Cardinal, J., Hoang, H.P., Merino, A., Mi\u010dka, O., M\u00fctze, T.: Combinatorial generation via permutation languages. V. Acyclic orientations. SIAM J. Disc. Math. 37(3), 1509\u20131547 (2023)","DOI":"10.1137\/23M1546567"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Cardinal, J., Merino, A., M\u00fctze, T.: Efficient generation of elimination trees and graph associahedra. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2128\u20132140. SIAM (2022)","DOI":"10.1137\/1.9781611977073.84"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"DiMuro, J.: Classifying rotationally-closed languages having greedy universal cycles. Electron. J. Comb. P1\u201335 (2019)","DOI":"10.37236\/7932"},{"key":"19_CR9","unstructured":"Downing, E., Einstein, S., Hartung, E., Williams, A.: Catalan squares and staircases: relayering and repositioning Gray codes. In: Proceedings of the 35th Canadian Conference on Computational Geometry, CCCG (2023)"},{"issue":"3","key":"19_CR10","doi-asserted-by":"publisher","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. ACM (JACM) 20(3), 500\u2013513 (1973)","journal-title":"J. ACM (JACM)"},{"issue":"38\u201340","key":"19_CR11","doi-asserted-by":"publisher","first-page":"3743","DOI":"10.1016\/j.tcs.2009.04.027","volume":"410","author":"D Foata","year":"2009","unstructured":"Foata, D., Han, G.N.: New permutation coding and equidistribution of set-valued statistics. Theor. Comput. Sci. 410(38\u201340), 3743\u20133750 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR12","unstructured":"Gray, F.: Pulse code communication. United States Patent Number 2632058 (1953)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Hartung, E., Hoang, H., M\u00fctze, T., Williams, A.: Combinatorial generation via permutation languages. I. Fundamentals. Trans. Am. Math. Soc. 375(4), 2255\u20132291 (2022)","DOI":"10.1090\/tran\/8199"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Hoang, H.P., M\u00fctze, T.: Combinatorial generation via permutation languages. II. Lattice congruences. Israel J. Math. 244(1), 359\u2013417 (2021)","DOI":"10.1007\/s11856-021-2186-1"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(76)90014-4","volume":"5","author":"R Kaye","year":"1976","unstructured":"Kaye, R.: A Gray code for set partitions. Inf. Process. Lett. 5, 171\u2013173 (1976)","journal-title":"Inf. Process. Lett."},{"key":"19_CR16","unstructured":"Kerr, K.: Successor rule for a restricted growth string Gray code (2015)"},{"key":"19_CR17","unstructured":"Knuth, D.E.: The art of computer programming, Volume 4A: Combinatorial algorithms, Part 1. Pearson Education India (2011)"},{"issue":"5","key":"19_CR18","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.ipl.2008.11.007","volume":"109","author":"Y Li","year":"2009","unstructured":"Li, Y., Sawada, J.: Gray codes for reflectable languages. Inf. Process. Lett. 109(5), 296\u2013300 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"11","key":"19_CR19","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/j.ipl.2011.03.006","volume":"111","author":"T Mansour","year":"2011","unstructured":"Mansour, T., Nassar, G., Vajnovszki, V.: Loop-free Gray code algorithm for the e-restricted growth functions. Inf. Process. Lett. 111(11), 541\u2013544 (2011)","journal-title":"Inf. Process. Lett."},{"issue":"17","key":"19_CR20","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1016\/j.ipl.2013.05.008","volume":"113","author":"T Mansour","year":"2013","unstructured":"Mansour, T., Vajnovszki, V.: Efficient generation of restricted growth words. Inf. Process. Lett. 113(17), 613\u2013616 (2013)","journal-title":"Inf. Process. Lett."},{"issue":"12","key":"19_CR21","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1090\/S0002-9904-1934-05988-3","volume":"40","author":"M Martin","year":"1934","unstructured":"Martin, M.: A problem in arrangements. Bull. Am. Math. Soc. 40(12), 859\u2013864 (1934)","journal-title":"Bull. Am. Math. Soc."},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Merino, A., M\u00fctze, T.: Combinatorial generation via permutation languages. III. Rectangulations. Disc. Comput. Geom. 1\u201372 (2022)","DOI":"10.1007\/s00454-022-00393-w"},{"issue":"5","key":"19_CR23","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1137\/23M1612019","volume":"53","author":"A Merino","year":"2024","unstructured":"Merino, A., M\u00fctze, T.: Traversing combinatorial 0\/1-polytopes via optimization. SIAM J. Comput. 53(5), 1257\u20131292 (2024)","journal-title":"SIAM J. Comput."},{"key":"19_CR24","unstructured":". Merino, A., Mutze, T., Williams, A.: All your bases are belong to us: Listing all bases of a matroid by greedy exchanges. In: 11th International Conference on Fun with Algorithms (FUN 2022), vol. 226, p. 22. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"19_CR25","doi-asserted-by":"publisher","unstructured":"Merino, A., Namrata, Williams, A.: On the hardness of Gray code problems for combinatorial objects. In: International Conference and Workshops on Algorithms and Computation, pp. 103\u2013117. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-981-97-0566-5_9","DOI":"10.1007\/978-981-97-0566-5_9"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"M\u00fctze, T.: Combinatorial Gray codes-an updated survey. Electron. J. Comb. 30(3), DS26 (2022)","DOI":"10.37236\/11023"},{"key":"19_CR27","doi-asserted-by":"publisher","unstructured":"Qiu, Y., Williams, A.: Generating signed permutations by twisting two-sided ribbons. In: Latin American Symposium on Theoretical Informatics, pp. 114\u2013129. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-55598-5_8","DOI":"10.1007\/978-3-031-55598-5_8"},{"key":"19_CR28","unstructured":"Ruskey, F.: Combinatorial generation. Preliminary working draft. University of Victoria, Victoria, BC, Canada 11, 20 (2003)"},{"key":"19_CR29","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. Comb. 10, 85\u201396 (1994)","journal-title":"Aust. J. Comb."},{"issue":"5","key":"19_CR30","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1093\/comjnl\/bxu018","volume":"58","author":"A Sabri","year":"2015","unstructured":"Sabri, A., Vajnovszki, V.: Two reflected Gray code-based orders on some restricted growth sequences. Comput. J. 58(5), 1099\u20131111 (2015)","journal-title":"Comput. J."},{"issue":"4","key":"19_CR31","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"C Savage","year":"1997","unstructured":"Savage, C.: A survey of combinatorial Gray codes. SIAM Rev. 39(4), 605\u2013629 (1997)","journal-title":"SIAM Rev."},{"key":"19_CR32","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.dam.2016.02.005","volume":"210","author":"J Sawada","year":"2016","unstructured":"Sawada, J., Williams, A.: Greedy flipping of pancakes and burnt pancakes. Disc. Appl. Math. 210, 61\u201374 (2016)","journal-title":"Disc. Appl. Math."},{"key":"19_CR33","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2015.09.007","volume":"609","author":"J Sawada","year":"2016","unstructured":"Sawada, J., Williams, A.: Successor rules for flipping pancakes and burnt pancakes. Theor. Comput. Sci. 609, 60\u201375 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Sawada, J., Williams, A., Wong, D.: Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles. Electron. J. Comb. P1\u201324 (2016)","DOI":"10.37236\/5517"},{"key":"19_CR35","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.tcs.2022.08.024","volume":"933","author":"J Sawada","year":"2022","unstructured":"Sawada, J., Williams, A., Wong, D.: Flip-swap languages in binary reflected Gray code order. Theor. Comput. Sci. 933, 138\u2013148 (2022)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR36","doi-asserted-by":"crossref","unstructured":"Stanley, R.P.: Enumerative combinatorics volume 1 second edition. Cambridge studies in advanced mathematics (2011)","DOI":"10.1017\/CBO9781139058520"},{"key":"19_CR37","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139871495","volume-title":"Catalan Numbers","author":"RP Stanley","year":"2015","unstructured":"Stanley, R.P.: Catalan Numbers. Cambridge University Press, Cambridge (2015)"},{"key":"19_CR38","unstructured":"Stedman, F.: Campanalogia: or the Art of Ringing Improved, With plain and easie rules to guide the Practitioner in the Ringing all kinds of Changes, To Which is added, great variety of New Peals. London (1677)"},{"key":"19_CR39","doi-asserted-by":"publisher","unstructured":"Vajnovszki, V., Wong, D.: Greedy Gray codes for Dyck words and ballot sequences. In: International Computing and Combinatorics Conference, pp. 29\u201340. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-49193-1_3","DOI":"10.1007\/978-3-031-49193-1_3"},{"key":"19_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-642-40104-6_46","volume-title":"Algorithms and Data Structures","author":"A Williams","year":"2013","unstructured":"Williams, A.: The greedy gray code algorithm. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 525\u2013536. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40104-6_46"},{"key":"19_CR41","unstructured":"Williams, A.: Pattern avoidance for $$k$$-Catalan sequences. In: Proceedings of the 21st International Conference on Permutation Patterns, pp. 147\u2013149 (2023)"},{"issue":"1","key":"19_CR42","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0304-3975(80)90073-0","volume":"10","author":"S Zaks","year":"1980","unstructured":"Zaks, S.: Lexicographic generation of ordered trees. Theor. Comput. Sci. 10(1), 63\u201382 (1980)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-2845-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T16:00:07Z","timestamp":1740067207000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-2845-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819628445","9789819628452"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-2845-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"21 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/walcom2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}