{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:06:07Z","timestamp":1743141967179,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819705658"},{"type":"electronic","value":"9789819705665"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-0566-5_20","type":"book-chapter","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T12:03:28Z","timestamp":1709121808000},"page":"273-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Stable and\u00a0Dynamic Minimum Cuts"],"prefix":"10.1007","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[]},{"given":"Andr\u00e9s","family":"L\u00f3pez Mart\u00ednez","sequence":"additional","affiliation":[]},{"given":"Frits","family":"Spieksma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"key":"20_CR1","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New York (1993)"},{"key":"20_CR2","unstructured":"de Berg, M., Sadhukhan, A., Spieksma, F.: Stable approximation algorithms for the dynamic broadcast range-assignment problem. In: 18th Scandinavian Symposium and Workshops on Algorithm Theory, pp. 15:1\u201315:21 (2022)"},{"key":"20_CR3","unstructured":"de Berg, M., Sadhukhan, A., Spieksma, F.: Stable approximation algorithms for dominating set and independent set. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2023), pp. 27:1\u201327:19 (2023)"},{"key":"20_CR4","unstructured":"Bernstein, A., Dudeja, A.: Online matching with recourse: random edge arrivals. In: 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020), pp. 11:1\u201311:16 (2020)"},{"key":"20_CR5","unstructured":"Feldkord, B., et al.: Fully-dynamic bin packing with little repacking. In: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), pp. 51:1\u201351:24 (2018)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Goranci, G., Henzinger, M., Nanongkai, D., Saranurak, T., Thorup, M., Wulff-Nilsen, C.: Fully dynamic exact edge connectivity in sublinear time. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 70\u201386. SIAM (2023)","DOI":"10.1137\/1.9781611977554.ch3"},{"issue":"2","key":"20_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3174803","volume":"14","author":"G Goranci","year":"2018","unstructured":"Goranci, G., Henzinger, M., Thorup, M.: Incremental exact min-cut in polylogarithmic amortized update time. ACM Trans. Algorithms (TALG) 14(2), 1\u201321 (2018)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Gu, A., Gupta, A., Kumar, A.: The power of deferral: maintaining a constant-competitive steiner tree online. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing, pp. 525\u2013534 (2013)","DOI":"10.1145\/2488608.2488674"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kumar, A., Stein, C.: Maintaining assignments online: matching, scheduling, and flows. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 468\u2013479. SIAM (2014)","DOI":"10.1137\/1.9781611973402.35"},{"key":"20_CR10","doi-asserted-by":"publisher","unstructured":"Han, X., Makino, K.: Online minimization knapsack problem. In: Bampis, E., Jansen, K. (eds.) Approximation and Online Algorithms. WAOA 2009. LNCS, vol. 5893, pp. 182\u2013193. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12450-1_17","DOI":"10.1007\/978-3-642-12450-1_17"},{"issue":"3","key":"20_CR11","doi-asserted-by":"publisher","first-page":"417","DOI":"10.7155\/jgaa.00232","volume":"15","author":"M Hasheminezhad","year":"2011","unstructured":"Hasheminezhad, M., McKay, B.D., Reeves, T.: Recursive generation of simple planar 5-regular graphs and pentangulations. J. Graph Algorithms Appl. 15(3), 417\u2013436 (2011)","journal-title":"J. Graph Algorithms Appl."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Henzinger, M., Noe, A., Schulz, C.: Practical fully dynamic minimum cut algorithms. In: Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), pp. 13\u201326 (2022)","DOI":"10.1137\/1.9781611977042.2"},{"issue":"3","key":"20_CR13","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1137\/0404033","volume":"4","author":"M Imase","year":"1991","unstructured":"Imase, M., Waxman, B.M.: Dynamic steiner tree problem. SIAM J. Discret. Math. 4(3), 369\u2013384 (1991)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"20_CR14","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1137\/130917703","volume":"45","author":"N Megow","year":"2016","unstructured":"Megow, N., Skutella, M., Verschae, J., Wiese, A.: The power of recourse for online MST and TSP. SIAM J. Comput. 45(3), 859\u2013880 (2016)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"20_CR15","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00493-007-0045-2","volume":"27","author":"M Thorup","year":"2007","unstructured":"Thorup, M.: Fully-dynamic min-cut. Combinatorica 27(1), 91\u2013127 (2007)","journal-title":"Combinatorica"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Thorup, M., Karger, D.R.: Dynamic graph algorithms with applications. In: Scandinavian Workshop on Algorithm Theory, pp. 1\u20139 (2000)","DOI":"10.1007\/3-540-44985-X_1"},{"key":"20_CR17","unstructured":"Wasim, O., King, V.: Fully dynamic sequential and distributed algorithms for max-cut. In: 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020), pp. 33:1\u201333:19 (2020)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0566-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T16:09:18Z","timestamp":1709654958000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0566-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819705658","9789819705665"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0566-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kanazawa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.walcom-conference.org\/","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":"80","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":"28","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":"35% - 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","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":"1","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)"}}]}}