{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:24:57Z","timestamp":1759667097794},"reference-count":7,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"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":[[1989,10]]},"DOI":"10.1016\/0020-0190(89)90021-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"297-300","source":"Crossref","is-referenced-by-count":2,"title":["The complexity of matching with bonds"],"prefix":"10.1016","volume":"32","author":[{"given":"Manfred","family":"Padberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Sassano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(89)90021-5_BIB1","series-title":"Graphs","author":"Berge","year":"1985"},{"key":"10.1016\/0020-0190(89)90021-5_BIB2","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","article-title":"Matching, Euler tours and the Chinese postman","volume":"5","author":"Edmonds","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/0020-0190(89)90021-5_BIB3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/0020-0190(89)90021-5_BIB4","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/322092.322093","article-title":"Some matching problems for bipartite graphs","volume":"25","author":"Itai","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(89)90021-5_BIB5","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0020-0190(89)90021-5_BIB6","article-title":"Matching with bonds I","author":"Padberg","year":"1984","journal-title":"IASI-CNR Technical report No. 85"},{"issue":"2","key":"10.1016\/0020-0190(89)90021-5_BIB7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1145\/322307.322309","article-title":"The complexity of restricted spanning tree problems","volume":"29","author":"Papadimitriou","year":"1982","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089900215?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089900215?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:57:34Z","timestamp":1555088254000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019089900215"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0020019089900215"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(89)90021-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}