{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T07:05:14Z","timestamp":1765177514408},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,3,29]],"date-time":"2008-03-29T00:00:00Z","timestamp":1206748800000},"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":[[2008,11]]},"DOI":"10.1007\/s10878-008-9153-1","type":"journal-article","created":{"date-parts":[[2008,3,29]],"date-time":"2008-03-29T04:07:46Z","timestamp":1206763666000},"page":"344-360","source":"Crossref","is-referenced-by-count":20,"title":["Stable matching problems with exchange restrictions"],"prefix":"10.1007","volume":"16","author":[{"given":"Robert W.","family":"Irving","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,3,29]]},"reference":[{"key":"9153_CR1","first-page":"275","volume":"1","author":"J Alcalde","year":"1995","unstructured":"Alcalde J (1995) Exchange-proofness or divorce-proofness? Stability in one-sided matching markets. Econ Des 1:275\u2013287","journal-title":"Econ Des"},{"key":"9153_CR2","unstructured":"Allan J (2002) NHS Scotland. Personal communication"},{"key":"9153_CR3","unstructured":"Carms (2008) The Canadian Resident Matching Scheme. Wb document available at http:\/\/www.carms.ca\/index.html"},{"key":"9153_CR4","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0166-218X(01)00230-X","volume":"116","author":"K Cechl\u00e1rov\u00e1","year":"2002","unstructured":"Cechl\u00e1rov\u00e1 K (2002) On the complexity of exchange stable roommates. Discrete Appl Math 116:279\u2013287","journal-title":"Discrete Appl Math"},{"key":"9153_CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.dam.2005.06.003","volume":"152","author":"K Cechl\u00e1rov\u00e1","year":"2005","unstructured":"Cechl\u00e1rov\u00e1 K, Manlove DF (2005) The exchange-stable marriage problem. Discrete Appl Math 152:109\u2013122","journal-title":"Discrete Appl Math"},{"key":"9153_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":"9153_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 marriage problem. Discrete Appl Math 11:223\u2013232","journal-title":"Discrete Appl Math"},{"key":"9153_CR8","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MJ Garey","year":"1979","unstructured":"Garey MJ, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York"},{"key":"9153_CR9","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:111\u2013128","journal-title":"SIAM J Comput"},{"key":"9153_CR10","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":"9153_CR11","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/3-540-68530-8_32","volume-title":"Proceedings of ESA\u201998, the sixth annual european symposium on algorithms, Venice Italy, 1998","author":"RW Irving","year":"1998","unstructured":"Irving RW (1998) Matching medical students to pairs of hospitals: a new variation on an old theme. In: Proceedings of ESA\u201998, the sixth annual european symposium on algorithms, Venice Italy, 1998. LNCS, vol 1461. Springer, Berlin, pp 381\u2013392"},{"key":"9153_CR12","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1137\/0215048","volume":"15","author":"RW Irving","year":"1986","unstructured":"Irving RW, Leather P (1986) The complexity of counting stable marriages. SIAM J Comput 15:655\u2013667","journal-title":"SIAM J Comput"},{"key":"9153_CR13","volume-title":"Mariages stables","author":"DE Knuth","year":"1976","unstructured":"Knuth DE (1976) Mariages stables. Les Presses du l\u2019Universit\u00e9 de Montr\u00e9al, Montreal"},{"issue":"1","key":"9153_CR14","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.ipl.2006.07.005","volume":"101","author":"E McDermid","year":"2007","unstructured":"McDermid E, Cheng C, Suzuki I (2007) Hardness results on the man-exchange stable marriage problem with short preference lists. Inf Process Lett 101(1):13\u201319","journal-title":"Inf Process Lett"},{"key":"9153_CR15","unstructured":"NRMP (2007) National Resident Matching Program. Web document available at http:\/\/www.nrmp.org\/about_nrmp\/how.html"},{"issue":"6","key":"9153_CR16","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":"9153_CR17","first-page":"216","volume-title":"Proc 10th ann ACM symp on theory of computing","author":"TJ Schaefer","year":"1978","unstructured":"Schaefer TJ (1978) The complexity of satisfiability problems. In: Proc 10th ann ACM symp on theory of computing. ACM, New York, pp 216\u2013226"},{"key":"9153_CR18","unstructured":"SFAS (2008) Scottish Foundation Allocation Scheme. Web document available at http:\/\/www.nes.scot.nhs.uk\/sfas\/"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9153-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-008-9153-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9153-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,3]],"date-time":"2020-05-03T14:47:48Z","timestamp":1588517268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-008-9153-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,29]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["9153"],"URL":"https:\/\/doi.org\/10.1007\/s10878-008-9153-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,29]]}}}