{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:28:01Z","timestamp":1778498881178,"version":"3.51.4"},"reference-count":8,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1985,12]]},"DOI":"10.1016\/0196-6774(85)90033-1","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"577-595","source":"Crossref","is-referenced-by-count":336,"title":["An efficient algorithm for the \u201cstable roommates\u201d problem"],"prefix":"10.1016","volume":"6","author":[{"given":"Robert W","family":"Irving","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(85)90033-1_BIB1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.2307\/2312726","article-title":"College admissions and the stability of marriage","volume":"69","author":"Gale","year":"1962","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0196-6774(85)90033-1_BIB2","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1057\/jors.1978.170","article-title":"The upper bound for the stable marriage problem","volume":"29","author":"Itoga","year":"1978","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/0196-6774(85)90033-1_BIB3","series-title":"Mariages Stables","author":"Knuth","year":"1976"},{"key":"10.1016\/0196-6774(85)90033-1_BIB4","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/362619.362631","article-title":"The stable marriage problem","volume":"14","author":"McVitie","year":"1971","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(85)90033-1_BIB5","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/362619.362632","article-title":"Three procedures for the stable marriage problem, ACM Algorithm 411","volume":"14","author":"McVitie","year":"1971","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(85)90033-1_BIB6","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/BF01932966","article-title":"An analysis of the stable marriage assignment problem","volume":"12","author":"Wilson","year":"1972","journal-title":"BIT"},{"key":"10.1016\/0196-6774(85)90033-1_BIB7","article-title":"A Survey of the Stable Marriage Assignment Problem","author":"Wilson","year":"1981"},{"key":"10.1016\/0196-6774(85)90033-1_BIB8","series-title":"Algorithms + Data Structures = Programs","author":"Wirth","year":"1976"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900331?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900331?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:25:52Z","timestamp":1548743152000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677485900331"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["0196677485900331"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90033-1","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}