{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T13:11:04Z","timestamp":1774962664598,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T00:00:00Z","timestamp":1657324800000},"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":[[2022,7,9]]},"DOI":"10.1145\/3520304.3529050","type":"proceedings-article","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T15:29:44Z","timestamp":1658244584000},"page":"168-171","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Multilevel memetic hypergraph partitioning with greedy recombination"],"prefix":"10.1145","author":[{"given":"Utku Umur","family":"Acikalin","sequence":"first","affiliation":[{"name":"TOBB University of Economics and Technology, Ankara, TURKEY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bugra","family":"Caskurlu","sequence":"additional","affiliation":[{"name":"TOBB University of Economics and Technology, Ankara, TURKEY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"New Results on Test-Cost Minimization in Database Migration. In International Symposium on Algorithmic Aspects of Cloud Computing. Springer, 38--55","author":"Acikalin Utku Umur","year":"2021","unstructured":"Utku Umur Acikalin, Bugra Caskurlu, Piotr Wojciechowski, and K Subramani. 2021. New Results on Test-Cost Minimization in Database Migration. In International Symposium on Algorithmic Aspects of Cloud Computing. Springer, 38--55."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205475"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_2_1_4_1","volume-title":"Recent advances in graph partitioning. Algorithm engineering","author":"Bulu\u00e7 Aydin","year":"2016","unstructured":"Aydin Bulu\u00e7, Henning Meyerhenke, Ilya Safro, Peter Sanders, and Christian Schulz. 2016. Recent advances in graph partitioning. Algorithm engineering (2016), 117--158."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.780863"},{"key":"e_1_3_2_1_6_1","volume-title":"Advances in Evolutionary Computing","author":"Cohoon James","unstructured":"James Cohoon, John Kairo, and Jens Lienig. 2003. Evolutionary algorithms for the physical design of VLSI circuits. In Advances in Evolutionary Computing. Springer, 683--711."},{"key":"e_1_3_2_1_7_1","volume-title":"19th design automation conference","author":"Fiduccia Charles M","unstructured":"Charles M Fiduccia and Robert M Mattheyses. 1982. A linear-time heuristic for improving network partitions. In 19th design automation conference. IEEE, 175--181."},{"key":"e_1_3_2_1_8_1","volume-title":"Advanced Flow-Based Multilevel Hypergraph Partitioning. In 18th International Symposium on Experimental Algorithms.","author":"Gottesb\u00fcren Lars","year":"2020","unstructured":"Lars Gottesb\u00fcren, Michael Hamann, Sebastian Schlag, and Dorothea Wagner. 2020. Advanced Flow-Based Multilevel Hypergraph Partitioning. In 18th International Symposium on Experimental Algorithms."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3329872"},{"key":"e_1_3_2_1_10_1","volume-title":"16th International Symposium on Experimental Algorithms (SEA","author":"Heuer Tobias","year":"2017","unstructured":"Tobias Heuer and Sebastian Schlag. 2017. Improving coarsening schemes for hypergraph partitioning by exploiting community structure. In 16th International Symposium on Experimental Algorithms (SEA 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.748202"},{"key":"e_1_3_2_1_12_1","volume-title":"Multilevel k-way hypergraph partitioning. VLSI design 11, 3","author":"Karypis George","year":"2000","unstructured":"George Karypis and Vipin Kumar. 2000. Multilevel k-way hypergraph partitioning. VLSI design 11, 3 (2000), 285--300."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1120017.1716566"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.8730"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974317.5"},{"key":"e_1_3_2_1_16_1","volume-title":"High-Quality Hypergraph Partitioning. arXiv preprint arXiv:2106.08696","author":"Schlag Sebastian","year":"2021","unstructured":"Sebastian Schlag, Tobias Heuer, Lars Gottesb\u00fcren, Yaroslav Akhremtsev, Christian Schulz, and Peter Sanders. 2021. High-Quality Hypergraph Partitioning. arXiv preprint arXiv:2106.08696 (2021)."},{"key":"e_1_3_2_1_17_1","volume-title":"International Symposium on Algorithmic Aspects of Cloud Computing. Springer, 103--121","author":"Subramani K","year":"2019","unstructured":"K Subramani, Bugra Caskurlu, and Utku Umur Acikalin. 2019. Security-aware database migration planning. In International Symposium on Algorithmic Aspects of Cloud Computing. Springer, 103--121."},{"key":"e_1_3_2_1_18_1","volume-title":"International Symposium on Algorithmic Aspects of Cloud Computing. Springer, 1--12","author":"Subramani K","year":"2018","unstructured":"K Subramani, Bugra Caskurlu, and Alvaro Velasquez. 2018. Minimization of testing costs in capacity-constrained database migration. In International Symposium on Algorithmic Aspects of Cloud Computing. Springer, 1--12."},{"key":"e_1_3_2_1_19_1","volume-title":"Hybrid Metaheuristics","author":"Walshaw Chris","unstructured":"Chris Walshaw. 2008. Multilevel refinement for combinatorial optimisation: Boosting metaheuristic performance. In Hybrid Metaheuristics. Springer, 261--289."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/288548.289078"},{"key":"e_1_3_2_1_21_1","volume-title":"Breakthroughs in statistics","author":"Wilcoxon Frank","unstructured":"Frank Wilcoxon. 1992. Individual comparisons by ranking methods. In Breakthroughs in statistics. Springer, 196--202."}],"event":{"name":"GECCO '22: Genetic and Evolutionary Computation Conference","location":"Boston Massachusetts","acronym":"GECCO '22","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3520304.3529050","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3520304.3529050","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:22Z","timestamp":1750183762000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3520304.3529050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,9]]},"references-count":21,"alternative-id":["10.1145\/3520304.3529050","10.1145\/3520304"],"URL":"https:\/\/doi.org\/10.1145\/3520304.3529050","relation":{},"subject":[],"published":{"date-parts":[[2022,7,9]]},"assertion":[{"value":"2022-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}