{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:59:12Z","timestamp":1725584352945},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2011,8,24]],"date-time":"2011-08-24T00:00:00Z","timestamp":1314144000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s00453-011-9556-8","type":"journal-article","created":{"date-parts":[[2011,8,23]],"date-time":"2011-08-23T16:36:35Z","timestamp":1314117395000},"page":"490-508","source":"Crossref","is-referenced-by-count":13,"title":["Bipartite Matching in the Semi-streaming Model"],"prefix":"10.1007","volume":"63","author":[{"given":"Sebastian","family":"Eggert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lasse","family":"Kliemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Munstermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand","family":"Srivastav","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,8,24]]},"reference":[{"key":"9556_CR1","unstructured":"Ahn, K.J., Guha, S.: Linear programming in the semi-streaming model with application to the maximum matching problem (2011). A short version appeared at ICALP 2011, pp. 526\u2013538. Available from: http:\/\/arxiv.org\/abs\/1104.2315"},{"issue":"9","key":"9556_CR2","doi-asserted-by":"crossref","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. Natl. Acad. Sci. USA 43(9), 842\u2013844 (1957). Available from: http:\/\/www.pnas.org\/content\/43\/9\/842.short","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"9556_CR3","unstructured":"Comput. J. 51(1,3), (2008). Special issue on parameterized complexity. Available from: http:\/\/comjnl.oxfordjournals.org\/content\/51\/1.toc"},{"key":"9556_CR4","first-page":"492","volume-title":"Proceedings of the 17th Annual European Symposium on Algorithms (ESA 2009)","author":"S. Eggert","year":"2009","unstructured":"Eggert, S., Kliemann, L., Srivastav, A.: Bipartite graph matchings in the semi-streaming model. In: Proceedings of the 17th Annual European Symposium on Algorithms (ESA 2009), Copenhagen, Denmark, September 2009, pp. 492\u2013503 (2009). Presented also at the MADALGO Workshop on Massive Data Algorithmics, June 2009, \u00c5rhus, Denmark. doi: 10.1007\/978-3-642-04128-0_44"},{"key":"9556_CR5","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/978-3-540-27836-8_46","volume-title":"Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004)","author":"J. Feigenbaum","year":"2004","unstructured":"Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. In: Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), Turku, Finland, July 2004, pp. 531\u2013543 (2004). doi: 10.1007\/978-3-540-27836-8_46"},{"issue":"4","key":"9556_CR6","doi-asserted-by":"crossref","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 J. Comput. 2(4), 225\u2013231 (1973). doi: 10.1137\/0202019","journal-title":"SIAM J. Comput."},{"key":"9556_CR7","first-page":"254","volume-title":"Proceedings of the 10th International Symposium on Experimental and Efficient Algorithms (SEA 2011)","author":"L. Kliemann","year":"2011","unstructured":"Kliemann, L.: Matching in bipartite graph streams in a small number of passes (extended abstract). In: Proceedings of the 10th International Symposium on Experimental and Efficient Algorithms (SEA 2011), Kolimpari, Chania, Crete, Greece, May 2011, pp. 254\u2013266 (2011). Document ID: dda51148-ac5b-4655-9c4f-e01f26511235. doi: 10.1007\/978-3-642-20662-7_22"},{"key":"9556_CR8","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/11538462_15","volume-title":"Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and Randomization and Computation (APPROX RANDOM 2005)","author":"A. McGregor","year":"2005","unstructured":"McGregor, A.: Finding graph matchings in data streams. In: Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and Randomization and Computation (APPROX RANDOM 2005), Berkeley, CA, USA, August 2005, pp. 170\u2013181 (2005). doi: 10.1007\/11538462_15"},{"key":"9556_CR9","first-page":"248","volume-title":"Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, Rome, Italy, October 2004 (FOCS 2004)","author":"M. Mucha","year":"2004","unstructured":"Mucha, M., Sankowski, P.: Maximum matchings via Gaussian elimination. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, Rome, Italy, October 2004 (FOCS 2004), pp. 248\u2013255 (2004). Available from: http:\/\/www.mimuw.edu.pl\/~mucha\/pub\/mucha_sankowski_focs04.pdf . Available from: http:\/\/doi.ieeecomputersociety.org\/10.1109\/FOCS.2004.40"},{"issue":"2","key":"9556_CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1561\/0400000002","volume":"1","author":"S.M. Muthukrishnan","year":"2005","unstructured":"Muthukrishnan, S.M.: Data streams: algorithms and applications. Found. Trends Theor. Comput. Sci. 1(2), 67 (2005). Available from: http:\/\/algo.research.googlepages.com\/eight.ps","journal-title":"Found. Trends Theor. Comput. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9556-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-011-9556-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9556-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:08Z","timestamp":1559123108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9556-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,24]]},"references-count":10,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9556"],"URL":"https:\/\/doi.org\/10.1007\/s00453-011-9556-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,24]]}}}