{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:32:16Z","timestamp":1725795136352},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080154"},{"type":"electronic","value":"9783319080161"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08016-1_30","type":"book-chapter","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T04:18:07Z","timestamp":1401423487000},"page":"330-342","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Matchings in Left Weighted Convex Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Quan","family":"Zu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miaomiao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley (1974)"},{"issue":"9","key":"30_CR2","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C. Berge","year":"1957","unstructured":"Berge, C.: Two theorems in graph theory. Proceedings of the National Academy of Sciences of the United States of America\u00a043(9), 842\u2013844 (1957)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-540-74456-6_37","volume-title":"Mathematical Foundations of Computer Science 2007","author":"G.S. Brodal","year":"2007","unstructured":"Brodal, G.S., Georgiadis, L., Hansen, K.A., Katriel, I.: Dynamic matchings in convex bipartite graphs. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 406\u2013417. Springer, Heidelberg (2007)"},{"issue":"2","key":"30_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0743-7315(84)90004-2","volume":"1","author":"E. Dekel","year":"1984","unstructured":"Dekel, E., Sahni, S.: A parallel matching algorithm for convex bipartite graphs and applications to scheduling. Journal of Parallel and Distributed Computing\u00a01(2), 185\u2013205 (1984)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"30_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"H.N. Gabow","year":"1985","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. J. Comput. Syst. Sci.\u00a030(2), 209\u2013221 (1985)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"30_CR6","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/S0021-9800(68)80039-0","volume":"4","author":"D. Gale","year":"1968","unstructured":"Gale, D.: Optimal assignments in an ordered set: An application of matroid theory. Journal of Combinatorial Theory\u00a04(2), 176\u2013180 (1968)","journal-title":"Journal of Combinatorial Theory"},{"issue":"3","key":"30_CR7","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/nav.3800140304","volume":"14","author":"F. Glover","year":"1967","unstructured":"Glover, F.: Maximum matching in a convex bipartite graph. Naval Research Logistics Quarterly\u00a014(3), 313\u2013316 (1967)","journal-title":"Naval Research Logistics Quarterly"},{"issue":"2","key":"30_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1287\/ijoc.1070.0232","volume":"20","author":"I. Katriel","year":"2008","unstructured":"Katriel, I.: Matchings in node-weighted convex bipartite graphs. INFORMS Journal on Computing\u00a020(2), 205\u2013211 (2008)","journal-title":"INFORMS Journal on Computing"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF00264533","volume":"15","author":"W. Lipski Jr.","year":"1981","unstructured":"Lipski Jr., W., Preparata, F.P.: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems. Acta Inf.\u00a015, 329\u2013346 (1981)","journal-title":"Acta Inf."},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-540-70575-8_19","volume-title":"Automata, Languages and Programming","author":"C.G. Plaxton","year":"2008","unstructured":"Plaxton, C.G.: Fast scheduling of weighted unit jobs with release times and deadlines. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 222\u2013233. Springer, Heidelberg (2008)"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-642-45030-3_49","volume-title":"Algorithms and Computation","author":"C.G. Plaxton","year":"2013","unstructured":"Plaxton, C.G.: Vertex-weighted matching in two-directional orthogonal ray graphs. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol.\u00a08283, pp. 524\u2013534. Springer, Heidelberg (2013)"},{"key":"30_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-29700-7_12","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"Y. Song","year":"2012","unstructured":"Song, Y., Liu, T., Xu, K.: Independent domination on tree convex bipartite graphs. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) AAIM 2012 and FAW 2012. LNCS, vol.\u00a07285, pp. 129\u2013138. Springer, Heidelberg (2012)"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/3-540-13345-3_42","volume-title":"Automata, Languages, and Programming","author":"T.H. Spencer","year":"1984","unstructured":"Spencer, T.H., Mayr, E.W.: Node weighted matching. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol.\u00a0172, pp. 454\u2013464. Springer, Heidelberg (1984)"},{"issue":"12","key":"30_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0898-1221(96)00079-X","volume":"31","author":"G. Steiner","year":"1996","unstructured":"Steiner, G., Yeomans, J.S.: A linear time algorithm for maximum matchings in convex, bipartite graphs. Computers and Mathematics with Applications\u00a031(12), 91\u201396 (1996)","journal-title":"Computers and Mathematics with Applications"},{"issue":"2","key":"30_CR15","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM\u00a022(2), 215\u2013225 (1975)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08016-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:08:33Z","timestamp":1558912113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08016-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080154","9783319080161"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08016-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}