{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:03:41Z","timestamp":1760709821689,"version":"3.37.3"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/tevc.2019.2896951","type":"journal-article","created":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T19:37:25Z","timestamp":1549309045000},"page":"962-971","source":"Crossref","is-referenced-by-count":7,"title":["Evolutionary $n$ -Level Hypergraph Partitioning With Adaptive Coarsening"],"prefix":"10.1109","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3351-8132","authenticated-orcid":false,"given":"Richard J.","family":"Preen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jim","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00006"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892764"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2007.02.003"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24855-2_116"},{"key":"ref31","first-page":"124","article-title":"Experimental study: Hypergraph partitioning based on the simple and advanced genetic algorithm BMDA and BOA","author":"schwarz","year":"1999","journal-title":"Proc 5th Int Mendel Conf Soft Comput"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0888-613X(02)00093-2"},{"journal-title":"Proceedings of SAT Competition 2014","year":"2014","author":"belov","key":"ref37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/274535.274546"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205475"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.11.002"},{"key":"ref40","first-page":"1","article-title":"Statistical comparisons of classifiers over multiple data sets","volume":"7","author":"dem\u0161ar","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1090\/conm\/588\/11704","article-title":"UMPa: A multi-objective, multi-level partitioner for communication minimization","volume":"588","author":"\u00e7ataly\u00fcrek","year":"2013","journal-title":"Graph Partitioning and Graph Clustering ser Contemporary Mathematics"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974317.5"},{"key":"ref13","first-page":"1","article-title":"Improving coarsening schemes for hypergraph partitioning by exploiting community structure","volume":"75","author":"heuer","year":"2017","journal-title":"Proc 16th Int Symp Exp Algorithms (SEA)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1982.1585498"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15775-2_24"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974768.3"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3748-6_3"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOGO.0000042115.44455.f3"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568103"},{"article-title":"Parallel algorithms for hypergraph partitioning","year":"2006","author":"trifunovi?","key":"ref4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601837"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2577024"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/43.712098"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI.2016.7849930"},{"article-title":"Hypergraph partitioning in the cloud","year":"2016","author":"lotfifar","key":"ref5"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/71.780863","article-title":"Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication","volume":"11","author":"\u00e7ataly\u00fcrek","year":"1999","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/92.748202"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1162\/1063656041774947"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2006.1639359"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","author":"lengauer","year":"1990","journal-title":"Combinatorial Algorithms for Integrated Circuit Layout"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v35i3.2460"},{"key":"ref45","first-page":"525","article-title":"BOA: The Bayesian optimization algorithm","author":"pelikan","year":"1999","journal-title":"Proc GECCO"},{"journal-title":"PaToH Partitioning Tool for Hypergraphs","year":"2011","author":"\u00e7ataly\u00fcrek","key":"ref22"},{"article-title":"Engineering initial partitioning algorithms for direct k-way hypergraph partitioning","year":"2015","author":"heuer","key":"ref21"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69432-8_3"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2136346"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(94)90065-5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001642"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2617301"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2671868"},{"key":"ref43","first-page":"329","article-title":"Parameter perturbation mechanisms in binary coded GAs with self-adaptive mutation","author":"smith","year":"2003","journal-title":"Foundations of Genetic Algorithms 7"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972924.2"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4235\/8915878\/08633939.pdf?arnumber=8633939","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:41:29Z","timestamp":1628624489000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8633939\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":45,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2019.2896951","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"type":"print","value":"1089-778X"},{"type":"print","value":"1089-778X"},{"type":"electronic","value":"1941-0026"}],"subject":[],"published":{"date-parts":[[2019,12]]}}}