{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:48:03Z","timestamp":1781077683861,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,5]]},"DOI":"10.1145\/1806689.1806753","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"457-464","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":48,"title":["Maintaining a large matching and a small vertex cover"],"prefix":"10.1145","author":[{"given":"Krzysztof","family":"Onak","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ronitt","family":"Rubinfeld","sequence":"additional","affiliation":[{"name":"MIT \/ Tel Aviv University, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms , Second Edition. The MIT Press and McGraw-Hill Book Company , 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. The MIT Press and McGraw-Hill Book Company, 2001."},{"key":"e_1_3_2_1_2_1","volume-title":"Dynamic graph algorithms","author":"Eppstein D.","year":"1997","unstructured":"D. Eppstein , Z. Galil , and G. F. Italiano . Dynamic graph algorithms . CRC Press , 1997 . D. Eppstein, Z. Galil, and G. F. Italiano. Dynamic graph algorithms. CRC Press, 1997."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/265910.265914"},{"key":"e_1_3_2_1_4_1","volume-title":"STACS","author":"Epstein L.","year":"2010","unstructured":"L. Epstein , A. Levin , J. Mestre , and D. Segev . Improved approximation guarantees for weighted matching in the semi--streaming model . In STACS , 2010 . L. Epstein, A. Levin, J. Mestre, and D. Segev. Improved approximation guarantees for weighted matching in the semi--streaming model. In STACS, 2010."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.09.013"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/320211.320215"},{"key":"e_1_3_2_1_7_1","first-page":"99","volume-title":"WG","author":"Ivkovic Z.","year":"1993","unstructured":"Z. Ivkovic and E. L. Lloyd . Fully dynamic maintenance of vertex cover . In WG , pages 99 -- 111 , 1993 . Z. Ivkovic and E. L. Lloyd. Fully dynamic maintenance of vertex cover. In WG, pages 99--111, 1993."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009223"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281126"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_15"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1980.12"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.04.040"},{"key":"e_1_3_2_1_13_1","first-page":"118","volume-title":"SODA","author":"Sankowski P.","year":"2007","unstructured":"P. Sankowski . Faster dynamic matchings and vertex connectivity . In SODA , pages 118 -- 126 , 2007 . P. Sankowski. Faster dynamic matchings and vertex connectivity. In SODA, pages 118--126, 2007."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380804"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060607"},{"key":"e_1_3_2_1_16_1","first-page":"669","volume-title":"STACS","author":"Zelke M.","year":"2008","unstructured":"M. Zelke . Weighted matching in the semi-streaming model . In STACS , pages 669 -- 680 , 2008 . M. Zelke. Weighted matching in the semi-streaming model. In STACS, pages 669--680, 2008."}],"event":{"name":"STOC'10: Symposium on Theory of Computing","location":"Cambridge Massachusetts USA","acronym":"STOC'10","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-second ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806753","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806689.1806753","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:37Z","timestamp":1750246777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806753"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":16,"alternative-id":["10.1145\/1806689.1806753","10.1145\/1806689"],"URL":"https:\/\/doi.org\/10.1145\/1806689.1806753","relation":{},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}