{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T08:24:03Z","timestamp":1794558243718,"version":"4.9.1"},"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_93","type":"book-chapter","created":{"date-parts":[[2012,1,5]],"date-time":"2012-01-05T08:44:51Z","timestamp":1325753091000},"page":"1479-1487","source":"Crossref","is-referenced-by-count":29,"title":["PaToH (Partitioning Tool for Hypergraphs)"],"prefix":"10.1007","author":[{"given":"\u00dcmit","family":"\u00c7ataly\u00fcrek","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cevdet","family":"Aykanat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1\u20132","key":"93_CR1_93","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","volume":"19","author":"CJ Alpert","year":"1995","unstructured":"Alpert CJ, Kahng AB (1995) Recent directions in netlist partitioning: a survey. VLSI J 19(1\u20132):1\u201381","journal-title":"VLSI J"},{"issue":"5","key":"93_CR2_93","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 (May 2008) Multi-level direct k-way hypergraphy partitioning with multiple constraints and fixed vertices. J Parallel Distrib Comput 68(5):609\u2013625","journal-title":"J Parallel Distrib Comput"},{"issue":"6","key":"93_CR3_93","doi-asserted-by":"crossref","first-page":"1860","DOI":"10.1137\/S1064827502401953","volume":"26","author":"C Aykanat","year":"2004","unstructured":"Aykanat C, Pinar 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":"93_CR4_93","first-page":"445","volume-title":"A heuristic for reducing fill-in sparse matrix factorization","author":"TN Bui","year":"1993","unstructured":"Bui TN, Jones C (1993) A heuristic for reducing fill-in sparse matrix factorization. In: Proceedings of the 6th SIAM conference on parallel processing for scientific computing, Norfolk, Virginia, pp 445\u2013452"},{"issue":"8","key":"93_CR5_93","doi-asserted-by":"crossref","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 L (Aug 2009) A repartitioning hypergraphy model for dynamic load balancing. J Parallel Distrib Comput 69(8):711\u2013724","journal-title":"J Parallel Distrib Comput"},{"key":"93_CR6_93","unstructured":"\u00c7ataly\u00fcrek UV (1999) Hypergraph models for sparse matrix partitioning and reordering. Ph.D.thesis, Bilkent University, Computer Engineering and Information Science, Nov 1999. http:\/\/www.cs.bilkent.edu.tr\/tech-reports\/1999\/ABSTRACTS.1999.html."},{"key":"93_CR7_93","volume-title":"Proceedings of international conference on high performance computing","author":"UV \u00c7ataly\u00fcrek","year":"1995","unstructured":"\u00c7ataly\u00fcrek UV, Aykanat C (Dec 1995) A hypergraph model for mapping repeated sparse matrixvector product computations onto multicomputers. In: Proceedings of international conference on high performance computing"},{"issue":"7","key":"93_CR8_93","doi-asserted-by":"crossref","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 Distrib Syst 10(7):673\u2013693","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"93_CR9_93","unstructured":"\u00c7ataly\u00fcrek UV, Aykanat C (1999) PaToH: a multilevel hypergraph partitioning tool, version 3.0. Bilkent University, Department of Computer Engineering, Ankara, 06533 Turkey.PaToH. http:\/\/bmi.osu.edu\/\u223cumit\/software.html, 1999 (accessed on November 26, 2010)"},{"key":"93_CR10_93","volume-title":"Ahypergraph-partitioning approach for coarse-grain decomposition","author":"UV \u00c7ataly\u00fcrek","year":"2001","unstructured":"\u00c7ataly\u00fcrek UV, Aykanat C (2001) Ahypergraph-partitioning approach for coarse-grain decomposition. In: ACM\/EEE SC2001, Denver, CO, November\u00a02001"},{"key":"93_CR11_93","unstructured":"\u00c7ataly\u00fcrek UV, Aykanat C, Kayaaslan E (2009) Hypergraph partitioning-based_ll-reducing ordering. Technical Report OSUBMI-TR-2009-n02 and BU-CE-0904, The Ohio State University, Department of Biomedical Informatics and Bilkent University, Computer Engineering Department, 2009. submitted for publication"},{"issue":"2","key":"93_CR12_93","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/080737770","volume":"32","author":"UV \u00c7ataly\u00fcrek","year":"2010","unstructured":"\u00c7ataly\u00fcrek UV, Aykanat C, Ucar B (2010) Ontwo-dimensional sparse matrix partitioning: models, methods, and a recipe. SIAM J Sci Comput 32(2):656\u2013683","journal-title":"SIAM J Sci Comput"},{"issue":"12","key":"93_CR13_93","doi-asserted-by":"crossref","first-page":"1502","DOI":"10.1109\/43.103500","volume":"10","author":"C-K Cheng","year":"1991","unstructured":"Cheng C-K, Wei Y-C (1991) An improved two-way partitioning algorithm with stable performance. IEEE Trans Comput Aided Des 10(12):1502\u20131511","journal-title":"IEEE Trans Comput Aided Des"},{"issue":"2","key":"93_CR14_93","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1109\/43.573831","volume":"16","author":"A Dasdan","year":"1997","unstructured":"Dasdan A, Aykanat C (February 1997) Two novel multiway circuit partitioning algorithms using relaxed locking. IEEE Trans Comput Aided Des 16(2):169\u2013178","journal-title":"IEEE Trans Comput Aided Des"},{"key":"93_CR15_93","first-page":"175","volume-title":"A linear-time heuristic for improving network partitions","author":"CM Fiduccia","year":"1982","unstructured":"Fiduccia CM, Mattheyses RM (1982) A linear-time heuristic for improving network partitions. In: Proceedings of the 19th ACM\/IEEE design automation conference, pp 175\u2013181"},{"key":"93_CR16_93","volume-title":"A multilevel algorithm for partitioning graphs","author":"B Hendrickson","year":"1993","unstructured":"Hendrickson B, Leland R (1993) A multilevel algorithm for partitioning graphs. Technical reports, Sandia National Laboratories"},{"key":"93_CR17_93","first-page":"173","volume-title":"Proceedings of IEEE international symposium on circuits and systems","author":"A Hoffmann","year":"1994","unstructured":"Hoffmann A (1994) Dynamic locking heuristic\u00a0\u2013 a new graph partitioning algorithm. In: Proceedings of IEEE international symposium on circuits and systems, pp 173\u2013176"},{"issue":"1","key":"93_CR18_93","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359\u2013392","journal-title":"SIAM J Sci Comput"},{"key":"93_CR19_93","series-title":"Technical Report98-019","volume-title":"Multilevel algorithms for multi-constraint graph partitioning","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998) Multilevel algorithms for multi-constraint graph partitioning. Technical Report98-019, University of Minnesota, Department of Computer Science\/Army HPC Research Center, Minneapolis, MN 55455, May\u00a01998"},{"issue":"2","key":"93_CR20_93","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan BW, Lin S (Feb 1970) An efficient heuristic procedure for partitioning graphs. Bell SystTech J 49(2):291\u2013307","journal-title":"Bell SystTech J"},{"issue":"5","key":"93_CR21_93","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1109\/TC.1984.1676460","volume":"33","author":"B Krishnamurthy","year":"1984","unstructured":"Krishnamurthy B (May 1984) An improved min-cut algorithm for partitioning VLSI networks. IEEE Trans Comput 33(5):438\u2013446","journal-title":"IEEE Trans Comput"},{"key":"93_CR22_93","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial algorithms for integrated circuitlayout","author":"T Lengauer","year":"1990","unstructured":"Lengauer T (1990) Combinatorial algorithms for integrated circuitlayout. Willey\u2013Teubner, Chichester,\u00a0UK"},{"issue":"1","key":"93_CR23_93","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/12.8730","volume":"38","author":"LA Sanchis","year":"1989","unstructured":"Sanchis LA (Jan 1989) Multiple-way network partitioning. IEEE Trans Comput 38(1):62\u201381","journal-title":"IEEE Trans Comput"},{"key":"93_CR24_93","first-page":"296","volume-title":"Euro-Par","author":"K Schloegel","year":"2000","unstructured":"Schloegel K, Karypis G, Kumar V (2000) Parallel multilevel algorithms for multi-constraint graph partitioning. In: Euro-Par, pp 296\u2013310"},{"key":"93_CR25_93","first-page":"57","volume-title":"A proper model for the partitioning of electrical circuits","author":"DG Schweikert","year":"1972","unstructured":"Schweikert DG, Kernighan BW (1972) A proper model for the partitioning of electrical circuits. In: Proceedings of the 9th ACM\/IEEE design automation conference, pp\u00a057\u201362"},{"issue":"5\u20136","key":"93_CR26_93","doi-asserted-by":"crossref","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 \u00dcV, Aykanat C (2010) A matrix partitioning interface to PaToH in MATLAB. Parallel Comput 36(5\u20136):254\u2013272","journal-title":"Parallel Comput"},{"issue":"7","key":"93_CR27_93","first-page":"91","volume":"10","author":"Y-C Wei","year":"1991","unstructured":"Wei Y-C, Cheng C-K (July 1991) Ratio cut partitioning for hierarchical designs. IEEE Trans Comput Aided Des 10(7):91\u2013921","journal-title":"IEEE Trans Comput Aided Des"}],"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_93","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T13:48:32Z","timestamp":1794318512000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-0-387-09766-4_93"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9780387097657","9780387097664"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-09766-4_93","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]]}}}