{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:41:01Z","timestamp":1743025261245,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031343469"},{"type":"electronic","value":"9783031343476"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-34347-6_23","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T23:03:35Z","timestamp":1685747015000},"page":"271-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generating Cyclic Rotation Gray Codes for\u00a0Stamp Foldings and\u00a0Semi-meanders"],"prefix":"10.1007","author":[{"given":"Bowie","family":"Liu","sequence":"first","affiliation":[]},{"given":"Dennis","family":"Wong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1721837.1721858","volume":"6","author":"B Bobier","year":"2010","unstructured":"Bobier, B., Sawada, J.: A fast algorithm to generate open meandric systems and meanders. ACM Trans. Algorithms 6(2), 1\u201312 (2010)","journal-title":"ACM Trans. Algorithms"},{"key":"23_CR2","unstructured":"COS++. The combinatorial object server (2023): Generate meanders and stamp foldings (2023)"},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1017\/S0004972700007486","volume":"24","author":"M France","year":"1981","unstructured":"France, M., van der Poorten, A.: Arithmetic and analytic properties of paper folding sequences. Bull. Aust. Math. Soc. 24(1), 123\u2013131 (1981)","journal-title":"Bull. Aust. Math. Soc."},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/S0019-9958(86)80033-X","volume":"68","author":"K Hoffmann","year":"1986","unstructured":"Hoffmann, K., Mehlhorn, K., Rosenstiehl, P., Tarjan, R.: Sorting Jordan sequences in linear time using level-linked search trees. Inf. Control 68(1), 170\u2013184 (1986)","journal-title":"Inf. Control"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Iordache, O.: Implementing Polytope Projects for Smart Systems, pp. 65\u201380. Springer, Cham (2017). Conditioned walks","DOI":"10.1007\/978-3-319-52551-8_4"},{"issue":"34","key":"23_CR6","doi-asserted-by":"publisher","first-page":"5953","DOI":"10.1088\/0305-4470\/33\/34\/301","volume":"33","author":"I Jensen","year":"2000","unstructured":"Jensen, I.: A transfer matrix approach to the enumeration of plane meanders. J. Phys. A: Math. Gen. 33(34), 5953 (2000)","journal-title":"J. Phys. A: Math. Gen."},{"issue":"2","key":"23_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0021-9800(68)80048-1","volume":"5","author":"J Koehler","year":"1968","unstructured":"Koehler, J.: Folding a strip of stamps. J. Comb. Theory 5(2), 135\u2013152 (1968)","journal-title":"J. Comb. Theory"},{"key":"23_CR8","first-page":"275","volume":"58","author":"S Legendre","year":"2014","unstructured":"Legendre, S.: Foldings and meanders. Australas. J Comb. 58, 275\u2013291 (2014)","journal-title":"Australas. J Comb."},{"issue":"5","key":"23_CR9","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."},{"key":"23_CR10","unstructured":"Lucas, E.: Th\u00e9orie des Nombres, vol. 1, p. 120. Gauthier-Villars, Paris (1891)"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1090\/S0025-5718-1968-0221957-8","volume":"22","author":"W Lunnon","year":"1968","unstructured":"Lunnon, W.: A map-folding problem. Math. Comput. 22, 193\u2013199 (1968)","journal-title":"Math. Comput."},{"key":"23_CR12","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":"23_CR13","unstructured":"OEIS Foundation Inc., The on-line encyclopedia of integer sequences, published electronically at (2023). http:\/\/oeis.org"},{"key":"23_CR14","unstructured":"Sainte-Lag\u00fce, M.: Avec des nombres et des lignes, pp. 147\u2013162. Vuibert, Paris (1937)"},{"issue":"2","key":"23_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.37236\/2404","volume":"19","author":"J Sawada","year":"2012","unstructured":"Sawada, J., Li, R.: Stamp foldings, semi-meanders, and open meanders: fast generation algorithms. Electron. J. Comb. 19(2), 43 (2012)","journal-title":"Electron. J. Comb."},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-030-85088-3_15","volume-title":"Combinatorics on Words","author":"J Sawada","year":"2021","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.) WORDS 2021. LNCS, vol. 12847, pp. 172\u2013184. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85088-3_15"},{"key":"23_CR17","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":"23_CR18","doi-asserted-by":"crossref","unstructured":"Schweitzer-Stenner, R., Uversky, V.: Protein and peptide folding, misfolding, and non-folding. Wiley Series in Protein and Peptide Science. Wiley, Hoboken (2012)","DOI":"10.1002\/9781118183373"},{"key":"23_CR19","volume-title":"A Handbook of Integer Sequences","author":"N Sloane","year":"1973","unstructured":"Sloane, N.: A Handbook of Integer Sequences. MIT Press, Cambridge (1973)"},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"385","DOI":"10.4153\/CJM-1950-035-6","volume":"2","author":"J Touchard","year":"1950","unstructured":"Touchard, J.: Contribution a l\u00e9tude du probleme des timbres poste. Can. J. Math. 2, 385\u2013398 (1950)","journal-title":"Can. J. Math."},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Zhu, L., Yao, S., Li, B., Song, A., Jia, Y., Mitani, J.: A geometric folding pattern for robot coverage path planning. In: 2021 IEEE International Conference on Robotics and Automation (ICRA), pp. 8509\u20138515 (2021)","DOI":"10.1109\/ICRA48506.2021.9561433"}],"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-34347-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T14:08:47Z","timestamp":1712758127000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34347-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031343469","9783031343476"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34347-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 June 2023","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":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2023.csie.ncku.edu.tw\/","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":"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":"33","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":"38% - 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.04","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":"5.69","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)"}}]}}