{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:03:53Z","timestamp":1761293033787},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,5,29]],"date-time":"2013-05-29T00:00:00Z","timestamp":1369785600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10878-013-9630-z","type":"journal-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T05:10:52Z","timestamp":1369717852000},"page":"42-62","source":"Crossref","is-referenced-by-count":12,"title":["Snakes, coils, and single-track circuit codes with spread $$k$$ k"],"prefix":"10.1007","volume":"30","author":[{"given":"Simon","family":"Hood","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Recoskie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joe","family":"Sawada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,29]]},"reference":[{"issue":"1","key":"9630_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0095-8956(88)90051-2","volume":"45","author":"HL Abbott","year":"1988","unstructured":"Abbott HL, Katchalski M (1988) On the snake in the box problem. J Comb Theory B 45(1):13\u201324","journal-title":"J Comb Theory B"},{"key":"9630_CR2","first-page":"97","volume":"40","author":"HL Abbott","year":"1991","unstructured":"Abbott HL, Katchalski M (1991) On the construction of snake in the box codes. Util Math 40:97\u2013116","journal-title":"Util Math"},{"key":"9630_CR3","volume-title":"Investigating the snake-in-the-box problem with neuroevolution","author":"J Bishop","year":"2006","unstructured":"Bishop J (2006) Investigating the snake-in-the-box problem with neuroevolution. Department of Computer Science, The University of Texas at Austin, Austin"},{"key":"9630_CR4","doi-asserted-by":"crossref","unstructured":"Carlson BP, Hougen DF (2010) Phenotype feedback genetic algorithm operators for heuristic encoding of snakes within hypercubes. In: Pelikan M, Branke J (eds) GECCO, ACM, pp 791\u2013798","DOI":"10.1145\/1830483.1830622"},{"key":"9630_CR5","unstructured":"Casella DA, Potter WD (2005a) New lower bounds for the snake-in-the-box problem: using evolutionary techniques to hunt for snakes. In: Proceedings of the eighteenth international Florida artificial intelligence research society conference, Clearwater Beach, FL, USA. AAAI Press, Menlo Park, pp 264\u2013269"},{"key":"9630_CR6","doi-asserted-by":"crossref","unstructured":"Casella DA, Potter WD (2005b) Using evolutionary techniques to hunt for snakes and coils. In: IEEE congress on evolutionary computing, Edinburgh, UK, pp 2499\u20132505","DOI":"10.1109\/CEC.2005.1555007"},{"key":"9630_CR7","doi-asserted-by":"crossref","unstructured":"Chebiryak Y, Kroening D (2008) An efficient SAT encoding of circuit codes. In: International symposium on information theory and its applications","DOI":"10.1109\/ISITA.2008.4895595"},{"key":"9630_CR8","unstructured":"Chien RT, Freiman CV, Tang DT (1964) Error correction and circuits on the $$n$$ n -cube. In: 2nd Allerton conference on circuit and system theory, pp 899\u2013912"},{"key":"9630_CR9","doi-asserted-by":"crossref","unstructured":"Davies D (1965) Longest \u2018seperated\u2019 paths and loops in an $$n$$ n cube. IEEE Trans Electron Comput EC-14 (2):261","DOI":"10.1109\/PGEC.1965.264259"},{"key":"9630_CR10","doi-asserted-by":"crossref","unstructured":"Deimer K (1984) Some new bounds for the maximum length of circuit codes. IEEE Trans Inf Theory 30(5):754\u2013756","DOI":"10.1109\/TIT.1984.1056958"},{"key":"9630_CR11","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579373","volume":"5","author":"K Deimer","year":"1985","unstructured":"Deimer K (1985) A new upper bound on the length of snakes. Combinatorica 5:109\u2013120","journal-title":"Combinatorica"},{"key":"9630_CR12","doi-asserted-by":"crossref","unstructured":"Diaz Gomez PA, Hougan DF (2006) Genetic algorithms for hunting snakes in hypercubes: fitness function analysis and open questions. In: Software engineering, artificial intelligence, networking, and parallel\/distributed computing 2006, pp 389\u2013394","DOI":"10.1109\/SNPD-SAWN.2006.41"},{"key":"9630_CR13","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0021-9800(69)80029-3","volume":"6","author":"RJ Douglas","year":"1969","unstructured":"Douglas RJ (1969a) Some results on the maximum length of circuits of spread $$k$$ k in the $$d$$ d -cube. J Comb Theory 6:323\u2013339","journal-title":"J Comb Theory"},{"key":"9630_CR14","doi-asserted-by":"crossref","unstructured":"Douglas RJ (1969b) Upper bounds on lengths of circuits of even spread in the $$d$$ d -cube. J Comb Theory 7:206\u2013214","DOI":"10.1016\/S0021-9800(69)80013-X"},{"issue":"3","key":"9630_CR15","first-page":"10","volume":"2","author":"PG Emelyanov","year":"1995","unstructured":"Emelyanov PG (1995) On an upper bound for the length of a snake in an $$n$$ n -dimensional unit cube. Diskret Anal Issled Oper 2(3):10\u201317","journal-title":"Diskret Anal Issled Oper"},{"issue":"1\u20133","key":"9630_CR16","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0012-365X(99)00335-0","volume":"218","author":"PG Emelyanov","year":"2000","unstructured":"Emelyanov PG, Lukito A (2000) On the maximal length of a snake in hypercubes of small dimension. Discret Math 218(1\u20133):51\u201359","journal-title":"Discret Math"},{"key":"9630_CR17","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1109\/18.490544","volume":"42","author":"T Etzion","year":"1996","unstructured":"Etzion T, Paterson KG (1996) Near-optimal single-track gray codes. IEEE Trans Inf Theory 42:779\u2013789","journal-title":"IEEE Trans Inf Theory"},{"key":"9630_CR18","unstructured":"Garey MR, Johnson DS (1979) Computers and Intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"9630_CR19","unstructured":"Harris B (1977) The use of circuit codes in analog-to-digital conversion. Graph theory and its applications. Academic Press, New York, pp 121\u2013132"},{"issue":"6","key":"9630_CR20","doi-asserted-by":"crossref","first-page":"2587","DOI":"10.1109\/18.945274","volume":"47","author":"AP Hiltgen","year":"2001","unstructured":"Hiltgen AP, Paterson KG (2001) Single-track circuit codes. IEEE Trans Inf Theory 47(6):2587\u20132595","journal-title":"IEEE Trans Inf Theory"},{"key":"9630_CR21","doi-asserted-by":"crossref","first-page":"1555","DOI":"10.1109\/18.532900","volume":"42","author":"AP Hiltgen","year":"1996","unstructured":"Hiltgen AP, Paterson KG, Brandestini M (1996) Single-track gray codes. IEEE Trans Inf Theory 42:1555\u20131561","journal-title":"IEEE Trans Inf Theory"},{"key":"9630_CR22","unstructured":"Juric M, Potter W, Plaskin M (1994) Using PVM for hunting snake-in-the-box codes. In: Proceedings of the transputer research and applications conference, pp 97\u2013102"},{"key":"9630_CR23","doi-asserted-by":"crossref","unstructured":"Kautz WH (1958) Unit-distance error-checking codes. IRE Trans Electron Comput Ec-7:179\u2013180","DOI":"10.1109\/TEC.1958.5222529"},{"key":"9630_CR24","unstructured":"Kinny D (2012) A new approach to the snake-in-the-box problem. In: Luc De R, Christian B, Didier D, Patrick D, Paolo F, Fredrik H, Peter LJF (eds) ECAI, volume 242 of frontiers in artificial intelligence and applications. IOS Press, pp 462\u2013467"},{"key":"9630_CR25","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1145\/321406.321414","volume":"14","author":"V Klee","year":"1967","unstructured":"Klee V (1967) A method for constructing circuit codes. J Assoc Comput Mach 14:520\u2013528","journal-title":"J Assoc Comput Mach"},{"key":"9630_CR26","volume-title":"Graph theory and its applications","author":"V Klee","year":"1970","unstructured":"Klee V (1970a) The use of circuit codes in analog-to-digital conversion. In: Harris B (ed) Graph theory and its applications. Academic, New York"},{"key":"9630_CR27","doi-asserted-by":"crossref","unstructured":"Klee V (1970b) What is the maximum length of a d-dimensional snake? Am Math Mon 77:63\u201365","DOI":"10.2307\/2316860"},{"key":"9630_CR28","unstructured":"Kochut KJ (1996) Snake-in-the-box codes for dimension 7. J Comb Math Comb Comput 20:175\u2013185"},{"key":"9630_CR29","unstructured":"Lukito A (1998) An upper bound for the length of snake-in-the-box codes. In: 6th international workshop algebraic and combinatorial coding theory"},{"key":"9630_CR30","unstructured":"Lukito A, van Zantan AJ (1998) Stars and snake-in-the-box codes. Technical report DUT-TWI-98-43. Department of Technical Mathematics and Informatics, Delft University of Technology, Delft, The Netherlands"},{"issue":"3","key":"9630_CR31","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1109\/18.669420","volume":"44","author":"KG Paterson","year":"1998","unstructured":"Paterson KG, Tuliani J (1998) Some new circuit codes. IEEE Trans Inf Theory 44(3):1305\u20131309","journal-title":"IEEE Trans Inf Theory"},{"key":"9630_CR32","unstructured":"Potter W (2012) Latest records for the snake-in-the-box problem. http:\/\/www.ai.uga.edu\/sib\/records\/ . Accessed Nov 2012"},{"key":"9630_CR33","unstructured":"Potter WD, Robinson RW, Miller JA, Kochut K, Redys DZ (1994) Using the genetic algorithm to find snake-in-the-box codes. In: Industrial and engineering applications of artificial intelligence and expert systems, pp 421\u2013426"},{"key":"9630_CR34","unstructured":"Rajan DS, Shende AM (1999) Maximal and reversible snakes in hypercubes. In: 24th annual Australasian conference on combinatorial mathematics and combinatorial computing"},{"key":"9630_CR35","doi-asserted-by":"crossref","first-page":"2383","DOI":"10.1109\/18.796379","volume":"45","author":"M Schwartz","year":"1999","unstructured":"Schwartz M, Etzion T (1999) The structure of single-track gray codes. IEEE Trans Inf Theory 45:2383\u20132396","journal-title":"IEEE Trans Inf Theory"},{"key":"9630_CR36","doi-asserted-by":"crossref","unstructured":"Singleton RC (1966) Generalized snake-in-the-box codes. IEEE Trans Electron Comput 15:596\u2013602","DOI":"10.1109\/PGEC.1966.264382"},{"key":"9630_CR37","unstructured":"Sloane N (2012) The on-line encyclopedia of integer sequences. Sequence number: A000937, A099155. http:\/\/oeis.org\/ . Accessed Nov 2012"},{"issue":"3","key":"9630_CR38","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0012-365X(94)90039-6","volume":"133","author":"HS Snevily","year":"1994","unstructured":"Snevily HS (1994) The snake-in-the-box problem: a new upper bound. Discret Math 133(3):307\u2013314","journal-title":"Discret Math"},{"key":"9630_CR39","first-page":"71","volume":"45","author":"FI Solov\u2019jeva","year":"1987","unstructured":"Solov\u2019jeva FI (1987) An upper bound for the length of a cycle in an $$n$$ n -dimensional unit cube. Diskr Analiz 45:71\u201376","journal-title":"Diskr Analiz"},{"key":"9630_CR40","unstructured":"Taylor CA (1998) A comprehensive framework for the snake-in-the-box problem. Thesis for Master of Science, The University of Georgia"},{"key":"9630_CR41","unstructured":"Tuohy DR, Potter WD, Casella DA (2007a) A hybrid optimization method for discovering snake-in-the-box codes. In: First symposium on foundations of computational intelligence (FOCI\u201907)"},{"key":"9630_CR42","unstructured":"Tuohy DR, Potter WD, Casella DA (2007b) Searching for snake-in-the-box codes with evolved pruning methods. In: International conference on genetic and evolutionary methods, pp 3\u20139"},{"key":"9630_CR43","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF02122688","volume":"9","author":"J Wojciechowski","year":"1989","unstructured":"Wojciechowski J (1989) A new lower bound for snake-in-the-box codes. Combinatorica 9:91\u201399","journal-title":"Combinatorica"},{"key":"9630_CR44","doi-asserted-by":"crossref","unstructured":"Wyner AD (1971) Note on circuits and chains of spread $$k$$ k in the $$n$$ n -cube. IEEE Trans Comput C-20(4):474\u2013474","DOI":"10.1109\/T-C.1971.223272"},{"key":"9630_CR45","unstructured":"Wynn E (2012) Constructing circuit codes by permuting initial sequences. CoRR, abs\/1201.1647"},{"key":"9630_CR46","doi-asserted-by":"crossref","unstructured":"Yehezkeally Y, Schwartz M (2012) Snake-in-the-box codes for rank modulation. In: ISIT, pp 2983\u20132987","DOI":"10.1109\/ISIT.2012.6284107"},{"key":"9630_CR47","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF01200911","volume":"17","author":"G Z\u00e9mor","year":"1997","unstructured":"Z\u00e9mor G (1997) An upper bound on the size of the snake-in-the-box. Combinatorica 17:287\u2013298","journal-title":"Combinatorica"},{"issue":"2","key":"9630_CR48","first-page":"1819","volume":"56","author":"I Zinovik","year":"2009","unstructured":"Zinovik I, Chebiryak Y, Kroening D (2009) Periodic orbits and equilibria in glass models for gene regulatory network. IEEE Trans Inf Theory 56(2):1819\u20131823","journal-title":"IEEE Trans Inf Theory"},{"issue":"4","key":"9630_CR49","doi-asserted-by":"crossref","first-page":"1819","DOI":"10.1109\/TIT.2008.917695","volume":"54","author":"I Zinovik","year":"2008","unstructured":"Zinovik I, Kroening D, Chebiryak Y (2008) Computing binary combinatorial gray codes via exhaustive search with SAT solvers. IEEE Trans Inf Theory 54(4):1819\u20131823","journal-title":"IEEE Trans Inf Theory"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9630-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9630-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9630-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:21Z","timestamp":1559276601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9630-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,29]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9630"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9630-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,29]]}}}