{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T18:58:49Z","timestamp":1778871529574,"version":"3.51.4"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030835071","type":"print"},{"value":"9783030835088","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-83508-8_34","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"471-484","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Upper and Lower Bounds for Fully Retroactive Graph Problems"],"prefix":"10.1007","author":[{"given":"Monika","family":"Henzinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaowei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"de Andrade J\u00fanior, J.W., Duarte Seabra, R.: Fully retroactive minimum spanning tree problem. Comput. J. (2020)","DOI":"10.1093\/comjnl\/bxaa135"},{"issue":"3","key":"34_CR2","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1137\/16M1106158","volume":"47","author":"S Baswana","year":"2018","unstructured":"Baswana, S., Gupta, M., Sen, S.: Fully dynamic maximal matching in o(log n) update time (corrected version). SIAM J. Comput. 47(3), 617\u2013650 (2018)","journal-title":"SIAM J. Comput."},{"key":"34_CR3","unstructured":"Bentley, J.L.: Algorithms for Klee\u2019s rectangle problems. Technical report, Computer (1977)"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Bernstein, A., Forster, S., Henzinger, M.: A deamortization approach for dynamic spanner and dynamic maximal matching. In: SODA, pp. 1899\u20131918. SIAM (2019)","DOI":"10.1137\/1.9781611975482.115"},{"key":"34_CR5","unstructured":"Blelloch, G.E.: Space-efficient dynamic orthogonal point location, segment intersection, and range reporting. In: SODA, pp. 894\u2013903. SIAM (2008)"},{"key":"34_CR6","unstructured":"Chen, L., Demaine, E.D., Gu, Y., Williams, V.V., Xu, Y., Yu, Y.: Nearly optimal separation between partially and fully retroactive data structures. In: SWAT. LIPIcs, vol. 101, pp. 33:1\u201333:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)"},{"issue":"2","key":"34_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/1240233.1240236","volume":"3","author":"ED Demaine","year":"2007","unstructured":"Demaine, E.D., Iacono, J., Langerman, S.: Retroactive data structures. ACM Trans. Algorithms 3(2), 13 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-319-21840-3_22","volume-title":"Algorithms and Data Structures","author":"ED Demaine","year":"2015","unstructured":"Demaine, E.D., Kaler, T., Liu, Q., Sidford, A., Yedidia, A.: Polylogarithmic fully retroactive priority queues via hierarchical checkpointing. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 263\u2013275. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21840-3_22"},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-642-15775-2_31","volume-title":"Algorithms \u2013 ESA 2010","author":"MT Dickerson","year":"2010","unstructured":"Dickerson, M.T., Eppstein, D., Goodrich, M.T.: Cloning voronoi diagrams via retroactive data structures. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 362\u2013373. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15775-2_31"},{"issue":"1","key":"34_CR10","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"JR Driscoll","year":"1989","unstructured":"Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. J. Comput. Syst. Sci. 38(1), 86\u2013124 (1989)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"34_CR11","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/S0196-6774(03)00044-0","volume":"48","author":"A Fiat","year":"2003","unstructured":"Fiat, A., Kaplan, H.: Making data structures confluently persistent. J. Algorithms 48(1), 16\u201358 (2003)","journal-title":"J. Algorithms"},{"key":"34_CR12","unstructured":"Galperin, I., Rivest, R.L.: Scapegoat trees. In: SODA, pp. 165\u2013174. ACM\/SIAM (1993)"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Giyora, Y., Kaplan, H.: Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. ACM Trans. Algorithms 5(3), 28:1\u201328:51 (2009)","DOI":"10.1145\/1541885.1541889"},{"key":"34_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-25591-5_31","volume-title":"Algorithms and Computation","author":"MT Goodrich","year":"2011","unstructured":"Goodrich, M.T., Simons, J.A.: Fully retroactive approximate range and nearest neighbor searching. In: Asano, T., Nakano, S., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol. 7074, pp. 292\u2013301. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25591-5_31"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Henzinger, M., Krinninger, S., Nanongkai, D., Saranurak, T.: Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In: STOC, pp. 21\u201330. ACM (2015)","DOI":"10.1145\/2746539.2746609"},{"key":"34_CR16","unstructured":"Henzinger, M., Wu, X.: Upper and lower bounds for fully retroactive graph problems. arXiv preprint arXiv:1910.03332 (2019)"},{"issue":"4","key":"34_CR17","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1145\/320211.320215","volume":"46","author":"MR Henzinger","year":"1999","unstructured":"Henzinger, M.R., King, V.: Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM 46(4), 502\u2013516 (1999)","journal-title":"J. ACM"},{"issue":"2","key":"34_CR18","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/S0097539797327209","volume":"31","author":"MR Henzinger","year":"2001","unstructured":"Henzinger, M.R., King, V.: Maintaining minimum spanning forests in dynamic graphs. SIAM J. Comput. 31(2), 364\u2013374 (2001)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"34_CR19","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J Holm","year":"2001","unstructured":"Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48(4), 723\u2013760 (2001)","journal-title":"J. ACM"},{"key":"34_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1007\/978-3-662-48350-3_62","volume-title":"Algorithms \u2013 ESA 2015","author":"J Holm","year":"2015","unstructured":"Holm, J., Rotenberg, E., Wulff-Nilsen, C.: Faster fully-dynamic minimum spanning forest. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 742\u2013753. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_62"},{"key":"34_CR21","unstructured":"Parsa, S.: Algorithms for the reeb graph and related concepts. Ph.D. thesis, Duke University (2014)"},{"issue":"4","key":"34_CR22","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1137\/S0097539705447256","volume":"35","author":"M Patrascu","year":"2006","unstructured":"Patrascu, M., Demaine, E.D.: Logarithmic lower bounds in the cell-probe model. SIAM J. Comput. 35(4), 932\u2013963 (2006)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"34_CR23","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1137\/13093618X","volume":"45","author":"L Roditty","year":"2016","unstructured":"Roditty, L., Zwick, U.: A fully dynamic reachability algorithm for directed graphs with an almost linear update time. SIAM J. Comput. 45(3), 712\u2013733 (2016)","journal-title":"SIAM J. Comput."},{"key":"34_CR24","volume-title":"Algorithms","author":"R Sedgewick","year":"1983","unstructured":"Sedgewick, R.: Algorithms. Addison-Wesley, Boston (1983)"},{"issue":"3","key":"34_CR25","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"DD Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. Syst. Sci. 26(3), 362\u2013391 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"34_CR26","doi-asserted-by":"crossref","unstructured":"Solomon, S.: Fully dynamic maximal matching in constant update time. In: FOCS, pp. 325\u2013334. IEEE Computer Society (2016)","DOI":"10.1109\/FOCS.2016.43"},{"issue":"2","key":"34_CR27","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"RE Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM 22(2), 215\u2013225 (1975)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:28:38Z","timestamp":1645183718000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"123","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}