{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T21:14:47Z","timestamp":1780434887532,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":57,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,2]],"date-time":"2018-07-02T00:00:00Z","timestamp":1530489600000},"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":[[2018,7,2]]},"DOI":"10.1145\/3205455.3205475","type":"proceedings-article","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T12:30:37Z","timestamp":1530621037000},"page":"347-354","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Memetic multilevel hypergraph partitioning"],"prefix":"10.1145","author":[{"given":"Robin","family":"Andre","sequence":"first","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastian","family":"Schlag","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[{"name":"University of Vienna, Vienna, Autria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,7,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.825852"},{"key":"e_1_3_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."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/274535.274546"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.712098"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","unstructured":"C.J. Alpert and A. B. Kahng. 1995. Recent Directions in Netlist Partitioning: a Survey. Integration the VLSI Journal 19 1--2 (1995) 1 -- 81. 10.1016\/0167-9260(95)00008-4","DOI":"10.1016\/0167-9260(95)00008-4"},{"key":"e_1_3_2_1_6_1","volume-title":"An Integrated Genetic Algorithm With Dynamic Hill Climbing for VLSI Circuit Partitioning. In Genetic and Evolutionary Computation Conference, (GECCO). 97--102","author":"Areibi S.","year":"2000","unstructured":"S. Areibi. 2000. An Integrated Genetic Algorithm With Dynamic Hill Climbing for VLSI Circuit Partitioning. In Genetic and Evolutionary Computation Conference, (GECCO). 97--102."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1162\/1063656041774947"},{"key":"e_1_3_2_1_8_1","volume-title":"23rd Canadian Conference on Electrical and Computer Engineering, (CCECE). IEEE, 1--6.","author":"Armstrong E.","unstructured":"E. Armstrong, G. W. Grewal, S. Areibi, and G. Darlington. 2010. An investigation of parallel memetic algorithms for VLSI circuit partitioning on multi-core computers. In 23rd Canadian Conference on Electrical and Computer Engineering, (CCECE). IEEE, 1--6."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.09.006"},{"key":"e_1_3_2_1_11_1","unstructured":"A. Belov D. Diepold M. Heule and M. J\u00e4rvisalo. 2014. The SAT Competition 2014. http:\/\/www.satcompetition.org\/2014\/. (2014)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2136346"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1996.4.4.361"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/196244.196607"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"A. Bulu\u00e7 H. Meyerhenke I. Safro P. Sanders and C. Schulz. 2016. Recent Advances in Graph Partitioning. In Algorithm Engineering - Selected Results and Surveys. Springer 117--158.","DOI":"10.1007\/978-3-319-49487-6_4"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.780863"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.70760"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","unstructured":"J. Cohoon J. Kairo and J. Lienig. 2003. Evolutionary Algorithms for the Physical Design of VLSI Circuits. Springer 683--711.","DOI":"10.5555\/903758.903786"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1177\/1536867X1101100112"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/3027779"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.108"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.12.002"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1898953.1899056"},{"key":"e_1_3_2_1_25_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."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.5.860"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/800263.809204"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/534133"},{"key":"e_1_3_2_1_29_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."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/129194"},{"key":"e_1_3_2_1_31_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.","journal-title":"Chapter"},{"key":"e_1_3_2_1_32_1","volume-title":"Circuit partitioning with genetic algorithms using a coding scheme to preserve the structure of a circuit","author":"Hulin M.","unstructured":"M. Hulin. 1991. Circuit partitioning with genetic algorithms using a coding scheme to preserve the structure of a circuit. Springer, 75--79."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137650"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.748202"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/309847.309954"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001642"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24855-2_116"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:HEUR.0000019985.94952.eb"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/92429"},{"key":"e_1_3_2_1_40_1","volume-title":"Fifth 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. Fifth Pragmatics of SAT workshop (EPiC Series in Computing), Daniel Le Berre (Ed.), Vol. 27. EasyChair, 41--56."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"P. Moscato and C. Cotta. 2010. A Modern Introduction to Memetic Algorithms. Springer US 141--183.","DOI":"10.1007\/978-1-4419-1665-5_6"},{"key":"e_1_3_2_1_43_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.","DOI":"10.1201\/9781420010749.ch61"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/648159.749847"},{"key":"e_1_3_2_1_45_1","volume-title":"MCNC. Technical Report. Physical Design Workshop.","author":"Roberts K.","unstructured":"K. Roberts and Preas B. 1987. MCNC. Technical Report. Physical Design Workshop."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/74382.74525"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.8730"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/2040572.2040624"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/2790265.2790267"},{"key":"e_1_3_2_1_50_1","volume-title":"Act Globally: Highly Balanced Graph Partitioning. In 12th International Symposium on Experimental Algorithms, (SEA)","volume":"7933","author":"Sanders P.","unstructured":"P. Sanders and C. Schulz. 2013. Think Locally, Act Globally: Highly Balanced Graph Partitioning. In 12th International Symposium on Experimental Algorithms, (SEA), Vol. 7933. Springer, 164--175."},{"key":"e_1_3_2_1_51_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."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOGO.0000042115.44455.f3"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.11.002"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","unstructured":"\u00dc. V. \u00c7ataly\u00fcrek and M. Deveci and K. Kaya and B. U\u00e7ar. 2012. UMPa: A multi-objective multi-level partitioner for communication minimization. In Graph Partitioning and Clustering - 10th DIMACS Implementation Challenge. 53--66.","DOI":"10.1090\/conm\/588\/11704"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144502409019"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228500"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000039525.80601.15"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/288548.289078"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.2307\/3001968"}],"event":{"name":"GECCO '18: Genetic and Evolutionary Computation Conference","location":"Kyoto Japan","acronym":"GECCO '18","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205455.3205475","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3205455.3205475","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:56Z","timestamp":1750208936000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205455.3205475"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,2]]},"references-count":57,"alternative-id":["10.1145\/3205455.3205475","10.1145\/3205455"],"URL":"https:\/\/doi.org\/10.1145\/3205455.3205475","relation":{},"subject":[],"published":{"date-parts":[[2018,7,2]]},"assertion":[{"value":"2018-07-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}