{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:05:52Z","timestamp":1781028352044,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2329230"],"award-info":[{"award-number":["CCF-2329230"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-1955703"],"award-info":[{"award-number":["CCF-1955703"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003062","name":"European Research Council","doi-asserted-by":"publisher","award":["101170133"],"award-info":[{"award-number":["101170133"]}],"id":[{"id":"10.13039\/501100003062","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800805","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"910-921","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fully Dynamic Set Cover: Worst-Case Recourse and Update Time"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1612-0296","authenticated-orcid":false,"given":"Sayan","family":"Bhattacharya","sequence":"first","affiliation":[{"name":"University of Warwick, Coventry, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-3900-2344","authenticated-orcid":false,"given":"Ruoxu","family":"Cen","sequence":"additional","affiliation":[{"name":"Duke University, Durham, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1799-6660","authenticated-orcid":false,"given":"Debmalya","family":"Panigrahi","sequence":"additional","affiliation":[{"name":"Duke University, Durham, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316376"},{"key":"e_1_3_2_1_2_1","volume-title":"45th International Colloquium on Automata, Languages, and Programming (ICALP) (LIPIcs","volume":"16","author":"Arar Moab","year":"2018","unstructured":"Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, and David Wajc. 2018. Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. In 45th International Colloquium on Automata, Languages, and Programming (ICALP) (LIPIcs, Vol. 107). 7:1\u20137:16."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.96"},{"key":"e_1_3_2_1_4_1","volume-title":"29th Annual European Symposium on Algorithms (ESA) (LIPIcs","volume":"18","author":"Assadi Sepehr","year":"2021","unstructured":"Sepehr Assadi and Shay Solomon. 2021. Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. In 29th Annual European Symposium on Algorithms (ESA) (LIPIcs, Vol. 204). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 8:1\u20138:18."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.89"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch6"},{"key":"e_1_3_2_1_7_1","volume-title":"Fully Dynamic Matching and Ordered Ruzsa-Szemer\u00e9di Graphs. In 65th IEEE Annual Symposium on Foundations of Computer Science (FOCS). 314\u2013327","author":"Behnezhad Soheil","year":"2024","unstructured":"Soheil Behnezhad and Alma Ghafari. 2024. Fully Dynamic Matching and Ordered Ruzsa-Szemer\u00e9di Graphs. In 65th IEEE Annual Symposium on Foundations of Computer Science (FOCS). 314\u2013327."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451113"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884485"},{"key":"e_1_3_2_1_10_1","volume-title":"Friedrich Eisenbrand and Jochen K\u00f6nemann (Eds.) (Lecture Notes in Computer Science","volume":"98","author":"Bhattacharya Sayan","year":"2017","unstructured":"Sayan Bhattacharya, Deeparnab Chakrabarty, and Monika Henzinger. 2017. Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time. In Integer Programming and Combinatorial Optimization - 19th International Conference (IPCO), Friedrich Eisenbrand and Jochen K\u00f6nemann (Eds.) (Lecture Notes in Computer Science, Vol. 10328). 86\u201398."},{"key":"e_1_3_2_1_11_1","volume-title":"42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I (Lecture Notes in Computer Science","volume":"218","author":"Bhattacharya Sayan","unstructured":"Sayan Bhattacharya, Monika Henzinger, and Giuseppe F. Italiano. 2015. Design of Dynamic Algorithms via Primal-Dual Method. In Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I (Lecture Notes in Computer Science, Vol. 9134). 206\u2013218."},{"key":"e_1_3_2_1_12_1","volume-title":"Italiano","author":"Bhattacharya Sayan","year":"2015","unstructured":"Sayan Bhattacharya, Monika Henzinger, and Giuseppe F. Italiano. 2015. Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 785\u2013804."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039716"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00033"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.150"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.113"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.24"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591884"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055493"},{"key":"e_1_3_2_1_21_1","volume-title":"18th Annual IEEE Conference on Computational Complexity (CCC). 379","author":"Khot Subhash","year":"2003","unstructured":"Subhash Khot and Oded Regev. 2003. Vertex Cover Might be Hard to Approximate to within 2-\u03b5. In 18th Annual IEEE Conference on Computational Complexity (CCC). 379."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488703"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806753"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585211"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS61266.2024.00025"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384258"},{"key":"e_1_3_2_1_27_1","volume-title":"Shmoys","author":"Williamson David P.","year":"2011","unstructured":"David P. Williamson and David B. Shmoys. 2011. The Design of Approximation Algorithms. Cambridge University Press."}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800805","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800805","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:56:24Z","timestamp":1781027784000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800805"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":27,"alternative-id":["10.1145\/3798129.3800805","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800805","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}