{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,24]],"date-time":"2026-05-24T06:05:04Z","timestamp":1779602704334,"version":"3.53.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032264640","type":"print"},{"value":"9783032264657","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-26465-7_6","type":"book-chapter","created":{"date-parts":[[2026,5,24]],"date-time":"2026-05-24T05:48:18Z","timestamp":1779601698000},"page":"93-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Bisection with\u00a0Ring Demands"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-0210-6451","authenticated-orcid":false,"given":"Mateusz","family":"Basiak","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2453-7772","authenticated-orcid":false,"given":"Marcin","family":"Bienkowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5407-330X","authenticated-orcid":false,"given":"Guy","family":"Even","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-3849-9165","authenticated-orcid":false,"given":"Agnieszka","family":"Tatarczuk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,24]]},"reference":[{"issue":"6","key":"6_CR1","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/s00224-006-1350-7","volume":"39","author":"K Andreev","year":"2006","unstructured":"Andreev, K., R\u00e4cke, H.: Balanced graph partitioning. Theory Comput. Syst. 39(6), 929\u2013939 (2006). https:\/\/doi.org\/10.1007\/s00224-006-1350-7","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/jcss.1998.1605","volume":"58","author":"S Arora","year":"1999","unstructured":"Arora, S., Karger, D.R., Karpinski, M.: Polynomial time approximation schemes for dense instances of NP-hard problems. J. Comput. Syst. Sci. 58(1), 193\u2013210 (1999). https:\/\/doi.org\/10.1006\/jcss.1998.1605","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1791","DOI":"10.1137\/17M1158513","volume":"34","author":"C Avin","year":"2020","unstructured":"Avin, C., Bienkowski, M., Loukas, A., Pacut, M., Schmid, S.: Dynamic balanced graph partitioning. SIAM J. Discret. Math. 34(3), 1791\u20131812 (2020). https:\/\/doi.org\/10.1137\/17M1158513","journal-title":"SIAM J. Discret. Math."},{"issue":"9","key":"6_CR4","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.1007\/S00607-018-0666-X","volume":"101","author":"C Avin","year":"2019","unstructured":"Avin, C., Cohen, L., Parham, M., Schmid, S.: Competitive clustering of stochastic communication patterns on a ring. Computing 101(9), 1369\u20131390 (2019). https:\/\/doi.org\/10.1007\/S00607-018-0666-X","journal-title":"Computing"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Avin, C., Loukas, A., Pacut, M., Schmid, S.: Online balanced repartitioning. In: Proceedings of 30th International Symposium on Distributed Computing (DISC), pp. 243\u2013256 (2016). https:\/\/doi.org\/10.1007\/978-3-662-53426-7_18","DOI":"10.1007\/978-3-662-53426-7_18"},{"issue":"7","key":"6_CR6","doi-asserted-by":"publisher","first-page":"2001","DOI":"10.1007\/S00453-022-01076-X","volume":"85","author":"Y Azar","year":"2023","unstructured":"Azar, Y., Machluf, C., Patt-Shamir, B., Touitou, N.: Competitive vertex recoloring. Algorithmica 85(7), 2001\u20132027 (2023). https:\/\/doi.org\/10.1007\/S00453-022-01076-X","journal-title":"Algorithmica"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Bienkowski, M., B\u00f6hm, M., Kouteck\u00fd, M., Rothvo\u00df, T., Sgall, J., Vesel\u00fd, P.: Improved analysis of online balanced clustering. In: Proceedings of 19th Workshop on Approximation and Online Algorithms (WAOA), pp. 224\u2013233 (2021). https:\/\/doi.org\/10.1007\/978-3-030-92702-8_14","DOI":"10.1007\/978-3-030-92702-8_14"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Bienkowski, M., Even, G.: An improved approximation algorithm for dynamic minimum linear arrangement. In: Proceedings of 41st Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs, vol.\u00a0289, pp. 15:1\u201315:19. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.STACS.2024.15","DOI":"10.4230\/LIPICS.STACS.2024.15"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Bienkowski, M., Schmid, S.: A subquadratic bound for online bisection. In: Proceedings of 41st Symposium on Theoretical Aspects of Computer Science (STACS), pp. 14:1\u201314:18. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.STACS.2024.14","DOI":"10.4230\/LIPICS.STACS.2024.14"},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1145\/146585.146588","volume":"39","author":"A Borodin","year":"1992","unstructured":"Borodin, A., Linial, N., Saks, M.E.: An optimal on-line algorithm for metrical task system. J. ACM 39(4), 745\u2013763 (1992). https:\/\/doi.org\/10.1145\/146585.146588","journal-title":"J. ACM"},{"key":"6_CR11","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Bubeck, S., Cohen, M.B., Lee, J.R., Lee, Y.T.: Metrical task systems on trees via mirror descent and unfair gluing. In: Proceedings of 30th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 89\u201397. SIAM (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.6","DOI":"10.1137\/1.9781611975482.6"},{"issue":"6","key":"6_CR13","doi-asserted-by":"publisher","first-page":"2187","DOI":"10.1137\/S0097539796308217","volume":"28","author":"G Even","year":"1999","unstructured":"Even, G., Naor, J., Rao, S., Schieber, B.: Fast approximate graph partitioning algorithms. SIAM J. Comput. 28(6), 2187\u20132214 (1999). https:\/\/doi.org\/10.1137\/S0097539796308217","journal-title":"SIAM J. Comput."},{"issue":"4","key":"6_CR14","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1137\/S0097539701387660","volume":"31","author":"U Feige","year":"2002","unstructured":"Feige, U., Krauthgamer, R.: A polylogarithmic approximation of the minimum bisection. SIAM J. Comput. 31(4), 1090\u20131118 (2002). https:\/\/doi.org\/10.1137\/S0097539701387660","journal-title":"SIAM J. Comput."},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Feige, U., Krauthgamer, R., Nissim, K.: Approximating the minimum bisection size. In: Proceedings of 32nd ACM Symposium on Theory of Computing (STOC), pp. 530\u2013536 (2000). https:\/\/doi.org\/10.1145\/335305.335370","DOI":"10.1145\/335305.335370"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Forner, T., R\u00e4cke, H., Schmid, S.: Online balanced repartitioning of dynamic communication patterns in polynomial time. In: 2nd Symposium on Algorithmic Principles of Computer Systems (APOCS), pp. 40\u201354 (2021). https:\/\/doi.org\/10.1137\/1.9781611976489.4","DOI":"10.1137\/1.9781611976489.4"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Henzinger, M., Neumann, S., R\u00e4cke, H., Schmid, S.: Tight bounds for online graph partitioning. In: Proceedings of 32nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2799\u20132818 (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.166","DOI":"10.1137\/1.9781611976465.166"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Henzinger, M., Neumann, S., Schmid, S.: Efficient distributed workload (re-)embedding. In: Proc. SIGMETRICS\/Performance Joint International Conference on Measurement and Modeling of Computer Systems, pp. 43\u201344 (2019). https:\/\/doi.org\/10.1145\/3309697.3331503","DOI":"10.1145\/3309697.3331503"},{"issue":"1","key":"6_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/050640904","volume":"48","author":"R Krauthgamer","year":"2006","unstructured":"Krauthgamer, R., Feige, U.: A polylogarithmic approximation of the minimum bisection. SIAM Rev. 48(1), 99\u2013130 (2006). https:\/\/doi.org\/10.1137\/050640904","journal-title":"SIAM Rev."},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Krauthgamer, R., Naor, J., Schwartz, R.: Partitioning graphs into balanced components. In: Proceedings of 20th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 942\u2013949 (2009). https:\/\/doi.org\/10.1137\/1.9781611973068.102","DOI":"10.1137\/1.9781611973068.102"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Olver, N., Pruhs, K., Schewior, K., Sitters, R., Stougie, L.: The itinerant list update problem. In: Proceedings of 16th Workshop on Approximation and Online Algorithms (WAOA), pp. 310\u2013326 (2018). https:\/\/doi.org\/10.1007\/978-3-030-04693-4_19","DOI":"10.1007\/978-3-030-04693-4_19"},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Pacut, M., Parham, M., Schmid, S.: Brief announcement: deterministic lower bound for dynamic balanced graph partitioning. In: Proceedings of 39th ACM Symposium on Principles of Distributed Computing (PODC), pp. 461\u2013463 (2020). https:\/\/doi.org\/10.1145\/3382734.3405696","DOI":"10.1145\/3382734.3405696"},{"key":"6_CR23","doi-asserted-by":"publisher","unstructured":"Pacut, M., Parham, M., Schmid, S.: Optimal online balanced graph partitioning. In: Proceedings of 40th IEEE International Conference on Computer Communications (INFOCOM), pp.\u00a01\u20139 (2021). https:\/\/doi.org\/10.1109\/INFOCOM42981.2021.9488824","DOI":"10.1109\/INFOCOM42981.2021.9488824"},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Patt-Shamir, B., Ros\u00e9n, A., Umboh, S.W.: Colorful vertex recoloring of bipartite graphs. In: Proceedings of 42nd Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs, vol.\u00a0327, pp. 70:1\u201370:19. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2025). https:\/\/doi.org\/10.4230\/LIPICS.STACS.2025.70","DOI":"10.4230\/LIPICS.STACS.2025.70"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"R\u00e4cke, H.: Optimal hierarchical decompositions for congestion minimization in networks. In: Proceedings of 40th ACM Symposium on Theory of Computing (STOC), pp. 255\u2013264 (2008). https:\/\/doi.org\/10.1145\/1374376.1374415","DOI":"10.1145\/1374376.1374415"},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"R\u00e4cke, H., Schmid, S., Zabrodin, R.: Approximate dynamic balanced graph partitioning. In: Proceedings of 34th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pp. 401\u2013409. ACM (2022). https:\/\/doi.org\/10.1145\/3490148.3538563","DOI":"10.1145\/3490148.3538563"},{"key":"6_CR27","doi-asserted-by":"publisher","unstructured":"R\u00e4cke, H., Schmid, S., Zabrodin, R.: Polylog-competitive algorithms for dynamic balanced graph partitioning for ring demands. In: Proceedings of 35th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 403\u2013413. ACM (2023). https:\/\/doi.org\/10.1145\/3558481.3591097","DOI":"10.1145\/3558481.3591097"},{"key":"6_CR28","doi-asserted-by":"publisher","unstructured":"R\u00e4cke, H., Schmid, S., Zabrodin, R.: Tight bounds for online balanced partitioning in the generalized learning model. In: Proceedings of 37th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 240\u2013254. ACM (2025). https:\/\/doi.org\/10.1145\/3694906.3743327","DOI":"10.1145\/3694906.3743327"},{"key":"6_CR29","doi-asserted-by":"publisher","unstructured":"Rajaraman, R., Wasim, O.: Improved bounds for online balanced graph re-partitioning. In: Proceedings of 30th European Symposium on Algorithms (ESA), pp. 83:1\u201383:15 (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2022.83","DOI":"10.4230\/LIPIcs.ESA.2022.83"},{"key":"6_CR30","doi-asserted-by":"publisher","unstructured":"Rajaraman, R., Wasim, O.: Competitive capacitated online recoloring. In: Proceedings of 32nd European Symposium on Algorithms (ESA). LIPIcs, vol.\u00a0308, pp. 95:1\u201395:17. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.ESA.2024.95","DOI":"10.4230\/LIPICS.ESA.2024.95"},{"issue":"1","key":"6_CR31","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1137\/S0097539792251730","volume":"24","author":"H Saran","year":"1995","unstructured":"Saran, H., Vazirani, V.V.: Finding k cuts within twice the optimal. SIAM J. Comput. 24(1), 101\u2013108 (1995). https:\/\/doi.org\/10.1137\/S0097539792251730","journal-title":"SIAM J. Comput."},{"key":"6_CR32","unstructured":"Sergeev, A., Balso, M.D.: Horovod: fast and easy distributed deep learning in tensorflow (2018), unpublished"},{"issue":"5","key":"6_CR33","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.1137\/S1064827593255135","volume":"18","author":"HD Simon","year":"1997","unstructured":"Simon, H.D., Teng, S.: How good is recursive bisection? SIAM J. Comput. 18(5), 1436\u20131445 (1997). https:\/\/doi.org\/10.1137\/S1064827593255135","journal-title":"SIAM J. Comput."},{"issue":"2","key":"6_CR34","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985). https:\/\/doi.org\/10.1145\/2786.2793","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-26465-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,24]],"date-time":"2026-05-24T05:48:20Z","timestamp":1779601700000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26465-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032264640","9783032264657"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26465-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"24 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Durham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2026.webspace.durham.ac.uk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}