{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T03:48:27Z","timestamp":1727063307165},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,8,27]],"date-time":"2009-08-27T00:00:00Z","timestamp":1251331200000},"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":[[2010,4]]},"DOI":"10.1007\/s10878-009-9257-2","type":"journal-article","created":{"date-parts":[[2009,8,26]],"date-time":"2009-08-26T11:49:23Z","timestamp":1251287363000},"page":"279-303","source":"Crossref","is-referenced-by-count":37,"title":["Keeping partners together: algorithmic results for\u00a0the\u00a0hospitals\/residents problem with couples"],"prefix":"10.1007","volume":"19","author":[{"given":"Eric J.","family":"McDermid","sequence":"first","affiliation":[]},{"given":"David F.","family":"Manlove","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,27]]},"reference":[{"key":"9257_CR1","unstructured":"Berman P, Karpinski M, Scott AD (2003) Approximation hardness of short symmetric instances of MAX-3SAT. Electronic Colloquium on Computational Complexity Report, number\u00a049"},{"issue":"45","key":"9257_CR2","first-page":"1","volume":"3","author":"D Cantala","year":"2004","unstructured":"Cantala D (2004) Matching markets: the particular case of couples. Econ Bull 3(45):1\u201311","journal-title":"Econ Bull"},{"issue":"1\u20133","key":"9257_CR3","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.tcs.2008.02.014","volume":"400","author":"C Cheng","year":"2008","unstructured":"Cheng C, McDermid E, Suzuki I (2008) A unified approach to finding good stable matchings in the hospitals\/residents setting. Theor Comput Sci 400(1\u20133):84\u201399","journal-title":"Theor Comput Sci"},{"key":"9257_CR4","series-title":"IFIP international federation for information processing","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-0-387-34735-6_9","volume-title":"Proceedings of IFIP TCS 2006: the fourth IFIP international conference on theoretical computer science","author":"BC Dean","year":"2006","unstructured":"Dean BC, Goemans MX, Immorlica N (2006) The unsplittable stable marriage problem. In: Proceedings of IFIP TCS 2006: the fourth IFIP international conference on theoretical computer science. IFIP international federation for information processing, vol 209. Springer, Berlin, pp 65\u201375"},{"key":"9257_CR5","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1006\/jeth.1997.2291","volume":"75","author":"B Dutta","year":"1997","unstructured":"Dutta B, Mass\u00f3 J (1997) Stability of matchings when individuals have preferences over colleagues. J Econ Theory 75:464\u2013475","journal-title":"J Econ Theory"},{"key":"9257_CR6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale D, Shapley LS (1962) College admissions and the stability of marriage. Am Math Mon 69:9\u201315","journal-title":"Am Math Mon"},{"key":"9257_CR7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(85)90074-5","volume":"11","author":"D Gale","year":"1985","unstructured":"Gale D, Sotomayor M (1985) Some remarks on the stable matching problem. Discrete Appl Math 11:223\u2013232","journal-title":"Discrete Appl Math"},{"issue":"1","key":"9257_CR8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0216010","volume":"16","author":"D Gusfield","year":"1987","unstructured":"Gusfield D (1987) Three fast algorithms for four problems in stable marriage. SIAM J Comput 16(1):111\u2013128","journal-title":"SIAM J Comput"},{"key":"9257_CR9","volume-title":"The stable marriage problem: structure and algorithms","author":"D Gusfield","year":"1989","unstructured":"Gusfield D, Irving RW (1989) The stable marriage problem: structure and algorithms. MIT Press, Cambridge"},{"key":"9257_CR10","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/3-540-68530-8_32","volume-title":"Proceedings of ESA \u201998: the sixth European symposium on algorithms","author":"RW Irving","year":"1998","unstructured":"Irving RW (1998) Matching medical students to pairs of hospitals: a new variation on a well-known theme. In: Proceedings of ESA \u201998: the sixth European symposium on algorithms. Lecture notes in computer science, vol 1461. Springer, Berlin, pp 381\u2013392"},{"issue":"2","key":"9257_CR11","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.jda.2008.09.003","volume":"7","author":"RW Irving","year":"2009","unstructured":"Irving RW, Manlove DF, O\u2019Malley G (2009) Stable marriage with ties and bounded length preference lists. J\u00a0Discrete Algorithms 7(2):213\u2013219","journal-title":"J\u00a0Discrete Algorithms"},{"key":"9257_CR12","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.jet.2004.04.006","volume":"121","author":"B Klaus","year":"2005","unstructured":"Klaus B, Klijn F (2005) Stable matchings and preferences of couples. J Econ Theory 121:75\u2013106","journal-title":"J Econ Theory"},{"key":"9257_CR13","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.geb.2006.03.002","volume":"58","author":"B Klaus","year":"2007","unstructured":"Klaus B, Klijn F (2007) Paths to stability for matching markets with couples. Games Econ Behav 58:154\u2013171","journal-title":"Games Econ Behav"},{"key":"9257_CR14","author":"B Klaus","year":"2009","unstructured":"Klaus B, Klijn F, Nakamura T (2009) Corrigendum: stable matchings and preferences of couples. J Econ Theory. doi: 10.1016\/j.jet.2009.06.001","journal-title":"J Econ Theory"},{"key":"9257_CR15","volume-title":"Mariages stables","author":"DE Knuth","year":"1976","unstructured":"Knuth DE (1976) Mariages stables. Les Presses de L\u2019Universit\u00e9 de Montr\u00e9al, Montreal"},{"key":"9257_CR16","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/362619.362631","volume":"14","author":"D McVitie","year":"1971","unstructured":"McVitie D, Wilson LB (1971) The stable marriage problem. Commun ACM 14:486\u2013490","journal-title":"Commun ACM"},{"key":"9257_CR17","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0196-6774(90)90007-2","volume":"11","author":"E Ronn","year":"1990","unstructured":"Ronn E (1990) NP-complete stable matching problems. J Algorithms 11:285\u2013304","journal-title":"J Algorithms"},{"issue":"6","key":"9257_CR18","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"AE Roth","year":"1984","unstructured":"Roth AE (1984) The evolution of the labor market for medical interns and residents: a case study in game theory. J Polit Econ 92(6):991\u20131016","journal-title":"J Polit Econ"},{"key":"9257_CR19","doi-asserted-by":"crossref","first-page":"425","DOI":"10.2307\/1913160","volume":"54","author":"AE Roth","year":"1986","unstructured":"Roth AE (1986) On the allocation of residents to rural hospitals: a general property of two-sided matching markets. Econometrica 54:425\u2013427","journal-title":"Econometrica"},{"key":"9257_CR20","series-title":"Econometric society monographs","doi-asserted-by":"crossref","DOI":"10.1017\/CCOL052139015X","volume-title":"Two-sided matching: a study in game-theoretic modeling and analysis","author":"AE Roth","year":"1990","unstructured":"Roth AE, Sotomayor MAO (1990) Two-sided matching: a study in game-theoretic modeling and analysis. Econometric society monographs, vol 18. Cambridge University Press, Cambridge"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9257-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9257-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9257-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:14Z","timestamp":1559261894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9257-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,27]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["9257"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9257-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,27]]}}}