{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:02Z","timestamp":1759639082374,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066771"},{"type":"electronic","value":"9783031066788"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06678-8_28","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"383-397","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Shift Gray Code for\u00a0Fixed-Content \u0141ukasiewicz Words"],"prefix":"10.1007","author":[{"given":"Paul W.","family":"Lapey","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6816-4368","authenticated-orcid":false,"given":"Aaron","family":"Williams","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"issue":"2","key":"28_CR1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1093\/comjnl\/45.2.237","volume":"45","author":"VB Balakirsky","year":"2002","unstructured":"Balakirsky, V.B.: A new coding algorithm for trees. Comput. J. 45(2), 237\u2013242 (2002)","journal-title":"Comput. J."},{"key":"28_CR2","series-title":"Developments in Mathematics","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-030-11102-1_7","volume-title":"Lattice Path Combinatorics and Applications","author":"C Banderier","year":"2019","unstructured":"Banderier, C., Wallner, M.: The kernel method for lattice paths below a line of rational slope. In: Andrews, G.E., Krattenthaler, C., Krinik, A. (eds.) Lattice Path Combinatorics and Applications. DM, vol. 58, pp. 119\u2013154. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11102-1_7"},{"issue":"1","key":"28_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0012-365X(80)90168-5","volume":"31","author":"N Dershowitz","year":"1980","unstructured":"Dershowitz, N., Zaks, S.: Enumerations of ordered trees. Discret. Math. 31(1), 9\u201328 (1980)","journal-title":"Discret. Math."},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.jda.2012.04.015","volume":"16","author":"S Durocher","year":"2012","unstructured":"Durocher, S., Li, P.C., Mondal, D., Ruskey, F., Williams, A.: Cool-lex order and $$k$$-ary Catalan structures. J. Discrete Algorithms 16, 287\u2013307 (2012)","journal-title":"J. Discrete Algorithms"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-25011-8_15","volume-title":"Combinatorial Algorithms","author":"S Durocher","year":"2011","unstructured":"Durocher, S., Li, P.C., Mondal, D., Williams, A.: Ranking and loopless generation of k-ary Dyck words in cool-lex order. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2011. LNCS, vol. 7056, pp. 182\u2013194. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25011-8_15"},{"key":"28_CR6","unstructured":"Hodgson, J.: Rediscovered: the Jan \u0141ukasiewicz papers. https:\/\/rylandscollections.com\/2018\/05\/16\/rediscovered-the-jan-lukasiewicz-papers"},{"key":"28_CR7","unstructured":"Knuth, D.E.: Art of Computer Programming, Volume 4, Fascicle 4, The: Generating All Trees\u2013History of Combinatorial Generation. Addison-Wesley (2013)"},{"issue":"3","key":"28_CR8","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1093\/comjnl\/45.3.364","volume":"45","author":"JF Korsh","year":"2002","unstructured":"Korsh, J.F., LaFollette, P.: Loopless generation of trees with specified degrees. Comput. J. 45(3), 364\u2013372 (2002)","journal-title":"Comput. J."},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"M\u00fctze, T.: Combinatorial Gray codes-an updated survey. arXiv preprint arXiv:2202.01280 (2022)","DOI":"10.37236\/11023"},{"key":"28_CR10","unstructured":"Nakano, S.I.: Listing all trees with specified degree sequence (acceleration and visualization of computation for enumeration problems). RIMS K\u00f4ky\u00fbroku Bessatsu 1644, 55\u201362 (2009)"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Narayana, T.V.: Lattice Path Combinatorics with Statistical Applications; Mathematical Expositions 23. University of Toronto Press (1979)","DOI":"10.3138\/9781487582586"},{"issue":"1","key":"28_CR12","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.jcta.2011.07.005","volume":"119","author":"F Ruskey","year":"2012","unstructured":"Ruskey, F., Sawada, J., Williams, A.: Binary bubble languages and cool-lex order. J. Comb. Theor. Ser. A 119(1), 155\u2013169 (2012)","journal-title":"J. Comb. Theor. Ser. A"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/11533719_58","volume-title":"Computing and Combinatorics","author":"F Ruskey","year":"2005","unstructured":"Ruskey, F., Williams, A.: Generating combinations by prefix shifts. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 570\u2013576. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11533719_58"},{"key":"28_CR14","unstructured":"Ruskey, F., Williams, A.: Generating balanced parentheses and binary trees by prefix shifts. In: Proceedings of the Fourteenth Symposium On Computing: The Australasian Theory. Vol. 77, pp. 107\u2013115. Citeseer (2008)"},{"issue":"17","key":"28_CR15","doi-asserted-by":"publisher","first-page":"5305","DOI":"10.1016\/j.disc.2007.11.048","volume":"309","author":"F Ruskey","year":"2009","unstructured":"Ruskey, F., Williams, A.: The coolest way to generate combinations. Discret. Math. 309(17), 5305\u20135320 (2009)","journal-title":"Discret. Math."},{"issue":"4","key":"28_CR16","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":"28_CR17","unstructured":"Sloane, N.J.A., The OEIS Foundation Inc.: The on-line Encyclopedia of integer sequences (2020). https:\/\/oeis.org\/"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Stanley, R.P.: Catalan numbers. Cambridge University Press (2015)","DOI":"10.1017\/CBO9781139871495"},{"issue":"4","key":"28_CR19","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0020-0190(91)90178-K","volume":"39","author":"DR Van Baronaigien","year":"1991","unstructured":"Van Baronaigien, D.R.: A loopless algorithm for generating binary tree sequences. Inf. Process. Lett. 39(4), 189\u2013194 (1991)","journal-title":"Inf. Process. Lett."},{"key":"28_CR20","unstructured":"Wallner, M.: Combinatorics of Lattice Paths and Tree-Like Structures. Ph.D. thesis. Wien (2016)"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Williams, A.: Loopless generation of multiset permutations using a constant number of variables by prefix shifts. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 987\u2013996. SIAM (2009)","DOI":"10.1137\/1.9781611973068.107"},{"key":"28_CR22","unstructured":"Williams, A.M.: Shift Gray Codes. Ph.D. thesis. University of Victoria (2009)"},{"issue":"1","key":"28_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1137\/0208006","volume":"8","author":"S Zaks","year":"1979","unstructured":"Zaks, S., Richards, D.: Generating trees and other combinatorial objects lexicographically. SIAM J. Comput. 8(1), 73\u201381 (1979)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06678-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T10:28:46Z","timestamp":1700648926000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06678-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066771","9783031066788"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06678-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.informatik.uni-trier.de\/iwoca-2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}