{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T14:09:45Z","timestamp":1769004585601,"version":"3.49.0"},"reference-count":11,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1016\/0020-0190(90)90132-h","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:10:11Z","timestamp":1027642211000},"page":"261-263","source":"Crossref","is-referenced-by-count":1,"title":["The necessary and sufficient condition for the worst-case male optimal stable matching"],"prefix":"10.1016","volume":"34","author":[{"given":"R.T.","family":"Kuo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.S.","family":"Tseng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(90)90132-H_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"},{"issue":"1","key":"10.1016\/0020-0190(90)90132-H_BIB2","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0216010","article-title":"Three fast algorithms for four problems in stable marriage","volume":"16","author":"Gusfield","year":"1987","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/0020-0190(90)90132-H_BIB3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0020-0190(84)90025-5","article-title":"A parallel view of stable marriages","volume":"18","author":"Hull","year":"1984","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/0020-0190(90)90132-H_BIB4","doi-asserted-by":"crossref","DOI":"10.1145\/28869.28871","article-title":"An efficient algorithm for the optimal stable marriage","volume":"34","author":"Irving","year":"1987","journal-title":"J. ACM"},{"issue":"8","key":"10.1016\/0020-0190(90)90132-H_BIB5","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. Opl. Res. Soc."},{"key":"10.1016\/0020-0190(90)90132-H_BIB6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0020-0190(85)90104-8","article-title":"Worst-case choice for the stable marriage problem","volume":"21","author":"Kapur","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(90)90132-H_BIB7","author":"Liu","year":"1968"},{"issue":"7","key":"10.1016\/0020-0190(90)90132-H_BIB8","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"},{"issue":"7","key":"10.1016\/0020-0190(90)90132-H_BIB9","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/362619.362632","article-title":"Algorithm 411, Pts. 1-3. Three procedures for the stable marriage problem","volume":"14","author":"McVitie","year":"1971","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(90)90132-H_BIB10","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/BF02136029","article-title":"A parallel algorithm to solve the stable marriage problem","volume":"24","author":"Tseng","year":"1984","journal-title":"BIT"},{"key":"10.1016\/0020-0190(90)90132-H_BIB11","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/BF01932966","article-title":"An analysis of the stable marriage assignment algorithm","volume":"12","author":"Wilson","year":"1972","journal-title":"BIT"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090132H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090132H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:59:09Z","timestamp":1555073949000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909090132H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["002001909090132H"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90132-h","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}