{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T07:49:12Z","timestamp":1673682552951},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,2,1]],"date-time":"2012-02-01T00:00:00Z","timestamp":1328054400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artif Life Robotics"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s10015-011-0993-x","type":"journal-article","created":{"date-parts":[[2012,2,21]],"date-time":"2012-02-21T07:20:52Z","timestamp":1329808852000},"page":"575-579","source":"Crossref","is-referenced-by-count":4,"title":["A diagrammatic classification in a combinatorial problem: the case of the stable marriage problem"],"prefix":"10.1007","volume":"16","author":[{"given":"T.","family":"Hayashi","sequence":"first","affiliation":[]},{"given":"Y.","family":"Hata","sequence":"additional","affiliation":[]},{"given":"Y.","family":"Ishida","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,22]]},"reference":[{"key":"993_CR1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale D, Shapley LS (1962) College admissions and the stability of marriage Am Math Monthly 69:9\u201315","journal-title":"Am Math Monthly"},{"key":"993_CR2","volume-title":"The stable marriage problem: structure and algorithm","author":"D. Gusfield","year":"1989","unstructured":"Gusfield D, Irving RW (1989) The stable marriage problem: structure and algorithm. MIT Press, London"},{"key":"993_CR3","unstructured":"Morizumi Y, Hayashi T, Ishida Y (2009) A network visualization of stable matching in the stable marriage problem. Proceedings of AROB"},{"key":"993_CR4","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/S0036144595294515","volume":"39","author":"M. Balinski","year":"1997","unstructured":"Balinski M, Ratier G (1997) Of stable marriages and graphs, and strategy and polytopes. SIAM Rev 39:575\u2013604","journal-title":"SIAM Rev"},{"key":"993_CR5","unstructured":"Nemoto T (2002) Handbook of applied mathematical programming (in Japanese). Asakura Syoten, pp 779\u2013830"},{"issue":"1","key":"993_CR6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01932704","volume":"29","author":"E. Veklerov","year":"1989","unstructured":"Veklerov E (1989) On the decomposability of the stable marriage problem. BIT Numerical Math 29(1):41\u201346","journal-title":"BIT Numerical Math"}],"container-title":["Artificial Life and Robotics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10015-011-0993-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10015-011-0993-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10015-011-0993-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T08:36:09Z","timestamp":1559118969000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10015-011-0993-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["993"],"URL":"https:\/\/doi.org\/10.1007\/s10015-011-0993-x","relation":{},"ISSN":["1433-5298","1614-7456"],"issn-type":[{"value":"1433-5298","type":"print"},{"value":"1614-7456","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2]]}}}