{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:18:12Z","timestamp":1725891492716},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642303463"},{"type":"electronic","value":"9783642303470"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30347-0_24","type":"book-chapter","created":{"date-parts":[[2012,5,31]],"date-time":"2012-05-31T02:27:55Z","timestamp":1338431275000},"page":"235-244","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms and Complexity of Generalized River Crossing Problems"],"prefix":"10.1007","author":[{"given":"Hiro","family":"Ito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuichi","family":"Yoshida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Bahls, P.: The wolf, the goat, and the cabbage: A modern twist on a classical problem, \n                  \n                    http:\/\/facstaff.unca.edu\/pbahls\/talks\/WGC.pdf"},{"issue":"1","key":"24_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.2307\/2689096","volume":"35","author":"R. Bellman","year":"1962","unstructured":"Bellman, R.: Dynamic programming and \u201cdifficult crossing\u201d puzzles. Mathematics Magazine\u00a035(1), 27\u201329 (1962)","journal-title":"Mathematics Magazine"},{"key":"24_CR3","unstructured":"Bornd\u00f6rfer, R., Gr\u00f6tschel, M., L\u00f6bel, A.: Alcuin\u2019s transportation problems and integer programming, Preprint SC-95-27, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin (1995)"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-87744-8_27","volume-title":"Algorithms - ESA 2008","author":"P. Csorba","year":"2008","unstructured":"Csorba, P., Hurkens, C.A.J., Woeginger, G.J.: The Alcuin Number of a Graph. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 320\u2013331. Springer, Heidelberg (2008)"},{"issue":"3","key":"24_CR5","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1137\/080736661","volume":"24","author":"P. Csorba","year":"2010","unstructured":"Csorba, P., Hurkens, C.A.J., Woeginger, G.J.: The Alcuin number of a graph and its connections to the vertex cover number. SIAM J. Discrete Math.\u00a024(3), 757\u2013769 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"24_CR6","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman And Company (1979)"},{"key":"24_CR7","unstructured":"Heeffer, A.: Alcuin, \n                  \n                    http:\/\/logica.ugent.be\/albrecht\/alcuin.pdf"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-540-72914-3_20","volume-title":"Fun with Algorithms","author":"M. Lampis","year":"2007","unstructured":"Lampis, M., Mitsou, V.: The Ferry Cover Problem. In: Crescenzi, P., Prencipe, G., Pucci, G. (eds.) FUN 2007. LNCS, vol.\u00a04475, pp. 227\u2013239. Springer, Heidelberg (2007)"},{"key":"24_CR9","unstructured":"Peterson, I.: Tricky crossings, Science News Online 164(24), \n                  \n                    http:\/\/web.archive.org\/web\/20040603203306\/http:\/\/www.sciencenews.org\/articles\/20031213\/mathtrek.asp\n                  \n                  \n                 (retrieved February 7, 2008)"},{"issue":"4","key":"24_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.2307\/2687980","volume":"34","author":"B.R. Schwartz","year":"1961","unstructured":"Schwartz, B.R.: An analytic method for the \u201cdifficult crossing\u201d puzzles. Mathematics Magazine\u00a034(4), 187\u2013193 (1961)","journal-title":"Mathematics Magazine"},{"key":"24_CR11","unstructured":"Trevisan, L.: Graph Partitioning and Expanders, Stanford University \u2014 CS359G, Lecture 6 (2011), \n                  \n                    http:\/\/theory.stanford.edu\/~trevisan\/cs359g\/"},{"key":"24_CR12","unstructured":"Propositiones ad Acuendos Juvenes, Wikipedia, the free encyclopedia"}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30347-0_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:37:13Z","timestamp":1620128233000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30347-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642303463","9783642303470"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30347-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}