{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T18:44:11Z","timestamp":1783536251741,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T00:00:00Z","timestamp":1783296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["204817"],"award-info":[{"award-number":["204817"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001711","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["470857344"],"award-info":[{"award-number":["470857344"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,6]]},"DOI":"10.1145\/3816782.3819184","type":"proceedings-article","created":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T17:28:33Z","timestamp":1783531713000},"page":"482-485","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Direction-Incentivized Spectral Partitioning for Acyclic Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8580-1023","authenticated-orcid":false,"given":"Dimosthenis","family":"Pasadakis","sequence":"first","affiliation":[{"name":"Institute of Computing, Universit\u00e0 della Svizzera italiana (USI), Lugano, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8391-8949","authenticated-orcid":false,"given":"Raphael S.","family":"Steiner","sequence":"additional","affiliation":[{"name":"Computing Systems Lab, Huawei Research Center Zurich, Z\u00fcrich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-6667-802X","authenticated-orcid":false,"given":"P\u00e1l Andr\u00e1s","family":"Papp","sequence":"additional","affiliation":[{"name":"Computing Systems Lab, Huawei Research Center Zurich, Z\u00fcrich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2152-022X","authenticated-orcid":false,"given":"Toni","family":"B\u00f6hnlein","sequence":"additional","affiliation":[{"name":"Computing Systems Lab, Huawei Research Center Zurich, Z\u00fcrich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8842-3689","authenticated-orcid":false,"given":"Albert-Jan N.","family":"Yzelman","sequence":"additional","affiliation":[{"name":"Computing Systems Lab, Huawei Research Center Zurich, Z\u00fcrich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.20130456"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312049"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579166"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90092-9"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2012.12.002"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553385"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49487-6_4"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3571808"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/568547.568553"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/196244.196609"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2541228.2555309"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the 19th Design Automation Conference (DAC '82)","author":"Fiduccia C. M.","unstructured":"C. M. Fiduccia and R. M. Mattheyses. 1982. A linear-time heuristic for improving network partitions. In Proceedings of the 19th Design Automation Conference (DAC '82). IEEE Press, 175\u2013181."},{"key":"e_1_3_2_1_14_1","volume-title":"Algebraic connectivity of graphs. Czechoslovak mathematical journal 23, 2","author":"Fiedler Miroslav","year":"1973","unstructured":"Miroslav Fiedler. 1973. Algebraic connectivity of graphs. Czechoslovak mathematical journal 23, 2 (1973), 298\u2013305."},{"key":"e_1_3_2_1_15_1","volume-title":"Algorithms for graph partitioning: a survey","author":"Fj\u00e4llstr\u00f6m Per-Olof","unstructured":"Per-Olof Fj\u00e4llstr\u00f6m. 1998. Algorithms for graph partitioning: a survey. Link\u00f6ping University Electronic Press."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/800119.803884"},{"key":"e_1_3_2_1_17_1","volume-title":"Hierarchical directed spectral graph partitioning MS&E 337. Information Networks","author":"Gleich David","year":"2006","unstructured":"David Gleich. 2006. Hierarchical directed spectral graph partitioning MS&E 337. Information Networks (2006), 24."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData55660.2022.10020413"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2017.101"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1176865"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/321623.321627"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/3495724.3495804"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SEA.2017.30"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205464"},{"key":"e_1_3_2_1_25_1","unstructured":"Maxim Naumov and Timothy Moon. 2016. Parallel Spectral Graph Partitioning. Technical Report NVR-2016-001. NVIDIA."},{"key":"e_1_3_2_1_26_1","volume-title":"PPAM 2019-13th International Conference on Parallel Processing and Applied Mathematics.","author":"\u00d6zkaya Yusuf M.","year":"2019","unstructured":"Yusuf M. \u00d6zkaya, Anne Benoit, and \u00dcmit V. \u00c7ataly\u00fcrek. 2019. Is acyclic directed graph partitioning effective for locality-aware scheduling?. In PPAM 2019-13th International Conference on Parallel Processing and Applied Mathematics."},{"key":"e_1_3_2_1_27_1","unstructured":"P\u00e1l Andr\u00e1s Papp Georg Anegg Aikaterini Karanasiou and Albert-Jan N. Yzelman. 2022. HyperDAG_DB. https:\/\/github.com\/Algebraic-Programming\/HyperDAG_DB."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3626183.3659972"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2605.26975"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2508.16173"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976472.1"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071204"},{"key":"e_1_3_2_1_33_1","volume-title":"Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, September 15\u201317","author":"Schamberger Stefan","year":"2004","unstructured":"Stefan Schamberger and Jens-Michael Wierum. 2004. A Locality Preserving Graph Ordering Approach for Implicit Partitioning: Graph-Filing Curves. In Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, September 15\u201317, 2004, The Canterbury Hotel, San Francisco, California, USA, David A. Bader and Ashfaq A. Khokhar (Eds.). ISCA, 51\u201357."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3218176.3218232"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90067-9"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cny011"},{"key":"e_1_3_2_1_37_1","volume-title":"Spectral Clustering for Directed Graphs via Likelihood Estimation on Stochastic Block Models. Preprint","author":"Zhang Ning","year":"2025","unstructured":"Ning Zhang, Xiaowen Dong, and Mihai Cucuringu. 2025. Spectral Clustering for Directed Graphs via Likelihood Estimation on Stochastic Block Models. Preprint (2025). arXiv:2403.19516."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102482"}],"event":{"name":"SPAA '26: 38th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Royal Holloway, University of London London United Kingdom","acronym":"SPAA '26","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","EATCS"]},"container-title":["Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3816782.3819184","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T17:29:38Z","timestamp":1783531778000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3816782.3819184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,6]]},"references-count":38,"alternative-id":["10.1145\/3816782.3819184","10.1145\/3816782"],"URL":"https:\/\/doi.org\/10.1145\/3816782.3819184","relation":{},"subject":[],"published":{"date-parts":[[2026,7,6]]},"assertion":[{"value":"2026-07-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}