{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T14:33:03Z","timestamp":1794407583916,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":27,"publisher":"Springer US","isbn-type":[{"value":"9780387097657","type":"print"},{"value":"9780387097664","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-0-387-09766-4_1","type":"book-chapter","created":{"date-parts":[[2012,1,5]],"date-time":"2012-01-05T00:13:48Z","timestamp":1325722428000},"page":"871-881","source":"Crossref","is-referenced-by-count":6,"title":["Hypergraph Partitioning"],"prefix":"10.1007","author":[{"given":"\u00dcmit V.","family":"\u00c7ataly\u00fcrek","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bora","family":"U\u00e7ar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cevdet","family":"Aykanat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"1_CR1_1","doi-asserted-by":"crossref","unstructured":"Ababei C, Selvakkumaran N, Bazargan K, Karypis G (2002) Multi-objective circuit partitioning for cutsize and path-based delay minimization. In: Proceedings of ICCAD 2002, San Jose, CA, November 2002","DOI":"10.1145\/774572.774599"},{"issue":"5","key":"1_CR2_1","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1016\/j.jpdc.2007.09.006","volume":"68","author":"C Aykanat","year":"2008","unstructured":"Aykanat C, Cambazoglu BB, U\u00e7ar B (2008) Multi-level direct k-way hypergraph partitioning with multiple constraints and fixed vertices. J Parallel Distr Comput 68(5): 609\u2013625","journal-title":"J Parallel Distr Comput"},{"issue":"6","key":"1_CR3_1","doi-asserted-by":"publisher","first-page":"1860","DOI":"10.1137\/S1064827502401953","volume":"26","author":"C Aykanat","year":"2004","unstructured":"Aykanat C, P\u0131nar A, \u00c7ataly\u00fcrek UV (2004) Permuting sparse rectangular matrices into block-diagonal form. SIAM J Sci Comput 26(6):1860\u20131879","journal-title":"SIAM J Sci Comput"},{"key":"1_CR4_1","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198529392.001.0001","volume-title":"Parallel scientific computation: a structured approach using BSP and MPI","author":"RH Bisseling","year":"2004","unstructured":"Bisseling RH (2004) Parallel scientific computation: a structured approach using BSP and MPI. Oxford University Press, Oxford, UK"},{"key":"1_CR5_1","first-page":"47","volume":"21","author":"RH Bisseling","year":"2005","unstructured":"Bisseling RH, Meesen W (2005) Communication balancing in parallel sparse matrix-vector multiplication. Electron Trans Numer Anal 21:47\u201365","journal-title":"Electron Trans Numer Anal"},{"key":"1_CR6_1","unstructured":"Boman E, Devine K, Heaphy R, Hendrickson B, Leung V, Riesen LA, Vaughan C, Catalyurek U, Bozdag D, Mitchell W, Teresco J (2007) Zoltan 3.0: parallel partitioning, load balancing, and data-management services; user\u2019s guide. Sandia National Laboratories, Albuquerque, NM, 2007. Technical Report SAND2007-4748W http:\/\/www.cs.sandia.gov\/Zoltan\/ug_html\/ug.html"},{"issue":"1","key":"1_CR7_1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/TPDS.2007.253277","volume":"18","author":"BB Cambazoglu","year":"2007","unstructured":"Cambazoglu BB, Aykanat C (2007) Hypergraph-partitioning-based remapping models for image-space-parallel direct volume rendering of unstructured grids. IEEE Trans Parallel Distr Syst 18(1):3\u201316","journal-title":"IEEE Trans Parallel Distr Syst"},{"issue":"8","key":"1_CR8_1","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1016\/j.jpdc.2009.04.011","volume":"69","author":"U Catalyurek","year":"2009","unstructured":"Catalyurek U, Boman E, Devine K, Bozdag D, Heaphy R, Riesen\u00a0L (2009) A repartitioning hypergraph model for dynamic load balancing. J Parallel Distr Comput 69(8):711\u2013724","journal-title":"J Parallel Distr Comput"},{"key":"1_CR9_1","unstructured":"\u00c7ataly\u00fcrek UV (1999) Hypergraph models for sparse matrix partitioning and reordering. Ph.D. thesis, Computer Engineering and Information Science, Bilkent University. Available at http:\/\/www.cs.bilkent.edu.tr\/tech-reports\/1999\/ABSTRACTS.1999.html"},{"key":"1_CR10_1","unstructured":"\u00c7ataly\u00fcrek UV, Aykanat C (1995) A hypergraph model for mapping repeated sparse matrixvector product computations onto multicomputers. In: Proceedings of International Conference on High Performance Computing (HiPC\u201995), Goa, India, December 1995"},{"issue":"7","key":"1_CR11_1","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/71.780863","volume":"10","author":"UV \u00c7ataly\u00fcrek","year":"1999","unstructured":"\u00c7ataly\u00fcrek UV, Aykanat C (1999) Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication. IEEE Trans Parallel Distr Syst 10(7):673\u2013693","journal-title":"IEEE Trans Parallel Distr Syst"},{"key":"1_CR12_1","unstructured":"\u00c7ataly\u00fcrek UV, Aykanat C (1999) PaToH: a multilevel hypergraph partitioning tool, version 3.0. Department of Computer Engineering, Bilkent University, Ankara, 06533 Turkey. PaToH is available at http:\/\/bmi.osu.edu\/\u223cumit\/software.htm"},{"key":"1_CR13_1","unstructured":"\u00c7ataly\u00fcrek UV, Aykanat C (2001) A fine-grain hypergraph model for 2D decomposition of sparse matrices. In: Proceedings of 15th International Parallel and Distributed Processing Symposium (IPDPS), San Francisco, CA, April 2001"},{"key":"1_CR14_1","doi-asserted-by":"crossref","unstructured":"\u00c7ataly\u00fcrek UV, Aykanat C (2001) A hypergraph-partitioning approach for coarse-grain decomposition. In: ACM\/IEEE SC2001, Denver, CO, November 2001","DOI":"10.1145\/582034.582062"},{"key":"1_CR15_1","unstructured":"\u00c7ataly\u00fcrek UV, Aykanat C, Kayaaslan E (2009) Hypergraph partitioning-based fill-reducing ordering. Technical Report OSUBMI-TR-2009-n02 and BU-CE-0904, Department of Biomedical Informatics, The Ohio State University and Computer Engineering Department, Bilkent University (Submitted)"},{"issue":"2","key":"1_CR16_1","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/080737770","volume":"32","author":"UV \u00c7ataly\u00fcrek","year":"2010","unstructured":"\u00c7ataly\u00fcrek UV, Aykanat C, U\u00e7ar B (2010) On two-dimensional sparse matrix partitioning: models, methods, and a recipe. SIAM J Sci Comput 32(2):656\u2013683","journal-title":"SIAM J Sci Comput"},{"key":"1_CR17_1","unstructured":"Grigori L, Boman E, Donfack S, Davis T (2008) Hypergraph unsymmetric nested dissection ordering for sparse LU factorization. Technical Report 2008-1290J, Sandia National Labs, Submitted to SIAM J Sci Comp"},{"key":"1_CR18_1","unstructured":"Karypis G, Kumar V (1998) Multilevel algorithms for multi-constraint hypergraph partitioning. Technical Report 99-034, Department of Computer Science, University of Minnesota\/Army HPC Research Center, Minneapolis, MN 55455"},{"key":"1_CR19_1","unstructured":"Karypis G, Kumar V, Aggarwal R, Shekhar S (1998) hMeTiS a hypergraph partitioning package, version 1.0.1. Department of Computer Science, University of Minnesota\/Army HPC Research Center, Minneapolis"},{"key":"1_CR20_1","doi-asserted-by":"crossref","unstructured":"Lengauer T (1990) Combinatorial algorithms for integrated circuit layout. Wiley\u2013Teubner, Chichester","DOI":"10.1007\/978-3-322-92106-2"},{"key":"1_CR21_1","doi-asserted-by":"crossref","unstructured":"Selvakkumaran N, Karypis G (2003) Multi-objective hypergraph partitioning algorithms for cut and maximum subdomain degree minimization. In: Proceedings of ICCAD 2003, San Jose, CA, November 2003","DOI":"10.21236\/ADA439577"},{"issue":"6","key":"1_CR22_1","doi-asserted-by":"publisher","first-page":"1837","DOI":"10.1137\/S1064827502410463","volume":"25","author":"B U\u00e7ar","year":"2004","unstructured":"U\u00e7ar B, Aykanat C (2004) Encapsulating multiple communication-cost metrics in partitioning sparse rectangular matrices for parallel matrix-vector multiplies. SIAM J Sci Comput 25(6):1837\u20131859","journal-title":"SIAM J Sci Comput"},{"issue":"4","key":"1_CR23_1","doi-asserted-by":"publisher","first-page":"1683","DOI":"10.1137\/040617431","volume":"29","author":"B U\u00e7ar","year":"2007","unstructured":"U\u00e7ar B, Aykanat C (2007) Partitioning sparse matrices for parallel preconditioned iterative methods. SIAM J Sci Comput 29(4):1683\u20131709","journal-title":"SIAM J Sci Comput"},{"issue":"4","key":"1_CR24_1","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1137\/060662459","volume":"49","author":"B U\u00e7ar","year":"2007","unstructured":"U\u00e7ar B, Aykanat C (2007) Revisiting hypergraph models for sparse matrix partitioning. SIAM Review 49(4):595\u2013603","journal-title":"SIAM Review"},{"key":"1_CR25_1","first-page":"593","volume-title":"Proceedings of the 18th Euromicro Conference on Parallel, Distributed, and Network-based Processing, IEEE Computer Society, Conference Publishing Services","author":"B U\u00e7ar","year":"2010","unstructured":"U\u00e7ar B, \u00c7ataly\u00fcrek UV (2010) On the scalability of hypergraph models for sparse matrix partitioning. In: Danelutto M, Bourgeois\u00a0J, Gross T (eds), Proceedings of the 18th Euromicro Conference on Parallel, Distributed, and Network-based Processing, IEEE Computer Society, Conference Publishing Services, pp\u00a0593\u2013600"},{"issue":"5\u20136","key":"1_CR26_1","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.parco.2009.12.008","volume":"36","author":"B U\u00e7ar","year":"2010","unstructured":"U\u00e7ar B, \u00c7ataly\u00fcrek UV, Aykanat C (2010) A matrix partitioning interface to PaToH in MATLAB. Parallel Computing 36(5\u20136):254\u2013272","journal-title":"Parallel Computing"},{"issue":"1","key":"1_CR27_1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1137\/S0036144502409019","volume":"47","author":"B Vastenhouw","year":"2005","unstructured":"Vastenhouw B, Bisseling RH (2005) A two-dimensional data distribution method for parallel sparse matrix-vector multiplication. SIAM Review 47(1):67\u201395","journal-title":"SIAM Review"}],"container-title":["Encyclopedia of Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-09766-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T13:51:22Z","timestamp":1794318682000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-0-387-09766-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9780387097657","9780387097664"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-09766-4_1","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-09766-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011]]}}}