{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T01:09:06Z","timestamp":1760404146905,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,21]],"date-time":"2014-06-21T00:00:00Z","timestamp":1403308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,21]]},"DOI":"10.1145\/2612669.2612699","type":"proceedings-article","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T14:23:03Z","timestamp":1404224583000},"page":"51-60","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Hierarchical graph partitioning"],"prefix":"10.1145","author":[{"given":"Mohammadtaghi","family":"Hajiaghayi","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"given":"Theodore","family":"Johnson","sequence":"additional","affiliation":[{"name":"AT&T Research Laboratory, Florham Park, NJ, USA"}]},{"given":"Mohammad Reza","family":"Khani","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"given":"Barna","family":"Saha","sequence":"additional","affiliation":[{"name":"AT&T Research Laboratory, Florham Park, NJ, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007931"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133112"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502794"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-012-0229-4"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-006-0210-9"},{"key":"e_1_3_2_1_6_1","volume-title":"Parapart: parallel mesh partitioning tool for distributed systems. Concurrency: Practice and Experience, 12(2--3):111--123","author":"Chen Jian","year":"2000","unstructured":"Jian Chen and Valerie E Taylor . Parapart: parallel mesh partitioning tool for distributed systems. Concurrency: Practice and Experience, 12(2--3):111--123 , 2000 . Jian Chen and Valerie E Taylor. Parapart: parallel mesh partitioning tool for distributed systems. Concurrency: Practice and Experience, 12(2--3):111--123, 2000."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/5992.988653"},{"key":"e_1_3_2_1_8_1","first-page":"639","volume-title":"SODA","author":"Even Guy","year":"1997","unstructured":"Guy Even , Joseph (Seffi) Naor , Satish Rao , and Baruch Schieber . Fast approximate graph partitioning algorithms . In SODA , pages 639 -- 648 , 1997 . Guy Even, Joseph (Seffi) Naor, Satish Rao, and Baruch Schieber. Fast approximate graph partitioning algorithms. In SODA, pages 639--648, 1997."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701387660"},{"key":"e_1_3_2_1_10_1","first-page":"100","volume-title":"STACS","volume":"14","author":"Feldmann Andreas Emil","year":"2012","unstructured":"Andreas Emil Feldmann and Luca Foschini . Balanced Partitions of Trees and Applications . In STACS , volume 14 , pages 100 -- 111 , 2012 . Andreas Emil Feldmann and Luca Foschini. Balanced Partitions of Trees and Applications. In STACS, volume 14, pages 100--111, 2012."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376729"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465337"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217033"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.74"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585268"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109669"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496872"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.1990.112608"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69501-1_6"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060676"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SHPCC.1994.296682"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/3-540-61142-8_588","volume-title":"High-Performance Computing and Networking","author":"Pellegrini Fran\u00e7ois","year":"1996","unstructured":"Fran\u00e7ois Pellegrini and Jean Roman . Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs . In High-Performance Computing and Networking , pages 493 -- 498 . Springer , 1996 . Fran\u00e7ois Pellegrini and Jean Roman. Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs. In High-Performance Computing and Networking, pages 493--498. Springer, 1996."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374415"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827593255135"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11558958_110"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/762761.762767"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(00)00046-6"},{"key":"e_1_3_2_1_29_1","volume-title":"Multilevel mesh partitioning for heterogeneous communication networks. Future generation computer systems, 17(5):601--623","author":"Mark Cross ChrisWalshaw","year":"2001","unstructured":"ChrisWalshaw and Mark Cross . Multilevel mesh partitioning for heterogeneous communication networks. Future generation computer systems, 17(5):601--623 , 2001 . ChrisWalshaw and Mark Cross. Multilevel mesh partitioning for heterogeneous communication networks. Future generation computer systems, 17(5):601--623, 2001."}],"event":{"name":"SPAA '14: 26th 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"],"location":"Prague Czech Republic","acronym":"SPAA '14"},"container-title":["Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612699","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2612669.2612699","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:34Z","timestamp":1750230094000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612699"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,21]]},"references-count":29,"alternative-id":["10.1145\/2612669.2612699","10.1145\/2612669"],"URL":"https:\/\/doi.org\/10.1145\/2612669.2612699","relation":{},"subject":[],"published":{"date-parts":[[2014,6,21]]},"assertion":[{"value":"2014-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}