{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:43:53Z","timestamp":1742913833377,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030802226"},{"type":"electronic","value":"9783030802233"}],"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-80223-3_15","type":"book-chapter","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T14:13:49Z","timestamp":1625148829000},"page":"216-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Chinese Remainder Encoding for Hamiltonian Cycles"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5587-8801","authenticated-orcid":false,"given":"Marijn J. H.","family":"Heule","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,2]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Bomanson, J., Gebser, M., Janhunen, T., Kaufmann, B., Schaub, T.: Answer set programming modulo acyclicity. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) Logic Programming and Nonmonotonic Reasoning. pp. 143\u2013150. Springer International Publishing (2015)","DOI":"10.1007\/978-3-319-23264-5_13"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Buratti, M., Del Fra, A.: Cyclic Hamiltonian cycle systems of the complete graph. Discrete Mathematics 279(1), 107\u2013119 (2004), in Honour of Zhu Lie","DOI":"10.1016\/S0012-365X(03)00267-X"},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0196-6774(89)90012-6","volume":"10","author":"N Chiba","year":"1989","unstructured":"Chiba, N., Nishizeki, T.: The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs. Journal of Algorithms 10(2), 187\u2013211 (1989)","journal-title":"Journal of Algorithms"},{"key":"15_CR4","unstructured":"Gent, I.P.: Arc consistency in SAT. In: Proceedings of the 15th European Conference on Artificial Intelligence. p. 121\u2013125. ECAI\u201902, IOS Press, NLD (2002)"},{"key":"15_CR5","unstructured":"Golomb, S.W.: Shift Register Sequences. Aegean Park Press (1982)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Grebinski, V., Kucherov, G.: Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping. Discrete Applied Mathematics 88(1), 147\u2013165 (1998), computational Molecular Biology DAM - CMB Series","DOI":"10.1016\/S0166-218X(98)00070-5"},{"key":"15_CR7","unstructured":"Haythorpe, M.: FHCP challenge set: The first set of structurally difficult instances of the Hamiltonian cycle problem (2019), https:\/\/arxiv.org\/abs\/1902.10352v1"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.5614\/ejgta.2019.7.1.5","volume":"7","author":"M Haythorpe","year":"2019","unstructured":"Haythorpe, M., Johnson, A.: Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples. EJGTA 7, 61\u201375 (2019)","journal-title":"EJGTA"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Hertel, A., Hertel, P., Urquhart, A.: Formalizing dangerous SAT encodings. In: Marques-Silva, J., Sakallah, K.A. (eds.) Theory and Applications of Satisfiability Testing \u2013 SAT 2007. pp. 159\u2013172. Springer Berlin Heidelberg, Berlin, Heidelberg (2007)","DOI":"10.1007\/978-3-540-72788-0_18"},{"key":"15_CR10","unstructured":"Lin, F., Zhao, J.: On tight logic programs and yet another translation from normal logic programs to propositional logic. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence. p. 853\u2013858. IJCAI\u201903, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2003)"},{"issue":"2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0166-218X(02)00410-9","volume":"130","author":"S Prestwich","year":"2003","unstructured":"Prestwich, S.: SAT problems with chains of dependent variables. Discrete Appl. Math. 130(2), 329\u2013350 (2003)","journal-title":"Discrete Appl. Math."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Soh, T., Le Berre, D., Roussel, S., Banbara, M., Tamura, N.: Incremental SAT-based method with native boolean cardinality handling for the Hamiltonian cycle problem. In: Ferm\u00e9, E., Leite, J. (eds.) Logics in Artificial Intelligence. pp. 684\u2013693. Springer International Publishing (2014)","DOI":"10.1007\/978-3-319-11558-0_52"},{"key":"15_CR13","unstructured":"Velev, M.N., Gao, P.: Efficient SAT techniques for absolute encoding of permutation problems: Application to hamiltonian cycles. In: Bulitko, V., Beck, J.C. (eds.) Eighth Symposium on Abstraction, Reformulation, and Approximation, SARA 2009, Lake Arrowhead, California, USA, 8\u201310 August 2009. AAAI (2009)"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-030-58475-7_34","volume-title":"Principles and Practice of Constraint Programming","author":"NF Zhou","year":"2020","unstructured":"Zhou, N.F.: In pursuit of an efficient SAT encoding for the Hamiltonian cycle problem. In: Simonis, H. (ed.) Principles and Practice of Constraint Programming, pp. 585\u2013602. Springer International Publishing, Cham (2020)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80223-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T23:32:54Z","timestamp":1625182374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80223-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030802226","9783030802233"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80223-3_15","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":"2 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Satisfiability Testing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"9 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sat2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iiia.csic.es\/sat2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}