{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T04:21:00Z","timestamp":1752985260178,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"German Research Foundation (DFG)","award":["470029389"],"award-info":[{"award-number":["470029389"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,11]]},"DOI":"10.1145\/3490148.3538563","type":"proceedings-article","created":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T22:10:15Z","timestamp":1657491015000},"page":"401-409","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximate Dynamic Balanced Graph Partitioning"],"prefix":"10.1145","author":[{"given":"Harald","family":"R\u00e4cke","sequence":"first","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"Technical University of Berlin & University of Vienna, Berlin, Germany"}]},{"given":"Ruslan","family":"Zabrodin","sequence":"additional","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}]}],"member":"320","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1350-7"},{"key":"e_1_3_2_1_2_1","series-title":"SIAM J. Discrete Math (SIDMA).","volume-title":"Dynamic Balanced Graph Partitioning","author":"Avin Chen","unstructured":"Chen Avin , Marcin Bienkowski , Andreas Loukas , Maciej Pacut , and Stefan Schmid . 2019. Dynamic Balanced Graph Partitioning . In SIAM J. Discrete Math (SIDMA). Chen Avin, Marcin Bienkowski, Andreas Loukas, Maciej Pacut, and Stefan Schmid. 2019. Dynamic Balanced Graph Partitioning. In SIAM J. Discrete Math (SIDMA)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Chen Avin Louis Cohen Mahmoud Parham and Stefan Schmid. 2018. Competitive Clustering of Stochastic Communication Patterns on a Ring. In Journal of Computing.  Chen Avin Louis Cohen Mahmoud Parham and Stefan Schmid. 2018. Competitive Clustering of Stochastic Communication Patterns on a Ring. In Journal of Computing.","DOI":"10.1007\/s00607-018-0666-x"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59647-1_18"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3393691.3394205"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53426-7_18"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1996.548477"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276725"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1672308.1672325"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Marcin Bienkowski Martin B\u00f6hm Martin Kouteck\u00fd Thomas Rothvo\u00df Ji\u00ed Sgall and Pavel Vesel\u00fd. 2021. Improved Analysis of Online Balanced Clustering. arXiv:2107.00145 [cs.DS]  Marcin Bienkowski Martin B\u00f6hm Martin Kouteck\u00fd Thomas Rothvo\u00df Ji\u00ed Sgall and Pavel Vesel\u00fd. 2021. Improved Analysis of Online Balanced Clustering. arXiv:2107.00145 [cs.DS]","DOI":"10.1007\/978-3-030-92702-8_14"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796308217"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347478"},{"key":"e_1_3_2_1_13_1","first-page":"1","article-title":"Fully-Dynamic Bin Packing with Little Repacking","volume":"51","author":"Feldkord Bj\u00f6rn","year":"2018","unstructured":"Bj\u00f6rn Feldkord , Matthias Feldotto , Anupam Gupta , Guru Guruganesh , Amit Kumar , S\u00f6ren Riechers , and David Wajc . 2018 . Fully-Dynamic Bin Packing with Little Repacking . In ICALP. 51 : 1 -- 51 :24. Bj\u00f6rn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, S\u00f6ren Riechers, and David Wajc. 2018. Fully-Dynamic Bin Packing with Little Repacking. In ICALP. 51:1--51:24.","journal-title":"ICALP."},{"key":"e_1_3_2_1_14_1","first-page":"100","article-title":"Balanced Partitions of Trees and Applications","volume":"71","author":"Feldmann Andreas","year":"2012","unstructured":"Andreas Feldmann and Luca Foschini . 2012 . Balanced Partitions of Trees and Applications . Algorithmica 71 , 100 -- 111 . https:\/\/doi.org\/10.1007\/s00453-013- 9802--3 10.1007\/s00453-013- Andreas Feldmann and Luca Foschini. 2012. Balanced Partitions of Trees and Applications. Algorithmica 71, 100--111. https:\/\/doi.org\/10.1007\/s00453-013- 9802--3","journal-title":"Algorithmica"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9802-3"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90041-V"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976489.4"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.166"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3309697.3331503"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/7531.7535"},{"key":"e_1_3_2_1_21_1","first-page":"4","article-title":"SIGACT News Online Algorithms Column 38: 2021 in Review","volume":"52","author":"Hohne Felix","year":"2022","unstructured":"Felix Hohne , Soren Schmitt , and Rob van Stee . 2022 . SIGACT News Online Algorithms Column 38: 2021 in Review . SIGACT News 52 , 4 (jan 2022), 80--96. https:\/\/doi.org\/10.1145\/3510382.3510396 10.1145\/3510382.3510396 Felix Hohne, Soren Schmitt, and Rob van Stee. 2022. SIGACT News Online Algorithms Column 38: 2021 in Review. SIGACT News 52, 4 (jan 2022), 80--96. https:\/\/doi.org\/10.1145\/3510382.3510396","journal-title":"SIGACT News"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644918"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/210118.210128"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.102"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62243"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90003-W"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488824"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1090.0381"}],"event":{"name":"SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Philadelphia PA USA","acronym":"SPAA '22"},"container-title":["Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538563","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538563","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:08Z","timestamp":1750191128000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538563"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":28,"alternative-id":["10.1145\/3490148.3538563","10.1145\/3490148"],"URL":"https:\/\/doi.org\/10.1145\/3490148.3538563","relation":{},"subject":[],"published":{"date-parts":[[2022,7,11]]},"assertion":[{"value":"2022-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}