{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T00:32:06Z","timestamp":1775521926037,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540662242","type":"print"},{"value":"9783540485230","type":"electronic"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48523-6_41","type":"book-chapter","created":{"date-parts":[[2007,12,10]],"date-time":"2007-12-10T12:06:31Z","timestamp":1197288391000},"page":"443-452","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":93,"title":["Stable Marriage with Incomplete Lists and Ties"],"prefix":"10.1007","author":[{"given":"Kazuo","family":"Iwama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Manlove","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuichi","family":"Miyazaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasufumi","family":"Morita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,1,18]]},"reference":[{"key":"41_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D. Gale","year":"1962","unstructured":"D. Gale and L.S. Shapley, \u201cCollege admissions and the stability of marriage,\u201d Amer. Math. Monthly, Vol.69, pp.9\u201315, 1962.","journal-title":"Amer. Math. Monthly"},{"key":"41_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(85)90074-5","volume":"11","author":"D. Gale","year":"1985","unstructured":"D. Gale and M. Sotomayor, \u201cSome remarks on the stable matching problem,\u201d Discrete Applied Mathematics, Vol.11, pp.223\u2013232, 1985.","journal-title":"Discrete Applied Mathematics"},{"key":"41_CR3","volume-title":"Computers and Intractability, A Guide to The Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, \u201cComputers and Intractability, A Guide to The Theory of NP-Completeness,\u201d Freeman, San Francisco, 1979."},{"key":"41_CR4","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"D. Gusfield","year":"1989","unstructured":"D. Gusfield and R.W. Irving, \u201cThe Stable Marriage Problem: Structure and Algorithms,\u201d MIT Press, Boston, MA, 1989."},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad, \u201cClique is hard to approximate within n1-\u03b5, \u201d Proc. FOCS96, pp.627-636, 1996.","DOI":"10.1109\/SFCS.1996.548522"},{"key":"41_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"R.W. Irving","year":"1994","unstructured":"R.W. Irving, \u201cStable marriage and indifference,\u201d Discrete Applied Mathematics, Vol.48, pp.261\u2013272, 1994.","journal-title":"Discrete Applied Mathematics"},{"key":"41_CR7","unstructured":"T. Ohguro, \u201cOn the hardness of approximating minimization problems: in comparison with maximization classes,\u201d Technical Report of IEICE, COMP94-112 pp.89\u201396, 1995."},{"key":"41_CR8","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0196-6774(90)90007-2","volume":"11","author":"E. Ronn","year":"1990","unstructured":"E. Ronn, \u201cNP-complete stable matching problems,\u201d J. Algorithms, Vol.11, pp.285\u2013304, 1990.","journal-title":"J. Algorithms"},{"issue":"1","key":"41_CR9","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0138030","volume":"18","author":"M. Yannakakis","year":"1980","unstructured":"M. Yannakakis and F. Gavril, \u201cEdge dominating sets in graphs,\u201d SIAM J. Applied Mathematics, Vol.18, No.1, pp.364\u2013372, 1980.","journal-title":"SIAM J. Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48523-6_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T13:49:41Z","timestamp":1737640181000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-48523-6_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662242","9783540485230"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-48523-6_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"18 January 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}