{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:42:12Z","timestamp":1740109332525,"version":"3.37.3"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T00:00:00Z","timestamp":1661126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T00:00:00Z","timestamp":1661126400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","award":["RGPIN-2018-04211"],"award-info":[{"award-number":["RGPIN-2018-04211"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s00453-022-01022-x","type":"journal-article","created":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T13:06:12Z","timestamp":1661173572000},"page":"717-744","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality"],"prefix":"10.1007","volume":"85","author":[{"given":"Ben","family":"Cameron","sequence":"first","affiliation":[]},{"given":"Joe","family":"Sawada","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Therese","sequence":"additional","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,8,22]]},"reference":[{"issue":"4","key":"1022_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. Computers, IEEE Transactions on 38(4), 555\u2013566 (1989)","journal-title":"Computers, IEEE Transactions on"},{"key":"1022_CR2","doi-asserted-by":"publisher","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. Combin. Theory Ser. A 173, 105214 (2020)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1022_CR3","doi-asserted-by":"crossref","unstructured":"Bagno, E., Garber, D., Mansour, T.: On the group of alternating colored permutations. Electron. J. Combin. 21(2), Paper 2.29 (2014)","DOI":"10.37236\/3974"},{"issue":"13","key":"1022_CR4","first-page":"12","volume":"6","author":"A Borodin","year":"1999","unstructured":"Borodin, A.: Longest increasing subsequences of random colored permutations. Electron. J. Combin. 6(13), 12 (1999)","journal-title":"Electron. J. Combin."},{"key":"1022_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/978-3-030-79987-8_10","volume-title":"IWOCA \u201921: 32nd International Workshop on Combinatorial Algorithms","author":"B Cameron","year":"2021","unstructured":"Cameron, B., Sawada, J., Williams, A.: A Hamilton cycle in the \n$$k$$-sided pancake network. In: Flocchini, P., Moura, L. (eds.) IWOCA \u201921: 32nd International Workshop on Combinatorial Algorithms. Lecture Notes in Computer Science, vol. 12757, pp. 137\u2013151. Springer, Ottawa, ON, Canada (2021)"},{"key":"1022_CR6","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), pages 2128\u20132140. SIAM, (2022)","DOI":"10.1137\/1.9781611977073.84"},{"issue":"21","key":"1022_CR7","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. Discrete Math. 309(21), 6235\u20136244 (2009)","journal-title":"Discrete Math."},{"issue":"2","key":"1022_CR8","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. Discrete Appl. Math. 61(2), 105\u2013120 (1995)","journal-title":"Discrete Appl. Math."},{"key":"1022_CR9","unstructured":"COS++. The Combinatorial Object Server. http:\/\/combos.org\/cperm"},{"key":"1022_CR10","unstructured":"Doleman, J., et\u00a0al.: Campanalogia Improved: Or, the Art of Ringing Made Easy,... C. Hitch and L. Hawes; and J. Hodges, 1733"},{"key":"1022_CR11","doi-asserted-by":"crossref","unstructured":"Duane, A., Remmel, J.: Minimal overlapping patterns in colored permutations. Electron. J. Combin. 18(2), Paper 25, 38 (2011)","DOI":"10.37236\/2021"},{"key":"1022_CR12","unstructured":"Duckworth, R., Stedman, F.: Tintinnalogia: Or, The Art of Ringing. London, (1668)"},{"key":"1022_CR13","unstructured":"Duckworth, R., Stedman, F.: Tintinnalogia: Or, The Art of Ringing, Kingsmead Reprints (1970)"},{"key":"1022_CR14","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.2307\/2318261","volume":"82","author":"H Dweighter","year":"1975","unstructured":"Dweighter, H.: Problem E2569. Amer. Math. Monthly 82, 1010 (1975)","journal-title":"Amer. Math. Monthly"},{"key":"1022_CR15","unstructured":"Eppstein, D.: An almost-forgotten combinatorist: Heinrich August Rothe. https:\/\/11011110.github.io\/blog\/2012\/03\/27\/almost-forgotten-combinatorist-heinrich.html, (2012)"},{"key":"1022_CR16","doi-asserted-by":"crossref","unstructured":"Essed, H., Therese, W.: The harassed waitress problem. In: Ferro, A., Luccio, F., Widmayer, P. (eds), Fun with Algorithms, volume 8496 of Lecture Notes in Computer Science, pages 325\u2013339. Springer International Publishing, (2014)","DOI":"10.1007\/978-3-319-07890-8_28"},{"key":"1022_CR17","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., Tannier, E., Vialette, S.: Combinatorics of Genome Rearrangements. MIT Press, Cambridge (2009)"},{"issue":"1","key":"1022_CR18","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. Discrete Math. 27(1), 47\u201357 (1979)","journal-title":"Discrete Math."},{"key":"1022_CR19","unstructured":"Gray, F.: Pulse code communication. U.S. Patent 2,632,058, (1947)"},{"issue":"04","key":"1022_CR20","doi-asserted-by":"publisher","first-page":"2255","DOI":"10.1090\/tran\/8199","volume":"375","author":"E Hartung","year":"2022","unstructured":"Hartung, E., Hoang, H., M\u00fctze, T., Williams, A.: Combinatorial generation via permutation languages. i. fundamentals. Trans. Am. Math. Soc. 375(04), 2255\u20132291 (2022)","journal-title":"Trans. Am. Math. Soc."},{"key":"1022_CR21","doi-asserted-by":"crossref","unstructured":"Hartung, E., Hoang, H.P., M\u00fctze, T., Williams, A.: Combinatorial generation via permutation languages. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1214\u20131225. SIAM, (2020)","DOI":"10.1137\/1.9781611975994.74"},{"issue":"1","key":"1022_CR22","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":"1022_CR23","unstructured":"Hindenburg, C.F.: Sammlung combinatorisch-analytischer Abhandlungen, volume\u00a01. ben Gerhard Fleischer dem Jungern, (1796)"},{"issue":"1","key":"1022_CR24","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1109\/TIT.2016.2620160","volume":"63","author":"AE Holroyd","year":"2016","unstructured":"Holroyd, A.E.: Perfect snake-in-the-box codes for rank modulation. IEEE Trans. Inf. Theory 63(1), 104\u2013110 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1022_CR25","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1215\/10829636-4403136","volume":"48","author":"K Hunt","year":"2018","unstructured":"Hunt, K.: The art of changes: bell-ringing, anagrams, and the culture of combination in seventeenth-century england. Journal of Medieval and Early Modern Studies 48(2), 387\u2013412 (2018)","journal-title":"Journal of Medieval and Early Modern Studies"},{"issue":"83","key":"1022_CR26","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1090\/S0025-5718-1963-0159764-2","volume":"17","author":"SM Johnson","year":"1963","unstructured":"Johnson, S.M.: Generation of permutations by adjacent transposition. Math. Comput. 17(83), 282\u2013285 (1963)","journal-title":"Math. Comput."},{"key":"1022_CR27","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\u201902, pages 173\u2013178, (2002)"},{"issue":"4","key":"1022_CR28","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1093\/ietisy\/e90-d.4.716","volume":"E90\u2013D","author":"K Kaneko","year":"2007","unstructured":"Kaneko, K.: Hamiltonian cycles and Hamiltonian paths in faulty burnt pancake graphs. IEICE - Trans. Inf. Syst. E90\u2013D(4), 716\u2013721 (2007)","journal-title":"IEICE - Trans. Inf. Syst."},{"issue":"4","key":"1022_CR29","first-page":"395","volume":"44","author":"M Knor","year":"1994","unstructured":"Knor, M.: Gray codes in graphs. Math. Slovaca 44(4), 395\u2013412 (1994)","journal-title":"Math. Slovaca"},{"key":"1022_CR30","unstructured":"Knuth, D.E.: The Art of Computer Programming, volume 4: Combinatorial Algorithms, Part 1. Addison-Wesley, (2010)"},{"key":"1022_CR31","unstructured":"Mansour, T.: Pattern avoidance in coloured permutations. S\u00e9m. Lothar. Combin., 46:Art. B46g, 12, (2001\/02)"},{"issue":"3","key":"1022_CR32","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":"1022_CR33","unstructured":"McGuire, G.: Bells, motels and permutation groups. arXiv preprint arXiv:1203.1835, (2012)"},{"key":"1022_CR34","unstructured":"Merino, A., M\u00fctze, T., Williams, A.: All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges. In: Fraigniaud, P., Uno, Y. (eds), 11th International Conference on Fun with Algorithms (FUN 2022), volume 226 of Leibniz International Proceedings in Informatics (LIPIcs), pages 22:1\u201322:28, Dagstuhl, Germany, 2022. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik"},{"issue":"7","key":"1022_CR35","first-page":"452","volume":"10","author":"R Ord-Smith","year":"1967","unstructured":"Ord-Smith, R.: Generation of permutations in pseudolexicographic order. Commun. ACM 10(7), 452 (1967)","journal-title":"Commun. ACM"},{"issue":"2","key":"1022_CR36","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1093\/comjnl\/14.2.136","volume":"14","author":"R Ord-Smith","year":"1971","unstructured":"Ord-Smith, R.: Generation of permutation sequences: Part 2. Comput. J. 14(2), 136\u2013139 (1971)","journal-title":"Comput. J."},{"key":"1022_CR37","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. Discrete Appl. Math. 210, 61\u201374 (2016)","journal-title":"Discrete Appl. Math."},{"issue":"part 1","key":"1022_CR38","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. Theoret. Comput. Sci. 609(part 1), 60\u201375 (2016)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"1022_CR39","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."},{"issue":"part A","key":"1022_CR40","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.ejc.2015.10.004","volume":"52","author":"H Shin","year":"2016","unstructured":"Shin, H., Zeng, J.: Symmetric unimodal expansions of excedances in colored permutations. European J. Combin. 52(part A), 174\u2013196 (2016)","journal-title":"European J. Combin."},{"key":"1022_CR41","unstructured":"Singh, S.: Flipping pancakes with mathematics. The Guardian, (2013)"},{"key":"1022_CR42","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":"1022_CR43","unstructured":"Steinhaus, H.: One hundred problems in elementary mathematics. Basic Books, (1964)"},{"issue":"1 Series II","key":"1022_CR44","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1111\/j.2164-0947.1980.tb02775.x","volume":"39","author":"SM Stigler","year":"1980","unstructured":"Stigler, S.M.: Stigler\u2019s law of eponymy. Trans. N. Y. Acad. Sci. 39(1 Series II), 147\u2013157 (1980)","journal-title":"Trans. N. Y. Acad. Sci."},{"issue":"8","key":"1022_CR45","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1145\/368637.368660","volume":"5","author":"HF Trotter","year":"1962","unstructured":"Trotter, H.F.: Algorithm 115: perm. Commun. ACM 5(8), 434\u2013435 (1962)","journal-title":"Commun. ACM"},{"key":"1022_CR46","unstructured":"Trust, H.: Record 000208301. https:\/\/catalog.hathitrust.org\/Record\/000208301"},{"issue":"1","key":"1022_CR47","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10623-016-0301-9","volume":"84","author":"T Verhoeff","year":"2017","unstructured":"Verhoeff, T.: The spurs of dh lehmer. Des. Codes Crypt. 84(1), 295\u2013310 (2017)","journal-title":"Des. Codes Crypt."},{"issue":"9","key":"1022_CR48","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1080\/00029890.1996.12004816","volume":"103","author":"AT White","year":"1996","unstructured":"White, A.T.: Fabian stedman: The first group theorist? Am. Math. Mon. 103(9), 771\u2013778 (1996)","journal-title":"Am. Math. Mon."},{"key":"1022_CR49","doi-asserted-by":"crossref","unstructured":"Williams, A.: O(1)-time unsorting by prefix-reversals in a boustrophedon linked list. In 5th International Conference on FUN with Algorithms, volume 6099 of Lecture Notes in Computer Science, pages 368\u2013379. Springer, (2010)","DOI":"10.1007\/978-3-642-13122-6_35"},{"key":"1022_CR50","doi-asserted-by":"crossref","unstructured":"Williams, A.: The greedy Gray code algorithm. In Algorithms and Data Structures Symposium, WADS 2013, volume LNCS 8037, pages 525\u2013536, (2013)","DOI":"10.1007\/978-3-642-40104-6_46"},{"key":"1022_CR51","doi-asserted-by":"crossref","unstructured":"Williams, A., Sawada, J.: Greedy pancake flipping. In The VII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2013), volume\u00a045, pages 357\u2013362, (2013)","DOI":"10.1016\/j.endm.2013.10.056"},{"issue":"2","key":"1022_CR52","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":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01022-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-01022-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01022-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T15:06:17Z","timestamp":1677855977000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-01022-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,22]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["1022"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-01022-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2022,8,22]]},"assertion":[{"value":"19 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no known conflicts of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}