{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T20:09:34Z","timestamp":1767211774208,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_37","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"406-417","source":"Crossref","is-referenced-by-count":13,"title":["Dynamic Matchings in Convex Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Gerth St\u00f8lting","family":"Brodal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loukas","family":"Georgiadis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristoffer Arnsfelt","family":"Hansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irit","family":"Katriel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","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. Proc. Nat. Acad. Sci.\u00a043, 842\u2013844 (1957)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"3","key":"37_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation\u00a09(3), 251\u2013280 (1990)","journal-title":"Journal of Symbolic Computation"},{"key":"37_CR3","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, 185\u2013205 (1984)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"37_CR4","doi-asserted-by":"crossref","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. Journal of Computer and System Sciences\u00a030(2), 209\u2013221 (1985)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"37_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/6462.6502","volume":"18","author":"Z. Galil","year":"1986","unstructured":"Galil, Z.: Efficient algorithms for finding maximum matching in graphs. ACM Comput. Surv.\u00a018(1), 23\u201338 (1986)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"37_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0167-6377(84)90068-3","volume":"3","author":"G. Gallo","year":"1984","unstructured":"Gallo, G.: An O(nlogn) algorithm for the convex bipartite matching problem. Operations Research Letters\u00a03(1), 31\u201334 (1984)","journal-title":"Operations Research Letters"},{"key":"37_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 convex bipartite graphs. Naval Research Logistic Quarterly\u00a014, 313\u2013316 (1967)","journal-title":"Naval Research Logistic Quarterly"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Guibas, L., Sedgewick, R.: A dichromatic framework for balanced trees. In: Proc. 19th IEEE Symp. on Foundations of Computer Science, pp. 8\u201321 (1978)","DOI":"10.1109\/SFCS.1978.3"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Harvey, N.J.A.: Algebraic structures and algorithms for matching and matroid problems. In: Proc. 47th IEEE Symp. on Foundations of Computer Science, pp. 531\u2013542 (2006)","DOI":"10.1109\/FOCS.2006.8"},{"issue":"4","key":"37_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n 5\/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing\u00a02(4), 225\u2013231 (1973)","journal-title":"SIAM Journal on Computing"},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF00264533","volume":"15","author":"W. Lipski","year":"1981","unstructured":"Lipski, W., Preparata, F.P.: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems. Acta Informatica\u00a015, 329\u2013346 (1981)","journal-title":"Acta Informatica"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.: An ${O}(\\sqrt{|V|}\\cdot{|E|})$ algorithm for finding maximal matching in general graphs. In: Proc. 21st IEEE Symp. on Foundations of Computer Science, pp. 17\u201327 (1980)","DOI":"10.1109\/SFCS.1980.12"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Mucha, M., Sankowski, P.: Maximum matchings via gaussian elimination. In: Proc. 45th IEEE Symp. on Foundations of Computer Science, pp. 248\u2013255 (2004)","DOI":"10.1109\/FOCS.2004.40"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Nievergelt, J., Reingold, E.M.: Binary search trees of bounded balance. In: Proc. 4th ACM Symp. on Theory of Computing, pp. 137\u2013142 (1972)","DOI":"10.1145\/800152.804906"},{"issue":"1","key":"37_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321738.321739","volume":"20","author":"J. Nievergelt","year":"1973","unstructured":"Nievergelt, J., Wong, C.K.: Upper bounds for the total path length of binary trees. Journal of the ACM\u00a020(1), 1\u20136 (1973)","journal-title":"Journal of the ACM"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Sankowski, P.: Dynamic transitive closure via dynamic matrix inverse. In: Proc. 45th IEEE Symp. on Foundations of Computer Science, pp. 509\u2013517 (2004)","DOI":"10.1109\/FOCS.2004.25"},{"key":"37_CR17","unstructured":"Sankowski, P.: Faster dynamic matchings and vertex connectivity. In: Proc. 18th ACM-SIAM Symp. on Discrete Algorithms, pp. 118\u2013126 (2007)"},{"key":"37_CR18","first-page":"63","volume":"46","author":"M.G. Scutell\u00e0","year":"1988","unstructured":"Scutell\u00e0, M.G., Scevola, G.: A modification of Lipski-Preparata\u2019s algorithm for the maximum matching problem on bipartite convex graphs. Ricerca Operativa\u00a046, 63\u201377 (1988)","journal-title":"Ricerca Operativa"},{"issue":"12","key":"37_CR19","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 determining maximum matchings in convex, bipartite graphs. Computers and Mathematics with Applications\u00a031(12), 91\u201396 (1996)","journal-title":"Computers and Mathematics with Applications"},{"issue":"3","key":"37_CR20","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters\u00a06(3), 80\u201382 (1977)","journal-title":"Information Processing Letters"},{"key":"37_CR21","unstructured":"van Hoeve, W.-J.: The AllDifferent Constraint: A Survey. In: Proceedings of the Sixth Annual Workshop of the ERCIM Working Group on Constraints (2001)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T09:36:05Z","timestamp":1737365765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}