{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T00:41:20Z","timestamp":1776127280312,"version":"3.50.1"},"reference-count":79,"publisher":"Association for Computing Machinery (ACM)","license":[{"start":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T00:00:00Z","timestamp":1567641600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DFG","award":["SA 933\/10-2"],"award-info":[{"award-number":["SA 933\/10-2"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM J. Exp. Algorithmics"],"published-print":{"date-parts":[[2019,12,17]]},"abstract":"<jats:p>\n            We present a refinement framework for multilevel hypergraph partitioning that uses max-flow computations on pairs of blocks to improve the solution quality of a\n            <jats:italic>k<\/jats:italic>\n            -way partition. The framework generalizes the flow-based improvement algorithm of the Karlsruhe Fast Flow Partitioner (KaFFPa) from graphs to hypergraphs and is integrated into the hypergraph partitioner Karlsruhe Hypergraph Partitioning (KaHyPar). By reducing the size of hypergraph flow networks, improving the flow model used in KaFFPa, and developing techniques to improve the running time of our algorithm, we obtain a partitioner that computes the best solutions for a wide range of benchmark hypergraphs from different application areas for\n            <jats:italic>both<\/jats:italic>\n            the connectivity and the cut-net metric while still having a running time comparable to that of hMetis. In the case of graph partitioning, our algorithm compares favorably with KaFFPa, even after enhancing the latter with our improved flow network, and at the same time is more than a factor of two faster. Finally, we show that our algorithm improves the performance of the memetic multilevel hypergraph partitioner KaHyPar-E.\n          <\/jats:p>","DOI":"10.1145\/3329872","type":"journal-article","created":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T12:14:48Z","timestamp":1567685688000},"page":"1-36","source":"Crossref","is-referenced-by-count":19,"title":["Network Flow-Based Refinement for Multilevel Hypergraph Partitioning"],"prefix":"10.1145","volume":"24","author":[{"given":"Tobias","family":"Heuer","sequence":"first","affiliation":[{"name":"Karlsruher Institut f\u00fcr Technologie (KIT), Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[{"name":"Karlsruher Institut f\u00fcr Technologie (KIT), Karlsruhe, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1550-882X","authenticated-orcid":false,"given":"Sebastian","family":"Schlag","sequence":"additional","affiliation":[{"name":"Karlsruher Institut f\u00fcr Technologie (KIT), Karlsruhe, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,9,5]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"9th International Conference on VLSI Design (VLSID). 393--399","author":"Agrawal P.","unstructured":"P. Agrawal , B. Narendran , and N. Shivakumar . 1996. Multi-way partitioning of VLSI circuits . In 9th International Conference on VLSI Design (VLSID). 393--399 . P. Agrawal, B. Narendran, and N. Shivakumar. 1996. Multi-way partitioning of VLSI circuits. In 9th International Conference on VLSI Design (VLSID). 393--399."},{"key":"e_1_2_1_2_1","volume-title":"19th Workshop on Algorithm Engineering and Experiments (ALENEX). 28--42","author":"Akhremtsev Y.","unstructured":"Y. Akhremtsev , T. Heuer , P. Sanders , and S. Schlag . 2017. Engineering a direct k-way hypergraph partitioning algorithm . In 19th Workshop on Algorithm Engineering and Experiments (ALENEX). 28--42 . Y. Akhremtsev, T. Heuer, P. Sanders, and S. Schlag. 2017. Engineering a direct k-way hypergraph partitioning algorithm. In 19th Workshop on Algorithm Engineering and Experiments (ALENEX). 28--42."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/274535.274546"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.712098"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9260(95)00008-4"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205475"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.09.006"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/588"},{"key":"e_1_2_1_9_1","unstructured":"A. Belov D. Diepold M. Heule and M. J\u00e4rvisalo. 2014. The SAT Competition 2014. Retrieved from http:\/\/www.satcompetition.org\/2014\/.  A. Belov D. Diepold M. Heule and M. J\u00e4rvisalo. 2014. The SAT Competition 2014. Retrieved from http:\/\/www.satcompetition.org\/2014\/."},{"key":"e_1_2_1_10_1","volume-title":"Combinatorial Scientific Computing","author":"Bisseling R. H.","unstructured":"R. H. Bisseling , B. O. Fagginger Auer , A. N. Yzelman , T. van Leeuwen , and \u00dc. V. Cataly\u00fcrek . 2012. Two-dimensional approaches to sparse matrix partitioning . In Combinatorial Scientific Computing . CRC Press , New York , 321--349. R. H. Bisseling, B. O. Fagginger Auer, A. N. Yzelman, T. van Leeuwen, and \u00dc. V. Cataly\u00fcrek. 2012. Two-dimensional approaches to sparse matrix partitioning. In Combinatorial Scientific Computing. CRC Press, New York, 321--349."},{"key":"e_1_2_1_11_1","unstructured":"E. Boman K. Devine V. Leung S. Rajamanickam L. A. Riesen and \u00dc. V. Cataly\u00fcrek. 2012. Zoltan User\u2019s Guide. Retrieved from http:\/\/www.cs.sandia.gov\/Zoltan\/ug_html\/ug_alg_patoh.html.  E. Boman K. Devine V. Leung S. Rajamanickam L. A. Riesen and \u00dc. V. Cataly\u00fcrek. 2012. Zoltan User\u2019s Guide. Retrieved from http:\/\/www.cs.sandia.gov\/Zoltan\/ug_html\/ug_alg_patoh.html."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"e_1_2_1_13_1","volume-title":"SIAM Conference on Parallel Processing for Scientific Computing. 445--452","author":"Bui T. N.","unstructured":"T. N. Bui and C. Jones . 1993. A heuristic for reducing fill-in in sparse matrix factorization . In SIAM Conference on Parallel Processing for Scientific Computing. 445--452 . T. N. Bui and C. Jones. 1993. A heuristic for reducing fill-in in sparse matrix factorization. In SIAM Conference on Parallel Processing for Scientific Computing. 445--452."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/368434.368864"},{"key":"e_1_2_1_15_1","first-page":"248","article-title":"scmamp: Statistical comparison of multiple algorithms in multiple problems","volume":"8","author":"Calvo B.","year":"2016","unstructured":"B. Calvo and G. Santaf\u00e9 . 2016 . scmamp: Statistical comparison of multiple algorithms in multiple problems . The R J. Journal 8 , 1 (2016), 248 -- 256 . B. Calvo and G. Santaf\u00e9. 2016. scmamp: Statistical comparison of multiple algorithms in multiple problems. The R J. Journal 8, 1 (2016), 248--256.","journal-title":"Journal"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.780863"},{"key":"e_1_2_1_17_1","unstructured":"Cataly\u00fcrek \u00dc. V. {n.d.}. ISPD98 Benchmark. Retrieved from http:\/\/bmi.osu.edu\/umit\/PaToH\/ispd98.html.  Cataly\u00fcrek \u00dc. V. {n.d.}. ISPD98 Benchmark. Retrieved from http:\/\/bmi.osu.edu\/umit\/PaToH\/ispd98.html."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/640000.640021"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/157485.165119"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1177\/1536867X1101100112"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920853"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248548"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.12.002"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1898953.1899056"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100263"},{"key":"e_1_2_1_27_1","volume-title":"Logic partitioning. Physical Design Automation of VLSI Systems","author":"Donath W. E.","year":"1988","unstructured":"W. E. Donath . 1988. Logic partitioning. Physical Design Automation of VLSI Systems ( 1988 ), 65--86. W. E. Donath. 1988. Logic partitioning. Physical Design Automation of VLSI Systems (1988), 65--86."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"e_1_2_1_29_1","volume-title":"19th ACM\/IEEE Design Automation Conf. 175--181","author":"Fiduccia C.","unstructured":"C. Fiduccia and R. Mattheyses . 1982. A linear time heuristic for improving network partitions . In 19th ACM\/IEEE Design Automation Conf. 175--181 . C. Fiduccia and R. Mattheyses. 1982. A linear time heuristic for improving network partitions. In 19th ACM\/IEEE Design Automation Conf. 175--181."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1993.10476358"},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","unstructured":"D. R. Ford and D. R. Fulkerson. 1962. Flows in Networks. Princeton University Press.  D. R. Ford and D. R. Fulkerson. 1962. Flows in Networks. Princeton University Press.","DOI":"10.1515\/9781400875184"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1937.10503522"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731944"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.12.010"},{"key":"e_1_2_1_36_1","article-title":"An extension on \u201cstatistical comparisons of classifiers over multiple data sets\u201d for all pairwise comparisons","author":"Garcia S.","year":"2008","unstructured":"S. Garcia and F. Herrera . 2008 . An extension on \u201cstatistical comparisons of classifiers over multiple data sets\u201d for all pairwise comparisons . J. Mach. Learn. Res. 9 , ( Dec. 2008), 2677--2694. S. Garcia and F. Herrera. 2008. An extension on \u201cstatistical comparisons of classifiers over multiple data sets\u201d for all pairwise comparisons. J. Mach. Learn. Res. 9, (Dec.2008), 2677--2694.","journal-title":"J. Mach. Learn. Res. 9"},{"key":"e_1_2_1_37_1","volume-title":"19th European Symposium on Algorithms (ESA)","author":"Goldberg A.","year":"2011","unstructured":"A. Goldberg , S. Hed , H. Kaplan , R. Tarjan , and R. Werneck . 2011. Maximum flows by incremental breadth-first search . 19th European Symposium on Algorithms (ESA) ( 2011 ), 457--468. A. Goldberg, S. Hed, H. Kaplan, R. Tarjan, and R. Werneck. 2011. Maximum flows by incremental breadth-first search. 19th European Symposium on Algorithms (ESA) (2011), 457--468."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2950048"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.644609"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2627534.2627563"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/224170.224228"},{"key":"e_1_2_1_43_1","unstructured":"T. Heuer. 2018. High Quality Hypergraph Partitioning via Max-Flow-Min-Cut Computations. Master\u2019s Thesis. KIT.  T. Heuer. 2018. High Quality Hypergraph Partitioning via Max-Flow-Min-Cut Computations. Master\u2019s Thesis. KIT."},{"key":"e_1_2_1_44_1","unstructured":"T. Heuer P. Sanders and S. Schlag. 2018. Network flow-based refinement for multilevel hypergraph partitioning. CoRR abs\/1802.03587 (2018). arxiv:1802.03587  T. Heuer P. Sanders and S. Schlag. 2018. Network flow-based refinement for multilevel hypergraph partitioning. CoRR abs\/1802.03587 (2018). arxiv:1802.03587"},{"key":"e_1_2_1_45_1","volume-title":"17th International Symposium on Experimental Algorithms (SEA)","volume":"103","author":"Heuer T.","unstructured":"T. Heuer , P. Sanders , and S. Schlag . 2018. Network flow-based refinement for multilevel hypergraph partitioning . In 17th International Symposium on Experimental Algorithms (SEA) , Vol. 103 . 1:1--1:19. T. Heuer, P. Sanders, and S. Schlag. 2018. Network flow-based refinement for multilevel hypergraph partitioning. In 17th International Symposium on Experimental Algorithms (SEA), Vol. 103. 1:1--1:19."},{"key":"e_1_2_1_46_1","volume-title":"16th International Symposium on Experimental Algorithms (SEA). 21:1--21:19","author":"Heuer T.","unstructured":"T. Heuer and S. Schlag . 2017. Improving coarsening schemes for hypergraph partitioning by exploiting community structure . In 16th International Symposium on Experimental Algorithms (SEA). 21:1--21:19 . T. Heuer and S. Schlag. 2017. Improving coarsening schemes for hypergraph partitioning by exploiting community structure. In 16th International Symposium on Experimental Algorithms (SEA). 21:1--21:19."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1198\/000313006X118430"},{"key":"e_1_2_1_48_1","first-page":"87","article-title":"Multiterminal flows in a hypergraph. In VLSI Circuit Layout: Theory and Design, T.C. Hu and E.S. Kuh (Eds.). IEEE Press","volume":"3","author":"Hu T. C.","year":"1985","unstructured":"T. C. Hu and K. Moerder . 1985 . Multiterminal flows in a hypergraph. In VLSI Circuit Layout: Theory and Design, T.C. Hu and E.S. Kuh (Eds.). IEEE Press , Chapter 3 , 87 -- 93 . T. C. Hu and K. Moerder. 1985. Multiterminal flows in a hypergraph. In VLSI Circuit Layout: Theory and Design, T.C. Hu and E.S. Kuh (Eds.). IEEE Press, Chapter 3, 87--93.","journal-title":"Chapter"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1080\/03610928008827904"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137650"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.748202"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/309847.309954"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230030306"},{"key":"e_1_2_1_55_1","unstructured":"E. Lawler. 1976. Combinatorial Optimization: Networks and Matroids. Holt Rinehart and Whinston.  E. Lawler. 1976. Combinatorial Optimization: Networks and Matroids. Holt Rinehart and Whinston."},{"key":"e_1_2_1_56_1","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"Lengauer T.","unstructured":"T. Lengauer . 1990. Combinatorial Algorithms for Integrated Circuit Layout . John Wiley 8 Sons, Inc. T. Lengauer. 1990. Combinatorial Algorithms for Integrated Circuit Layout. John Wiley 8 Sons, Inc."},{"key":"e_1_2_1_57_1","volume-title":"1995 International Conference on Computer Aided Design (ICCAD). 223--228","author":"Li J.","unstructured":"J. Li , J. Lillis , and C. K. Cheng . 1995. Linear decomposition algorithm for VLSI design applications . In 1995 International Conference on Computer Aided Design (ICCAD). 223--228 . J. Li, J. Lillis, and C. K. Cheng. 1995. Linear decomposition algorithm for VLSI design applications. In 1995 International Conference on Computer Aided Design (ICCAD). 223--228."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.673632"},{"key":"e_1_2_1_59_1","volume-title":"5th Pragmatics of SAT Workshop (EPiC Series in Computing), Daniel Le Berre (Ed.)","volume":"27","author":"Mann Z.","unstructured":"Z. Mann and P. Papp . 2014. Formula partitioning revisited. In POS-14 . 5th Pragmatics of SAT Workshop (EPiC Series in Computing), Daniel Le Berre (Ed.) , Vol. 27 . EasyChair, 41--56. Z. Mann and P. Papp. 2014. Formula partitioning revisited. In POS-14. 5th Pragmatics of SAT Workshop (EPiC Series in Computing), Daniel Le Berre (Ed.), Vol. 27. EasyChair, 41--56."},{"key":"e_1_2_1_60_1","volume-title":"IEEE International Conference on Big Data. 458--467","author":"Mayer C.","unstructured":"C. Mayer , R. Mayer , S. Bhowmik , L. Epple , and K. Rothermel . 2018. HYPE: Massive hypergraph partitioning with neighborhood expansion . In IEEE International Conference on Big Data. 458--467 . C. Mayer, R. Mayer, S. Bhowmik, L. Epple, and K. Rothermel. 2018. HYPE: Massive hypergraph partitioning with neighborhood expansion. In IEEE International Conference on Big Data. 458--467."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07959-2_30"},{"key":"e_1_2_1_62_1","doi-asserted-by":"crossref","unstructured":"D. A. Papa and I. L. Markov. 2007. Hypergraph partitioning and clustering. In Handbook of Approximation Algorithms and Metaheuristics. T. F. Gonzalez (Ed.). Chapman and Hall\/CRC.  D. A. Papa and I. L. Markov. 2007. Hypergraph partitioning and clustering. In Handbook of Approximation Algorithms and Metaheuristics. T. F. Gonzalez (Ed.). Chapman and Hall\/CRC.","DOI":"10.1201\/9781420010749.ch61"},{"key":"e_1_2_1_63_1","doi-asserted-by":"crossref","unstructured":"J.-C. Picard and M. Queyranne. 1980. On the structure of all minimum cuts in a network and applications. Combinatorial Optimization II (1980) 8--16.  J.-C. Picard and M. Queyranne. 1980. On the structure of all minimum cuts in a network and applications. Combinatorial Optimization II (1980) 8--16.","DOI":"10.1007\/BFb0120902"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1111\/1475-3995.00389"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.8730"},{"key":"e_1_2_1_67_1","volume-title":"19th European Symposium on Algorithms (ESA) (LNCS)","volume":"6942","author":"Sanders P.","unstructured":"P. Sanders and C. Schulz . 2011. Engineering multilevel graph partitioning algorithms . In 19th European Symposium on Algorithms (ESA) (LNCS) , Vol. 6942 . Springer, 469--480. P. Sanders and C. Schulz. 2011. Engineering multilevel graph partitioning algorithms. In 19th European Symposium on Algorithms (ESA) (LNCS), Vol. 6942. Springer, 469--480."},{"key":"e_1_2_1_68_1","volume-title":"Proceedings of the 12th International Symposium on Experimental Algorithms (SEA\u201913)","volume":"7933","author":"Sanders P.","unstructured":"P. Sanders and C. Schulz . 2013. Think locally, act globally: Highly balanced graph partitioning . In Proceedings of the 12th International Symposium on Experimental Algorithms (SEA\u201913) (LNCS), Vol. 7933 . Springer, 164--175. P. Sanders and C. Schulz. 2013. Think locally, act globally: Highly balanced graph partitioning. In Proceedings of the 12th International Symposium on Experimental Algorithms (SEA\u201913) (LNCS), Vol. 7933. Springer, 164--175."},{"key":"e_1_2_1_69_1","volume-title":"18th Workshop on Algorithm Engineering and Experiments (ALENEX). 53--67","author":"Schlag S.","unstructured":"S. Schlag , V. Henne , T. Heuer , H. Meyerhenke , P. Sanders , and C. Schulz . 2016. k-way hypergraph partitioning via n-level recursive bisection . In 18th Workshop on Algorithm Engineering and Experiments (ALENEX). 53--67 . S. Schlag, V. Henne, T. Heuer, H. Meyerhenke, P. Sanders, and C. Schulz. 2016. k-way hypergraph partitioning via n-level recursive bisection. In 18th Workshop on Algorithm Engineering and Experiments (ALENEX). 53--67."},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/800153.804930"},{"key":"e_1_2_1_71_1","volume-title":"17th International Symposium on Experimental Algorithms (SEA)","volume":"103","author":"Shaydulin R.","unstructured":"R. Shaydulin and I. Safro . 2018. Aggregative coarsening for multilevel hypergraph partitioning . In 17th International Symposium on Experimental Algorithms (SEA) , Vol. 103 . 2:1--2:15. R. Shaydulin and I. Safro. 2018. Aggregative coarsening for multilevel hypergraph partitioning. In 17th International Symposium on Experimental Algorithms (SEA), Vol. 103. 2:1--2:15."},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827593255135"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.11.002"},{"key":"e_1_2_1_75_1","first-page":"53","article-title":"UMPa: A multi-objective, multi-level partitioner for communication minimization","volume":"8","author":"\u00c7ataly\u00fcrek V.","year":"2012","unstructured":"\u00dc. V. \u00c7ataly\u00fcrek , M. Deveci , K. Kaya , and B. U\u00e7ar . 2012 . UMPa: A multi-objective, multi-level partitioner for communication minimization , See Ref. 8 , 53 -- 66 . \u00dc. V. \u00c7ataly\u00fcrek, M. Deveci, K. Kaya, and B. U\u00e7ar. 2012. UMPa: A multi-objective, multi-level partitioner for communication minimization, See Ref. 8, 53--66.","journal-title":"See Ref."},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827502410463"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144502409019"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228500"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.2307\/3001968"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.552086"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098033"}],"container-title":["ACM Journal of Experimental Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3329872","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3329872","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:23Z","timestamp":1750206383000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3329872"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,5]]},"references-count":79,"alternative-id":["10.1145\/3329872"],"URL":"https:\/\/doi.org\/10.1145\/3329872","relation":{},"ISSN":["1084-6654","1084-6654"],"issn-type":[{"value":"1084-6654","type":"print"},{"value":"1084-6654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,5]]}}}