{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T21:30:17Z","timestamp":1775597417929,"version":"3.50.1"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1109\/cahpc.2018.8645916","type":"proceedings-article","created":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T23:19:26Z","timestamp":1550791166000},"page":"420-427","source":"Crossref","is-referenced-by-count":9,"title":["A Scalability and Sensitivity Study of Parallel Geometric Algorithms for Graph Partitioning"],"prefix":"10.1109","author":[{"given":"Shad","family":"Kirmani","sequence":"first","affiliation":[]},{"given":"Hongyang","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Padma","family":"Raghavan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1147\/rd.175.0420","article-title":"Lower bounds for the partitioning of graphs","volume":"17","author":"donath","year":"1973","journal-title":"IBM J Res Dev"},{"key":"ref11","first-page":"175","article-title":"A linear-time heuristic for improving network partitions","author":"fiduccia","year":"1982","journal-title":"DAC '82"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.21136\/CMJ.1975.101357"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/800119.803884"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1995.395965"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479892238270"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/224170.224228","article-title":"A multilevel algorithm for partitioning graphs","author":"hendrickson","year":"1995","journal-title":"Supercomputing'95"},{"key":"ref17","first-page":"37","article-title":"Efficient, high-quality force-directed graph drawing","volume":"10","author":"hu","year":"2006","journal-title":"The Mathematica Journal"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/369028.369103","article-title":"Parallel multilevel k-way partitioning scheme for irregular graphs","author":"karypis","year":"1996","journal-title":"Supercomputing '96"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"ref28","first-page":"96","article-title":"Spectral partitioning works: Planar graphs and finite element meshes","author":"spielmat","year":"1996","journal-title":"FOCS 96"},{"key":"ref4","article-title":"Zoltan 3.0: Parallel Partitioning, Load-balancing, and Data Management Services; User's Guide","author":"boman","year":"2007","journal-title":"Sandia National Laboratories Albuquerque NM Tech Rep"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BFb0014497","article-title":"Triangle: Engineering a 2D quality mesh generator and delaunay triangulator","author":"shewchuk","year":"1996","journal-title":"Proceedings of Workshop on Applied Computational Geormetry Towards Geometric Engineering (FCRC'96\/WACG'96)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676942"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195077"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0221016"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2412545"},{"key":"ref7","volume":"92","author":"davis","year":"1994","journal-title":"NA Digest"},{"key":"ref2","first-page":"324","article-title":"A hierarchical O(N log N) force calculation algorithm","author":"barnes","year":"1986","journal-title":"Nature"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718133.ch6"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100254"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503280"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2012.2231094"},{"key":"ref21","first-page":"401","article-title":"Achieving finite element mesh quality via optimization of the jacobian matrix norm and associated quantities","volume":"48","author":"knupp","year":"2000","journal-title":"part I-A framework for surface mesh optimization International Journal for Numerical Methods in Engineering"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2011.04.031"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185417"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.05.013"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/3-540-61142-8_588","article-title":"Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs","author":"pellegrini","year":"1996","journal-title":"Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking"}],"event":{"name":"2018 30th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)","location":"Lyon, France","start":{"date-parts":[[2018,9,24]]},"end":{"date-parts":[[2018,9,27]]}},"container-title":["2018 30th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8638685\/8645847\/08645916.pdf?arnumber=8645916","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T05:32:00Z","timestamp":1643261520000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8645916\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/cahpc.2018.8645916","relation":{},"subject":[],"published":{"date-parts":[[2018,9]]}}}