{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T08:36:03Z","timestamp":1758702963803,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030799861"},{"type":"electronic","value":"9783030799878"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-79987-8_10","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"137-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Hamilton Cycle in the k-Sided Pancake Network"],"prefix":"10.1007","author":[{"given":"B.","family":"Cameron","sequence":"first","affiliation":[]},{"given":"J.","family":"Sawada","sequence":"additional","affiliation":[]},{"given":"A.","family":"Williams","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"S Akers","year":"1989","unstructured":"Akers, S., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38(4), 555\u2013566 (1989)","journal-title":"IEEE Trans. Comput."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"105214","DOI":"10.1016\/j.jcta.2020.105214","volume":"173","author":"CA Athanasiadis","year":"2020","unstructured":"Athanasiadis, C.A.: Binomial Eulerian polynomials for colored permutations. J. Comb. Theory Ser. A 173, 105214 (2020)","journal-title":"J. Comb. Theory Ser. A"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Bagno, E., Garber, D., Mansour, T.: On the group of alternating colored permutations. Electron. J. Comb. 21(2), 2.29 (2014)","DOI":"10.37236\/3974"},{"issue":"13","key":"10_CR4","first-page":"12","volume":"6","author":"A Borodin","year":"1999","unstructured":"Borodin, A.: Longest increasing subsequences of random colored permutations. Electron. J. Comb. 6(13), 12 (1999)","journal-title":"Electron. J. Comb."},{"issue":"21","key":"10_CR5","doi-asserted-by":"publisher","first-page":"6235","DOI":"10.1016\/j.disc.2009.06.006","volume":"309","author":"WYC Chen","year":"2009","unstructured":"Chen, W.Y.C., Gao, H.Y., He, J.: Labeled partitions with colored permutations. Discret. Math. 309(21), 6235\u20136244 (2009)","journal-title":"Discret. Math."},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0166-218X(94)00009-3","volume":"61","author":"DS Cohen","year":"1995","unstructured":"Cohen, D.S., Blum, M.: On the problem of sorting burnt pancakes. Discret. Appl. Math. 61(2), 105\u2013120 (1995)","journal-title":"Discret. Appl. Math."},{"key":"10_CR7","unstructured":"COS++: The Combinatorial Object Server. http:\/\/combos.org\/cperm"},{"issue":"2","key":"10_CR8","first-page":"38","volume":"18","author":"A Duane","year":"2011","unstructured":"Duane, A., Remmel, J.: Minimal overlapping patterns in colored permutations. Electron. J. Comb. 18(2), 38 (2011). Paper 25","journal-title":"Electron. J. Comb."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.2307\/2318261","volume":"82","author":"H Dweighter","year":"1975","unstructured":"Dweighter, H.: Problem E2569. Am. Math. Mon. 82, 1010 (1975)","journal-title":"Am. Math. Mon."},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Essed, H., Therese, W.: The harassed waitress problem. In: Ferro, A., Luccio, F., Widmayer, P. (eds.) Fun with Algorithms. FUN 2014. Lecture Notes in Computer Science, vol. 8496. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07890-8_28","DOI":"10.1007\/978-3-319-07890-8_28"},{"key":"10_CR11","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262062824.001.0001","volume-title":"Combinatorics of Genome Rearrangements","author":"G Fertin","year":"2009","unstructured":"Fertin, G., Labarre, A., Rusu, I., Vialette, S., Tannier, E.: Combinatorics of Genome Rearrangements. MIT Press, Cambridge (2009)"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(79)90068-2","volume":"27","author":"WH Gates","year":"1979","unstructured":"Gates, W.H., Papadimitriou, C.H.: Bounds for sorting by prefix reversal. Discret. Math. 27(1), 47\u201357 (1979)","journal-title":"Discret. Math."},{"key":"10_CR13","unstructured":"Gray, F.: Pulse code communication. U.S. Patent 2,632,058 (1947)"},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1006\/jagm.1997.0874","volume":"25","author":"MH Heydari","year":"1997","unstructured":"Heydari, M.H., Sudborough, I.H.: On the diameter of the pancake network. J. Algorithms 25(1), 67\u201394 (1997)","journal-title":"J. Algorithms"},{"key":"10_CR15","unstructured":"Justan, M.P., Muga, F.P., Sudborough, I.H.: On the generalization of the pancake network. In: Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN 2002, pp. 173\u2013178 (2002)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Kaneko, K.: Hamiltonian cycles and Hamiltonian paths in faulty burnt pancake graphs. IEICE - Trans. Inf. Syst. E90-D(4), 716\u2013721 (2007)","DOI":"10.1093\/ietisy\/e90-d.4.716"},{"key":"10_CR17","unstructured":"Knuth, D.E.: The Art of Computer Programming, volume 4: Combinatorial Algorithms, Part 1. Addison-Wesley (2010)"},{"key":"10_CR18","unstructured":"Mansour, T.: Pattern avoidance in coloured permutations. S\u00e9m. Lothar. Combin. 46, B46g-12 (2001)"},{"issue":"3","key":"10_CR19","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s00026-003-0190-2","volume":"7","author":"T Mansour","year":"2003","unstructured":"Mansour, T.: Coloured permutations containing and avoiding certain patterns. Ann. Comb. 7(3), 349\u2013355 (2003)","journal-title":"Ann. Comb."},{"key":"10_CR20","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. Discret. Appl. Math. 210, 61\u201374 (2016)","journal-title":"Discret. Appl. Math."},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Sawada, J., Williams, A.: Successor rules for flipping pancakes and burnt pancakes. Theoret. Comput. Sci. 609(part 1), 60\u201375 (2016)","DOI":"10.1016\/j.tcs.2015.09.007"},{"issue":"2","key":"10_CR22","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/356689.356692","volume":"9","author":"R Sedgewick","year":"1977","unstructured":"Sedgewick, R.: Permutations generation methods. ACM Comput. Surv. 9(2), 137\u2013164 (1977)","journal-title":"ACM Comput. Surv."},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Shin, H., Zeng, J.: Symmetric unimodal expansions of excedances in colored permutations. Eur. J. Comb. 52(part A), 174\u2013196 (2016)","DOI":"10.1016\/j.ejc.2015.10.004"},{"key":"10_CR24","unstructured":"Singh, S.: Flipping pancakes with mathematics. The Guardian (2013)"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-13122-6_35","volume-title":"Fun with Algorithms","author":"A Williams","year":"2010","unstructured":"Williams, A.: O(1)-time unsorting by prefix-reversals in a boustrophedon linked list. In: Boldi, P., Gargano, L. (eds.) FUN 2010. LNCS, vol. 6099, pp. 368\u2013379. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13122-6_35"},{"key":"10_CR26","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"},{"issue":"2","key":"10_CR27","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/BF01937486","volume":"24","author":"S Zaks","year":"1984","unstructured":"Zaks, S.: A new algorithm for generation of permutations. BIT 24(2), 196\u2013204 (1984)","journal-title":"BIT"}],"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-030-79987-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:10:46Z","timestamp":1625008246000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 June 2021","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":"Ottawa, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2021.eecs.uottawa.ca\/","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":"107","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":"38","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":"36% - 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.1","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":"9.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)"}},{"value":"The workshop was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}