{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:50:22Z","timestamp":1762390222311,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,7,8]],"date-time":"2006-07-08T00:00:00Z","timestamp":1152316800000},"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":[[2006,7,8]]},"DOI":"10.1145\/1143997.1144189","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"1217-1224","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Geometric crossover for multiway graph partitioning"],"prefix":"10.1145","author":[{"given":"Yong-Hyuk","family":"Kim","sequence":"first","affiliation":[{"name":"Seoul National University, Seoul, Korea"}]},{"given":"Yourim","family":"Yoon","sequence":"additional","affiliation":[{"name":"Seoul National University, Seoul, Korea"}]},{"given":"Alberto","family":"Moraglio","sequence":"additional","affiliation":[{"name":"University of Essex, Colchester, UK"}]},{"given":"Byung-Ro","family":"Moon","sequence":"additional","affiliation":[{"name":"Seoul National University, Seoul, Korea"}]}],"member":"320","published-online":{"date-parts":[[2006,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.762522"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(94)90065-5"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.508322"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1761233.1761349"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/288548.289079"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/337292.337418"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/800263.809204"},{"key":"e_1_3_2_1_8_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M.","year":"1979","unstructured":"Garey , M. , and Johnson , D. S . Computers and Intractability: A Guide to the Theory of NP-Completeness . Freeman , San Francisco , 1979 . Garey, M., and Johnson, D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979."},{"key":"e_1_3_2_1_9_1","volume-title":"VLSI Curcuit Layout Theory and Design","author":"Hu T. C.","year":"1985","unstructured":"Hu , T. C. , and Kuh , E. S . VLSI Curcuit Layout Theory and Design . IEEE Press , New York , 1985 . Hu, T. C., and Kuh, E. S. VLSI Curcuit Layout Theory and Design. IEEE Press, New York, 1985."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.37.6.865"},{"key":"e_1_3_2_1_12_1","first-page":"159","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference","author":"Kang S. J.","year":"2000","unstructured":"Kang , S. J. , and Moon , B. R . A hybrid genetic algorithm for multiway graph partitioning . In Proceedings of the Genetic and Evolutionary Computation Conference ( 2000 ), pp. 159 -- 166 . Kang, S. J., and Moon, B. R. A hybrid genetic algorithm for multiway graph partitioning. In Proceedings of the Genetic and Evolutionary Computation Conference (2000), pp. 159--166."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"e_1_3_2_1_15_1","first-page":"408","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference","author":"Kim J. P.","year":"2001","unstructured":"Kim , J. P. , and Moon , B. R . A hybrid genetic search for multi-way graph partitioning based on direct partitioning . In Proceedings of the Genetic and Evolutionary Computation Conference ( 2001 ), pp. 408 -- 415 . Kim, J. P., and Moon, B. R. A hybrid genetic search for multi-way graph partitioning based on direct partitioning. In Proceedings of the Genetic and Evolutionary Computation Conference (2001), pp. 408--415."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:HEUR.0000019985.94952.eb"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068232"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"e_1_3_2_1_19_1","first-page":"45","volume-title":"Proceedings of the Fourth International Conference on Genetic Algorithms (July","author":"Laszewski G.","year":"1991","unstructured":"Laszewski , G. Intelligent structural operators for the k-way graph partitioning problem . In Proceedings of the Fourth International Conference on Genetic Algorithms (July 1991 ), pp. 45 -- 52 . Laszewski, G. Intelligent structural operators for the k-way graph partitioning problem. In Proceedings of the Fourth International Conference on Genetic Algorithms (July 1991), pp. 45--52."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568103"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24854-5_131"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102256.1102330"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-5362-2"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.8730"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00202749"}],"event":{"name":"GECCO06: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Seattle Washington USA","acronym":"GECCO06"},"container-title":["Proceedings of the 8th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143997.1144189","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1143997.1144189","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:14:11Z","timestamp":1750259651000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143997.1144189"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,8]]},"references-count":24,"alternative-id":["10.1145\/1143997.1144189","10.1145\/1143997"],"URL":"https:\/\/doi.org\/10.1145\/1143997.1144189","relation":{},"subject":[],"published":{"date-parts":[[2006,7,8]]},"assertion":[{"value":"2006-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}