{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T07:29:00Z","timestamp":1749194940496},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648482"},{"type":"electronic","value":"9783540685302"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-68530-8_32","type":"book-chapter","created":{"date-parts":[[2007,11,8]],"date-time":"2007-11-08T22:14:16Z","timestamp":1194560056000},"page":"381-392","source":"Crossref","is-referenced-by-count":34,"title":["Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-known Theme"],"prefix":"10.1007","author":[{"given":"Robert W.","family":"Irving","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"32_CR1","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, Mass., 1990."},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"D. Gale and L.S. Shapley. College admissions and the stability of marriage. American Mathematical Monthly, 69:9\u201315, 1962.","journal-title":"American Mathematical Monthly"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"A. Goldberg and R.E. Tarjan. A new approach to the maximum flow problem. In Proceedings of the 18th ACM Symposium on the Theory of Computing, pages 136\u2013146, 1986.","DOI":"10.1145\/12130.12144"},{"key":"32_CR4","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"D. Gusfield","year":"1989","unstructured":"D. Gusfield and R.W. Irving. The Stable Marriage Problem: Structure and Algorithms. MIT Press, Boston, MA, 1989."},{"key":"32_CR5","doi-asserted-by":"crossref","DOI":"10.1090\/crmp\/010","volume-title":"Stable Marriage and its Relation to Other Combinatorial Problems","author":"D.E. Knuth","year":"1996","unstructured":"D.E. Knuth. Stable Marriage and its Relation to Other Combinatorial Problems. American Mathematical Society, Providence, RI, 1996."},{"key":"32_CR6","unstructured":"G.M. Low. Pre-register post matching in the West of Scotland. Master\u2019s thesis, University of Glasgow, 1997."},{"issue":"6","key":"32_CR7","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1038\/scientificamerican0697-40a","volume":"276","author":"M. Mukerjee","year":"1997","unstructured":"M. Mukerjee. Medical mismatch. Scientific American, 276(6):40\u201341, June 1997.","journal-title":"Scientific American"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"A.E. Roth","year":"1984","unstructured":"A.E. Roth. The evolution of the labor market for medical interns and residents: a case study in game theory. Journal of Political Economy, 92:991\u20131016, 1984.","journal-title":"Journal of Political Economy"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"1524","DOI":"10.1126\/science.2274783","volume":"250","author":"A.E. Roth","year":"1990","unstructured":"A.E. Roth. New physicians: a natural experiment in market organization. Science, 250:1524\u20131528, 1990.","journal-title":"Science"},{"key":"32_CR10","first-page":"415","volume":"81","author":"A.E. Roth","year":"1991","unstructured":"A.E. Roth. A natural experiment in the organization of entry-level labor markets: regional markets for new physicians and surgeons in the United Kingdom. The American Economic Review, 81:415\u2013440, 1991.","journal-title":"The American Economic Review"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"A.E. Roth and M. Sotomayor. Two Sided Matching: A Study in Game-Theoretic Modelling and Analysis. Cambridge University Press, 1991.","DOI":"10.1017\/CCOL052139015X"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1097\/00001888-199506000-00007","volume":"70","author":"K.J. Williams","year":"1995","unstructured":"K.J. Williams. A reexamination of the NRMP matching algorithm. Academic Medicine, 70:470\u2013476, 1995.","journal-title":"Academic Medicine"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA\u2019 98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68530-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T08:28:18Z","timestamp":1556958498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68530-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648482","9783540685302"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-68530-8_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}