{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T09:58:58Z","timestamp":1649066338046},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,8,1]],"date-time":"1987-08-01T00:00:00Z","timestamp":554774400000},"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":9482,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1987,8]]},"DOI":"10.1016\/0890-5401(87)90027-7","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T20:34:26Z","timestamp":1103229266000},"page":"113-139","source":"Crossref","is-referenced-by-count":3,"title":["On-line updating of solutions to a class of matroid intersection problems"],"prefix":"10.1016","volume":"74","author":[{"given":"Greg N.","family":"Frederickson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mandayam A.","family":"Srinivas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(87)90027-7_BIB1","first-page":"37","article-title":"O jistem problemu minimalnim","volume":"3","author":"Boruvka","year":"1926","journal-title":"Praca Moravske Prirodovedecke Spolecnosti"},{"key":"10.1016\/0890-5401(87)90027-7_BIB2","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1137\/0205051","article-title":"Finding minimum spanning trees","volume":"5","author":"Cheriton","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(87)90027-7_BIB3","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1137\/0214055","article-title":"Data structures for on-line updating of minimum spanning trees, with applications","volume":"14","author":"Frederickson","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(87)90027-7_BIB4","series-title":"Proceedings, 16th ACM Symp. on Theory of Computing","first-page":"383","article-title":"Data structures for on-line updating of matroid intersection solutions","author":"Frederickson","year":"1984"},{"key":"10.1016\/0890-5401(87)90027-7_BIB5","series-title":"Proceedings, 25th Symp. on Foundations of Computer Science","first-page":"338","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","author":"Fredman","year":"1984"},{"key":"10.1016\/0890-5401(87)90027-7_BIB6","series-title":"Proceedings, 25th Symp. on Foundations of Computer Science","first-page":"347","article-title":"Efficient implementation of graph algorithms using contraction","author":"Gabow","year":"1984"},{"key":"10.1016\/0890-5401(87)90027-7_BIB7","series-title":"Proceedings, International Conf. on Automata, Languages, and Programming","first-page":"210","article-title":"Efficient algorithms for graphic matroid intersection and parity","volume":"Vol. 194","author":"Gabow","year":"1985"},{"key":"10.1016\/0890-5401(87)90027-7_BIB8","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0196-6774(84)90042-7","article-title":"Efficient algorithms for a family of matroid intersection problems","volume":"5","author":"Gabow","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0890-5401(87)90027-7_BIB9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/nav.3800140304","article-title":"Maximum matching in a convex bipartite graph","volume":"14","author":"Glover","year":"1967","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0890-5401(87)90027-7_BIB10","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0166-218X(84)90077-5","article-title":"Matroid optimization with the interleaving of two ordered sets","volume":"8","author":"Gusfield","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0890-5401(87)90027-7_BIB11","author":"Jackson","year":"1955"},{"key":"10.1016\/0890-5401(87)90027-7_BIB12","first-page":"95","article-title":"Scheduling of unit-length independent tasks with execution constraints","volume":"4","author":"Lang","year":"1976"},{"key":"10.1016\/0890-5401(87)90027-7_BIB13","author":"Lawler","year":"1976"},{"key":"10.1016\/0890-5401(87)90027-7_BIB14","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF00264533","article-title":"Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems","volume":"15","author":"Lipski","year":"1981","journal-title":"Acta Inform."},{"issue":"No. 2","key":"10.1016\/0890-5401(87)90027-7_BIB15","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","article-title":"Maintenance of configurations in the plane","volume":"23","author":"Overmars","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(87)90027-7_BIB16","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","article-title":"A data structure for dynamic trees","volume":"26","author":"Sleator","year":"1983","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0890-5401(87)90027-7_BIB17","author":"Welsh","year":"1976"},{"key":"10.1016\/0890-5401(87)90027-7_BIB18","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1137\/0214019","article-title":"New data structures for orthogonal range queries","volume":"14","author":"Willard","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(87)90027-7_BIB19","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1145\/3828.3839","article-title":"Adding range restriction capability to dynamic data structures","volume":"32","author":"Willard","year":"1985","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540187900277?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540187900277?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T01:26:07Z","timestamp":1548897967000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540187900277"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,8]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,8]]}},"alternative-id":["0890540187900277"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(87)90027-7","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1987,8]]}}}