{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:32:39Z","timestamp":1787499159077,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,19]],"date-time":"2016-06-19T00:00:00Z","timestamp":1466294400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["340506"],"award-info":[{"award-number":["340506"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"European Union's Seventh Framework Programme","award":["317532"],"award-info":[{"award-number":["317532"]}]},{"name":"Swedish Research Council","award":["2015-04659"],"award-info":[{"award-number":["2015-04659"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,19]]},"DOI":"10.1145\/2897518.2897568","type":"proceedings-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T09:04:07Z","timestamp":1465549447000},"page":"398-411","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["New deterministic approximation algorithms for fully dynamic matching"],"prefix":"10.1145","author":[{"given":"Sayan","family":"Bhattacharya","sequence":"first","affiliation":[{"name":"Institute of Mathematical Sciences at Chennai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Monika","family":"Henzinger","sequence":"additional","affiliation":[{"name":"University of Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danupon","family":"Nanongkai","sequence":"additional","affiliation":[{"name":"KTH, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,6,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.53"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.89"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47672-7_14"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884485"},{"key":"e_1_3_2_1_5_1","volume-title":"Deterministic fully dynamic data structures for vertex cover and matching. CoRR, abs\/1412.1318","author":"Bhattacharya S.","year":"2014","unstructured":"S. Bhattacharya , M. Henzinger , and G. F. Italiano . Deterministic fully dynamic data structures for vertex cover and matching. CoRR, abs\/1412.1318 , 2014 . S. Bhattacharya, M. Henzinger, and G. F. Italiano. Deterministic fully dynamic data structures for vertex cover and matching. CoRR, abs\/1412.1318, 2014."},{"key":"e_1_3_2_1_6_1","volume-title":"SODA","year":"2015","unstructured":"Announced at SODA 2015 . Announced at SODA 2015."},{"key":"e_1_3_2_1_7_1","volume-title":"APPROX\/RANDOM","author":"Crouch M.","year":"2014","unstructured":"M. Crouch and D. S. Stubbs . Improved streaming algorithms for weighted matching, via unweighted matching . In APPROX\/RANDOM , 2014 . M. Crouch and D. S. Stubbs. Improved streaming algorithms for weighted matching, via unweighted matching. In APPROX\/RANDOM, 2014."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.65"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746609"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90141-9"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32512-0_20"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884524"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488703"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806753"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806772"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884486"},{"key":"e_1_3_2_1_17_1","volume-title":"SODA","author":"Sankowski P.","year":"2007","unstructured":"P. Sankowski . Faster dynamic matchings and vertex connectivity . In SODA , 2007 . P. Sankowski. Faster dynamic matchings and vertex connectivity. In SODA, 2007."},{"key":"e_1_3_2_1_18_1","first-page":"29","article-title":"The chromatic class of a multigraph","volume":"3","author":"Vizing V. G.","year":"1965","unstructured":"V. G. Vizing . The chromatic class of a multigraph . Kibernetika , 3 : 29 \u2013 39 , 1965 . V. G. Vizing. The chromatic class of a multigraph. Kibernetika, 3:29\u201339, 1965.","journal-title":"Kibernetika"}],"event":{"name":"STOC '16: Symposium on Theory of Computing","location":"Cambridge MA USA","acronym":"STOC '16","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897568","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897518.2897568","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:55:57Z","timestamp":1750208157000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897568"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,19]]},"references-count":18,"alternative-id":["10.1145\/2897518.2897568","10.1145\/2897518"],"URL":"https:\/\/doi.org\/10.1145\/2897518.2897568","relation":{},"subject":[],"published":{"date-parts":[[2016,6,19]]},"assertion":[{"value":"2016-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}