{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:54:55Z","timestamp":1761663295571},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,8,21]],"date-time":"2014-08-21T00:00:00Z","timestamp":1408579200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s00224-014-9562-8","type":"journal-article","created":{"date-parts":[[2014,8,20]],"date-time":"2014-08-20T06:32:59Z","timestamp":1408516379000},"page":"418-435","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Generalized River Crossing Problems"],"prefix":"10.1007","volume":"56","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","published-online":{"date-parts":[[2014,8,21]]},"reference":[{"key":"9562_CR1","first-page":"1","volume":"11","author":"N Alon","year":"1993","unstructured":"Alon, N.: On the edge-expansion of graphs, Combinatorics. Probab. Comput. 11, 1\u201310 (1993)","journal-title":"Probab. Comput."},{"key":"9562_CR2","unstructured":"Bahls, P.: http:\/\/facstaff.unca.edu\/pbahls\/talks\/WGC.pdf"},{"issue":"1","key":"9562_CR3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.2307\/2689096","volume":"35","author":"R Bellman","year":"1962","unstructured":"Bellman, R.: Dynamic programming and \u201cdifficult crossing\u201d puzzles. Math. Mag. 35 (1), 27\u201329 (1962)","journal-title":"Math. Mag."},{"key":"9562_CR4","volume-title":"Alcuin\u2019s transportation problems and integer programming","author":"R Bornd\u00f6rfer","year":"1995","unstructured":"Bornd\u00f6rfer, R., Gr\u00f6tschel, M., L\u00f6bel, A.: Alcuin\u2019s transportation problems and integer programming. Konrad-Zuse-Zentrum f\u00fcr Informationstechnik, Berlin (1995). Preprint SC-95-27"},{"key":"9562_CR5","first-page":"320","volume":"5193","author":"P Csorba","year":"2008","unstructured":"Csorba, P., Hurkens, C.A.J., Woeginger, G.J.: The Alcuin number of a graph, Proc. ESA2007. LNCS 5193, 320\u2013331 (2008)","journal-title":"LNCS"},{"issue":"3","key":"9562_CR6","doi-asserted-by":"crossref","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. 24 (3), 757\u2013769 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"9562_CR7","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":"9562_CR8","unstructured":"Heeffer, A.: Alcuin, http:\/\/logica.ugent.be\/albrecht\/alcuin.pdf"},{"issue":"4","key":"9562_CR9","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S Hoory","year":"2006","unstructured":"Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Am. Math. Soc. 43 (4), 439\u2013561 (2006)","journal-title":"Bull. Am. Math. Soc."},{"key":"9562_CR10","first-page":"235","volume":"7288","author":"H Ito","year":"2012","unstructured":"Ito, H., Langerman, S., Yoshida, Y.: Algorithms and complexity of generalized river crossing problems, Proc. FUN 2012. LNCS 7288, 235\u2013244 (2012)","journal-title":"LNCS"},{"key":"9562_CR11","first-page":"227","volume":"4475","author":"M Lampis","year":"2007","unstructured":"Lampis, M., Mitsou, V.: The ferry cover problem, Proc. FUN 2007. LNCS 4475, 227\u2013239 (2007)","journal-title":"LNCS"},{"key":"9562_CR12","unstructured":"Peterson, I.: Tricky crossings, Science News Online, Vol. 164. retrieved 2008-02-07, http:\/\/web.archive.org\/web\/20040603203306\/http:\/\/www.sciencenews.org\/articles\/20031213\/mathtrek.asp"},{"issue":"4","key":"9562_CR13","doi-asserted-by":"crossref","first-page":"187","DOI":"10.2307\/2687980","volume":"34","author":"BR Schwartz","year":"1961","unstructured":"Schwartz, B.R.: An analytic method for the \u201cdifficult crossing\u201d puzzles. Math. Mag. 34 (4), 187\u2013193 (1961)","journal-title":"Math. Mag."},{"key":"9562_CR14","unstructured":"Trevisan, L.: Graph partitioning and expanders. Stanford University. CS359G, Lecture 6, 2011, http:\/\/theory.stanford.edu\/~trevisan\/cs359g\/"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9562-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-014-9562-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9562-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:54:26Z","timestamp":1558698866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-014-9562-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,21]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["9562"],"URL":"https:\/\/doi.org\/10.1007\/s00224-014-9562-8","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,21]]}}}