{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T12:33:19Z","timestamp":1773318799060,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T00:00:00Z","timestamp":1763164800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2008772,2217154"],"award-info":[{"award-number":["2008772,2217154"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,16]]},"DOI":"10.1145\/3712285.3759863","type":"proceedings-article","created":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T16:04:47Z","timestamp":1762963487000},"page":"2094-2108","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["AMRaCut: Scalable Partitioning for Adaptive Mesh Refinement"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8122-3462","authenticated-orcid":false,"given":"Budvin","family":"Edippuliarachchi","sequence":"first","affiliation":[{"name":"Tufts University, Medford, MA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0610-0806","authenticated-orcid":false,"given":"David","family":"Van Komen","sequence":"additional","affiliation":[{"name":"University of Utah, Salt Lake City, UT, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9001-5107","authenticated-orcid":false,"given":"Hari","family":"Sundar","sequence":"additional","affiliation":[{"name":"Tufts University, Medford, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,11,15]]},"reference":[{"key":"e_1_3_3_2_2_2","unstructured":"[n. d.]. Dataset - Thingi10k : Faculty Digital Archive : NYU Libraries. https:\/\/archive.nyu.edu\/handle\/2451\/44304. [Accessed 05-07-2024]."},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_3_3_2_4_2","unstructured":"Satish Balay Shrirang Abhyankar Mark\u00a0F. Adams Jed Brown Peter Brune Kris Buschelman Lisandro Dalcin Victor Eijkhout William\u00a0D. Gropp Dinesh Kaushik Matthew\u00a0G. Knepley Lois\u00a0Curfman McInnes Karl Rupp Barry\u00a0F. Smith Stefano Zampini and Hong Zhang. 2015. PETSc Web page. http:\/\/www.mcs.anl.gov\/petsc. http:\/\/www.mcs.anl.gov\/petsc"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.25"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"publisher","unstructured":"Carsten Burstedde Lucas\u00a0C. Wilcox and Omar Ghattas. 2011. p4est: Scalable Algorithms for Parallel Adaptive Mesh Refinement on Forests of Octrees. SIAM Journal on Scientific Computing 33 3 (2011) 1103\u20131133. 10.1137\/100791634","DOI":"10.1137\/100791634"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","unstructured":"C. Chevalier and F. Pellegrini. 2008. PT-Scotch: A tool for efficient parallel graph ordering. Parallel Comput. 34 6 (2008) 318\u2013331. 10.1016\/j.parco.2007.12.001Parallel Matrix Algorithms and Applications.","DOI":"10.1016\/j.parco.2007.12.001"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"crossref","unstructured":"Fan Chung. 2007. The heat kernel as the pagerank of a graph. Proceedings of the National Academy of Sciences 104 50 (2007) 19735\u201319740.","DOI":"10.1073\/pnas.0708838104"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"crossref","unstructured":"Fan Chung. 2009. A local graph partitioning algorithm using heat kernel pagerank. Internet Mathematics 6 3 (2009) 315\u2013330.","DOI":"10.1080\/15427951.2009.10390643"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","unstructured":"Milinda Fernando David Neilsen Hyun Lim Eric Hirschmann and Hari Sundar. 2019. Massively Parallel Simulations of Binary Black Hole Intermediate-Mass-Ratio Inspirals. SIAM Journal on Scientific Computing 41 2 (2019) C97\u2013C138. 10.1137\/18M1196972 arXiv:https:\/\/doi.org\/10.1137\/18M1196972","DOI":"10.1137\/18M1196972"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","unstructured":"Milinda Fernando David Neilsen Yosef Zlochower Eric\u00a0W. Hirschmann and Hari Sundar. 2023. Massively parallel simulations of binary black holes with adaptive wavelet multiresolution. Phys. Rev. D 107 (Mar 2023) 064035. Issue 6. 10.1103\/PhysRevD.107.064035","DOI":"10.1103\/PhysRevD.107.064035"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1982.1585498"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"crossref","unstructured":"John\u00a0R Gilbert Gary\u00a0L Miller and Shang-Hua Teng. 1998. Geometric mesh partitioning: Implementation and experiments. SIAM Journal on Scientific Computing 19 6 (1998) 2091\u20132110.","DOI":"10.1137\/S1064827594275339"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.5555\/1177250"},{"key":"e_1_3_3_2_15_2","unstructured":"NYU Geometric\u00a0Computing Group. 2023. Geometric Datasets. https:\/\/cims.nyu.edu\/gcl\/datasets.html New York University Center for Computational Mathematics (CCM)."},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654123"},{"key":"e_1_3_3_2_17_2","volume-title":"The Chaco user\u2019s guide: Version 2.0","author":"Hendrickson Bruce","year":"1995","unstructured":"Bruce Hendrickson and Robert Leland. 1995. The Chaco user\u2019s guide: Version 2.0. Technical Report. Technical Report SAND95-2344, Sandia National Laboratories."},{"key":"e_1_3_3_2_18_2","unstructured":"JH Her and F Pellegrini. 2010. Efficient and scalable parallel graph partitioning. Parallel Comput. (2010)."},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"crossref","unstructured":"Yixin Hu Qingnan Zhou Xifeng Gao Alec Jacobson Denis Zorin and Daniele Panozzo. 2018. Tetrahedral meshing in the wild. ACM Trans. Graph. 37 4 (2018) 60.","DOI":"10.1145\/3197517.3201353"},{"key":"e_1_3_3_2_20_2","series-title":"(SC \u201912)","volume-title":"Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis","author":"Ishiyama Tomoaki","year":"2012","unstructured":"Tomoaki Ishiyama, Keigo Nitadori, and Junichiro Makino. 2012. 4.45 Pflops Astrophysical N-body Simulation on K Computer: The Gravitational Trillion-body Problem. In Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis (Salt Lake City, Utah) (SC \u201912). IEEE Computer Society Press, Los Alamitos, CA, USA, Article 5, 10\u00a0pages. http:\/\/dl.acm.org\/citation.cfm?id=2388996.2389003"},{"key":"e_1_3_3_2_21_2","unstructured":"George Karypis and Vipin Kumar. 1995. Metis-unstructured graph partitioning and sparse matrix ordering system version 2.0. (1995)."},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1996.508075"},{"key":"e_1_3_3_2_23_2","volume-title":"parMETIS 4.x Manual","unstructured":"KarypisLab. [n. d.]. parMETIS 4.x Manual. https:\/\/github.com\/KarypisLab\/ParMETIS\/blob\/main\/manual\/manual.pdf"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","unstructured":"B.\u00a0W. Kernighan and S. Lin. 1970. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal 49 2 (1970) 291\u2013307. 10.1002\/j.1538-7305.1970.tb01770.x","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.50"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","unstructured":"Steven\u00a0L. Liebling. 2002. The Singularity Threshold of the Nonlinear Sigma Model Using 3D Adaptive Mesh Refinement. 66 4 (2002) 041703. 10.1103\/PhysRevD.66.041703 arXiv:https:\/\/arXiv.org\/abs\/gr-qc\/0202093","DOI":"10.1103\/PhysRevD.66.041703"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/588\/11699"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.42"},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807675"},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-39698-4_30"},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"crossref","unstructured":"Stefan Schamberger and Jens-Michael Wierum. 2005. Partitioning finite element meshes using space-filling curves. Future Generation Computer Systems 21 5 (2005) 759\u2013766.","DOI":"10.1016\/j.future.2004.05.018"},{"key":"e_1_3_3_2_32_2","doi-asserted-by":"crossref","unstructured":"Florian Schornbaum and Ulrich R\u00fcde. 2018. Extreme-scale block-structured adaptive mesh refinement. SIAM Journal on Scientific Computing 40 3 (2018) C358\u2013C387.","DOI":"10.1137\/17M1128411"},{"key":"e_1_3_3_2_33_2","doi-asserted-by":"crossref","unstructured":"Horst\u00a0D Simon and Shang-Hua Teng. 1997. How good is recursive bisection? SIAM Journal on Scientific Computing 18 5 (1997) 1436\u20131445.","DOI":"10.1137\/S1064827593255135"},{"key":"e_1_3_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2014.7004265"},{"key":"e_1_3_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.95"},{"key":"e_1_3_3_2_36_2","doi-asserted-by":"crossref","unstructured":"Daniel\u00a0A Spielman and Nikhil Srivastava. 2011. Graph sparsification by effective resistances. SIAM J. Comput. 40 6 (2011) 1913\u20131926.","DOI":"10.1137\/080734029"},{"key":"e_1_3_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007372"},{"key":"e_1_3_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3311790.3396656"},{"key":"e_1_3_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.2172\/1324617"},{"key":"e_1_3_3_2_40_2","unstructured":"Hari Sundar. 2020. USort: A Parallel Sorting Algorithm. https:\/\/github.com\/hsundar\/usort GitHub repository."},{"key":"e_1_3_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/2464996.2465442"},{"key":"e_1_3_3_2_42_2","doi-asserted-by":"publisher","unstructured":"Hari Sundar Rahul Sampath and George Biros. 2008. Bottom-up construction and 2:1 balance refinement of linear octrees in parallel. SIAM Journal on Scientific Computing 30 5 (2008) 2675\u20132708. 10.1137\/070681727","DOI":"10.1137\/070681727"},{"key":"e_1_3_3_2_43_2","first-page":"27","volume-title":"Mesh Partitioning Techniques and Domain Decomposition Techniques","author":"Walshaw C.","year":"2007","unstructured":"C. Walshaw and M. Cross. 2007. JOSTLE: Parallel Multilevel Graph-Partitioning Software \u2013 An Overview. In Mesh Partitioning Techniques and Domain Decomposition Techniques, F.\u00a0Magoules (Ed.). Civil-Comp Ltd., 27\u201358. (Invited chapter)."}],"event":{"name":"SC '25: The International Conference for High Performance Computing, Networking, Storage and Analysis","location":"St. Louis MO USA","acronym":"SC '25","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"]},"container-title":["Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3712285.3759863","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3712285.3759863","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3712285.3759863","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T18:51:56Z","timestamp":1773255116000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712285.3759863"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,15]]},"references-count":42,"alternative-id":["10.1145\/3712285.3759863","10.1145\/3712285"],"URL":"https:\/\/doi.org\/10.1145\/3712285.3759863","relation":{},"subject":[],"published":{"date-parts":[[2025,11,15]]},"assertion":[{"value":"2025-11-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}