{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T03:07:53Z","timestamp":1761016073224},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7808,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/0166-218x(92)90244-5","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T22:04:08Z","timestamp":1034287448000},"page":"197-203","source":"Crossref","is-referenced-by-count":5,"title":["A matching algorithm for regular bipartite graphs"],"prefix":"10.1016","volume":"35","author":[{"given":"J.","family":"Csima","sequence":"first","affiliation":[]},{"given":"L.","family":"Lov\u00e1sz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90244-5_BIB1","series-title":"Ph.D. Thesis","article-title":"Investigations on a time-table problem","author":"Csima","year":"1965"},{"key":"10.1016\/0166-218X(92)90244-5_BIB2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.2307\/2312726","article-title":"College admission and the stability of marriage","volume":"69","author":"Gale","year":"1962","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0166-218X(92)90244-5_BIB3","series-title":"Proceedings 12th Annual Symposium on Switching and Automata Theory","first-page":"122","article-title":"An n5\/2 algorithm for maximum matchings in bipartite graphs","author":"Hopcroft","year":"1971"},{"key":"10.1016\/0166-218X(92)90244-5_BIB4","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0166-218X(92)90244-5_BIB5","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/0166-218X(92)90244-5_BIB6","series-title":"Matching Theory","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/0166-218X(92)90244-5_BIB7","series-title":"Proceedings 21st Annual Symposium on Foundations of Computer Science","first-page":"17","article-title":"An O(V1\/2E) algorithm for finding maximum matching in general graphs","author":"Micali","year":"1980"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92902445?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92902445?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:23:39Z","timestamp":1555190619000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X92902445"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["0166218X92902445"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90244-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}