{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:30:34Z","timestamp":1742956234403,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819705658"},{"type":"electronic","value":"9789819705665"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-0566-5_8","type":"book-chapter","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T12:03:28Z","timestamp":1709121808000},"page":"91-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generating Cyclic 2-Gray Codes for\u00a0Fibonacci q-Decreasing Words"],"prefix":"10.1007","author":[{"given":"Dennis","family":"Wong","sequence":"first","affiliation":[]},{"given":"Bowie","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Chan-Tong","family":"Lam","sequence":"additional","affiliation":[]},{"given":"Marcus","family":"Im","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"issue":"1","key":"8_CR1","first-page":"23","volume":"30","author":"J-L Baril","year":"2022","unstructured":"Baril, J.-L., Kirgizov, S., Vajnovszki, V.: Asymptotic bit frequency in Fibonacci words. Pure Math. Appl. 30(1), 23\u201330 (2022)","journal-title":"Pure Math. Appl."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.tcs.2022.06.003","volume":"927","author":"J-L Baril","year":"2022","unstructured":"Baril, J.-L., Kirgizov, S., Vajnovszki, V.: Gray codes for Fibonacci $$q$$-decreasing words. Theor. Comput. Sci. 927, 120\u2013132 (2022)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.dam.2021.02.025","volume":"295","author":"O E\u01e7ecio\u01e7lu","year":"2021","unstructured":"E\u01e7ecio\u01e7lu, O., Ir\u0161i\u010d, V.: Fibonacci-run graphs I: basic properties. Discret. Appl. Math. 295, 70\u201384 (2021)","journal-title":"Discret. Appl. Math."},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.dam.2021.05.018","volume":"300","author":"O E\u01e7ecio\u01e7lu","year":"2021","unstructured":"E\u01e7ecio\u01e7lu, O., Ir\u0161i\u010d, V.: Fibonacci-run graphs II: degree sequences. Discret. Appl. Math. 300, 56\u201371 (2021)","journal-title":"Discret. Appl. Math."},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"E\u01e7ecio\u01e7lu, O., Klav\u017ear, S., Mollard, M.: Fibonacci Cubes With Applications And Variations. World Scientific Publishing Company (2023)","DOI":"10.1142\/13228"},{"issue":"3","key":"8_CR6","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1080\/00150517.1963.12431573","volume":"1","author":"M Feinberg","year":"1963","unstructured":"Feinberg, M.: Fibonacci-Tribonacci. Fibonacci Q. 1(3), 71\u201374 (1963)","journal-title":"Fibonacci Q."},{"issue":"3","key":"8_CR7","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1080\/00150517.1967.12431301","volume":"5","author":"I Flores","year":"1967","unstructured":"Flores, I.: Direct calculation of $$k$$-generalized Fibonacci numbers. Fibonacci Q. 5(3), 259\u2013266 (1967)","journal-title":"Fibonacci Q."},{"key":"8_CR8","volume-title":"Combinatorial Enumeration","author":"I Goulden","year":"1983","unstructured":"Goulden, I., Jackson, D.: Combinatorial Enumeration. A Wiley-Interscience Publication. John Wiley & Sons Inc., New York (1983)"},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/71.205649","volume":"4","author":"W-J Hsu","year":"1993","unstructured":"Hsu, W.-J.: Fibonacci cubes - a new interconnection topology. IEEE Trans. Parallel Distrib. Syst. 4(1), 3\u201312 (1993)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"5","key":"8_CR10","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1080\/00150517.2022.12427439","volume":"60","author":"S Kirgizov","year":"2022","unstructured":"Kirgizov, S.: $$q$$-bonacci words and numbers. Fibonacci Q. 60(5), 187\u2013195 (2022)","journal-title":"Fibonacci Q."},{"issue":"5","key":"8_CR11","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1080\/00150517.2022.12427440","volume":"60","author":"S Kirgizov","year":"2022","unstructured":"Kirgizov, S., Ram\u00edrez, J.: Polyominoes and graphs built from Fibonacci words. Fibonacci Q. 60(5), 196\u2013211 (2022)","journal-title":"Fibonacci Q."},{"key":"8_CR12","volume-title":"The Art of Computer Programming","author":"D Knuth","year":"2011","unstructured":"Knuth, D.: The Art of Computer Programming, vol. 4A. Addison-Wesley Professional, Combinatorial Algorithms (2011)"},{"issue":"8","key":"8_CR13","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1080\/00029890.1960.11989593","volume":"67","author":"E Miles","year":"1960","unstructured":"Miles, E.: Generalized Fibonacci numbers and associated matrices. Amer. Math. Monthly 67(8), 745\u2013752 (1960)","journal-title":"Amer. Math. Monthly"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"M\u00fctze, T.: Combinatorial Gray codes - an updated survey. arXiv Preprint, Feb. 2022. arXiv: arxiv.org\/abs\/2202.01280","DOI":"10.37236\/11023"},{"key":"8_CR15","unstructured":"OEIS Foundation Inc., The on-line encyclopedia of integer sequences, published electronically at oeis.org (2023)"},{"key":"8_CR16","unstructured":"Ruskey, F.: Combinatorial Generation. Book under preparation (2003)"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"4","author":"C Savage","year":"1997","unstructured":"Savage, C.: A survey of combinatorial Gray codes. SIAM Rev. 4, 605\u2013629 (1997)","journal-title":"SIAM Rev."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Sawada, J., Williams, A., Wong, D.: Inside the binary reflected Gray code: Flip-swap languages in 2-Gray code order. In: Lecroq, T., Puzynina, S. (eds.) Combinatorics on Words, pp. 172\u2013184, Cham (2021)","DOI":"10.1007\/978-3-030-85088-3_15"},{"key":"8_CR19","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":"8_CR20","unstructured":"Stanton, D., White, D.: Constructive Combinatorics. Springer Science & Business Media (2012)"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Vajnovszki, V.: Gray code order for Lyndon words. Discret. Math. Theor. Comput. Sci., 9(2) (2007)","DOI":"10.46298\/dmtcs.393"}],"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-97-0566-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T04:00:09Z","timestamp":1731470409000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0566-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819705658","9789819705665"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0566-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 February 2024","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":"Kanazawa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.walcom-conference.org\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80","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":"28","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":"35% - 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":"1","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)"}}]}}