{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:57Z","timestamp":1740122517227,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,11,14]],"date-time":"2016-11-14T00:00:00Z","timestamp":1479081600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003005","name":"Eindhoven University of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003005","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10623-016-0301-9","type":"journal-article","created":{"date-parts":[[2016,11,14]],"date-time":"2016-11-14T11:42:33Z","timestamp":1479123753000},"page":"295-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The spurs of D.\u00a0H. Lehmer"],"prefix":"10.1007","volume":"84","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5114-5985","authenticated-orcid":false,"given":"Tom","family":"Verhoeff","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,14]]},"reference":[{"key":"301_CR1","volume-title":"Tintinnalogia, or, the Art of Ringing","author":"R Duckworth","year":"1671","unstructured":"Duckworth R., Stedman F.: Tintinnalogia, or, the Art of Ringing. Archer, London (1671)."},{"key":"301_CR2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/2422.322413","volume":"31","author":"P Eades","year":"1984","unstructured":"Eades P., Hickey M., Read R.: Some Hamilton paths and a minimal change algorithm. J. ACM 31, 19\u201329 (1984).","journal-title":"J. ACM"},{"issue":"1","key":"301_CR3","first-page":"31","volume":"4","author":"M El-Hashash","year":"2009","unstructured":"El-Hashash M.: The permutahedron \n                        $$\\pi _n$$\n                        \n                            \n                                            \n                                \n                                    \u03c0\n                                    n\n                                \n                            \n                        \n                     is Hamiltonian. Int. J. Contemp. Math. Sci. 4(1), 31\u201339 (2009).","journal-title":"Int. J. Contemp. Math. Sci."},{"key":"301_CR4","first-page":"79","volume":"4","author":"T Hough","year":"1988","unstructured":"Hough T., Ruskey F.: An efficient implementation of the Eades, Hickey, Read adjacent interchange combination generation algorithm. J. Comb. Math. Comb. Comput. 4, 79\u201386 (1988).","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"301_CR5","doi-asserted-by":"crossref","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 transpositions. Math. Comput. 17, 282\u2013285 (1963).","journal-title":"Math. Comput."},{"key":"301_CR6","unstructured":"Knuth D.E.: The Art of Computer Programming, vol. 4A. Combinatorial Algorithms, Part\u00a01. Addison-Wesley, Boston (2011)."},{"key":"301_CR7","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(88)90029-5","volume":"71","author":"CW Ko","year":"1988","unstructured":"Ko C.W., Ruskey F.: Solution of some multi-dimensional lattice path parity difference recurrence relations. Discret. Math. 71, 47\u201356 (1988).","journal-title":"Discret. Math."},{"issue":"2","key":"301_CR8","first-page":"26","volume":"72","author":"DH Lehmer","year":"1965","unstructured":"Lehmer D.H.: Permutations by adjacent interchanges. AMM 72(2), 26\u201346 (1965).","journal-title":"AMM"},{"issue":"2","key":"301_CR9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1137\/0405016","volume":"5","author":"G Stachowiak","year":"1992","unstructured":"Stachowiak G.: Hamilton paths in graphs of linear extensions for unions of posets. SIAM J. Discret. Math. 5(2), 199\u2013206 (1992).","journal-title":"SIAM J. Discret. Math."},{"issue":"8","key":"301_CR10","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1145\/368637.368660","volume":"5","author":"HF Trotter","year":"1962","unstructured":"Trotter H.F.: PERM (Algorithm 115). Commun. ACM 5(8), 434\u2013435 (1962).","journal-title":"Commun. ACM"},{"key":"301_CR11","unstructured":"van Duijnhoven E.: Generating all possible permutations with a minimal fixed restriction of any multiset by adjacent interchanges. Bachelor End Project Report, Department of Mathematics and Computer Science, Eindhoven University of Technology, 2013."},{"key":"301_CR12","unstructured":"van Heck I.: An alternative method and implementation for the generation of a Hamiltonian path through the binary neighbour-swap graph. Bachelor End Project Report, Department of Mathematics and Computer Science, Eindhoven University of Technology, December 2015."},{"key":"301_CR13","volume-title":"Bridges Towson: Mathematics, Music, Art, Architecture, Culture: Proceedings 2012","author":"T Verhoeff","year":"2012","unstructured":"Verhoeff T.: Combinatotrial choreography. In: Bosch R., McKenna D., Sarhangi R. (eds.) Bridges Towson: Mathematics, Music, Art, Architecture, Culture: Proceedings 2012. Tessellations Publishing, Phoenix (2012)."},{"key":"301_CR14","unstructured":"Verhoeff T.: Source code of Mathematica software for permutation graphs. \n                        www.win.tue.nl\/~wstomv\/software\/choreo\/\n                        \n                     (2016). Accessed 27\u00a0May 2016."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-016-0301-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0301-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0301-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,22]],"date-time":"2017-05-22T07:16:21Z","timestamp":1495437381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-016-0301-9"}},"subtitle":["Hamiltonian paths in neighbor-swap graphs of permutations"],"short-title":[],"issued":{"date-parts":[[2016,11,14]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["301"],"URL":"https:\/\/doi.org\/10.1007\/s10623-016-0301-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2016,11,14]]}}}