{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:05:38Z","timestamp":1778493938721,"version":"3.51.4"},"reference-count":9,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0304-3975(03)00319-0","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T10:16:39Z","timestamp":1056968199000},"page":"391-405","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":23,"title":["The stable marriage problem with restricted pairs"],"prefix":"10.1016","volume":"306","author":[{"given":"V\u00e2nia M.F.","family":"Dias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guilherme D.","family":"da Fonseca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Celina M.H.","family":"de Figueiredo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayme L.","family":"Szwarcfiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00319-0_BIB1","unstructured":"V.M.F. Dias, Stable matchings with restricted pairs, Master dissertation, COPPE, Universidade Federal do Rio de Janeiro, 2000 (in Portuguese)."},{"key":"10.1016\/S0304-3975(03)00319-0_BIB2","unstructured":"G.D. da Fonseca, Stable marriages with forbidden pairs, Graduation dissertation, Instituto de Matem\u00e1tica, Universidade Federal do Rio de Janeiro, 2000 (in Portuguese)."},{"key":"10.1016\/S0304-3975(03)00319-0_BIB3","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","article-title":"College admissions and the stability of marriage","volume":"69","author":"Gale","year":"1962","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0304-3975(03)00319-0_BIB4","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."},{"key":"10.1016\/S0304-3975(03)00319-0_BIB5","series-title":"The Stable Marriage Problem\u2014Structure and Algorithms","author":"Gusfield","year":"1989"},{"key":"10.1016\/S0304-3975(03)00319-0_BIB6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0166-218X(00)00258-4","article-title":"Efficient algorithms on distributive lattices","volume":"110","author":"Habib","year":"2001","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(03)00319-0_BIB7","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1137\/0215048","article-title":"The complexity of counting stable marriages","volume":"15","author":"Irving","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(03)00319-0_BIB8","doi-asserted-by":"crossref","unstructured":"D.E. Knuth, Stable Marriage and its Relation to Other Combinatorial Problems, American Mathematical Society, Providence, RI, 1997.","DOI":"10.1090\/crmp\/010"},{"key":"10.1016\/S0304-3975(03)00319-0_BIB9","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"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503003190?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503003190?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:31Z","timestamp":1759625551000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503003190"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0304397503003190"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00319-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The stable marriage problem with restricted pairs","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(03)00319-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}