{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:31:43Z","timestamp":1782970303928,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"European Research Council","doi-asserted-by":"publisher","award":["882500"],"award-info":[{"award-number":["882500"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3626183.3660257","type":"proceedings-article","created":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T18:23:04Z","timestamp":1717525384000},"page":"443-445","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3330-9349","authenticated-orcid":false,"given":"Peter","family":"Sanders","sequence":"first","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1997-1304","authenticated-orcid":false,"given":"Daniel","family":"Seemaier","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"\u00c7ataly\u00fcrek et al","author":"V.","year":"2022","unstructured":"\u00dc. V. \u00c7ataly\u00fcrek et al. 2022. More Recent Advances in (Hyper)Graph Partitioning. ACM Comput. Surv. (2022)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2007.12.001"},{"key":"e_1_3_2_1_3_1","volume-title":"19th Design Automation Conf., (DAC). ACM\/IEEE, 175--181","author":"Fiduccia C. M.","unstructured":"C. M. Fiduccia and R. M. Mattheyses. 1982. A linear-time heuristic for improving network partitions. In 19th Design Automation Conf., (DAC). ACM\/IEEE, 175--181."},{"key":"e_1_3_2_1_4_1","volume-title":"Jet: Multilevel Graph Partitioning on GPUs. CoRR abs\/2304.13194","author":"Gilbert M. S.","year":"2023","unstructured":"M. S. Gilbert, K. Madduri, E. G. Boman, and S. Rajamanickam. 2023. Jet: Multilevel Graph Partitioning on GPUs. CoRR abs\/2304.13194 (2023). arXiv:2304.13194"},{"key":"e_1_3_2_1_5_1","volume-title":"Scalable Shared-Memory Hypergraph Partitioning. In ALENEX","author":"Gottesb\u00fcren L.","year":"2021","unstructured":"L. Gottesb\u00fcren, T. Heuer, P. Sanders, and S. Schlag. 2021. Scalable Shared-Memory Hypergraph Partitioning. In ALENEX 2021. SIAM, 16--30."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977929.3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2671868"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"P. Sanders and D. Seemaier. 2023. Distributed Deep Multilevel Graph Partitioning. In Euro-Par 2023: Parallel Processing. Springer Nature Switzerland 443--457.","DOI":"10.1007\/978-3-031-39698-4_30"}],"event":{"name":"SPAA '24: 36th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Nantes France","acronym":"SPAA '24","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"]},"container-title":["Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3660257","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626183.3660257","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:23:37Z","timestamp":1755879817000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3660257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":9,"alternative-id":["10.1145\/3626183.3660257","10.1145\/3626183"],"URL":"https:\/\/doi.org\/10.1145\/3626183.3660257","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}