{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:12:28Z","timestamp":1750219948933,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T00:00:00Z","timestamp":1693353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2144080"],"award-info":[{"award-number":["2144080"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,30]]},"DOI":"10.1145\/3594805.3607133","type":"proceedings-article","created":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T11:03:28Z","timestamp":1690801408000},"page":"27-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Antimagic Labelings of Trees by Evolutionary Search"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-2781-266X","authenticated-orcid":false,"given":"Luke","family":"Branson","sequence":"first","affiliation":[{"name":"Algorithmic Evolution Lab, Department of Computer Science, University of Minnesota Duluth, Duluth, MN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1295-6715","authenticated-orcid":false,"given":"Andrew M.","family":"Sutton","sequence":"additional","affiliation":[{"name":"Algorithmic Evolution Lab, Department of Computer Science, University of Minnesota Duluth, Duluth, MN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2309-8034","authenticated-orcid":false,"given":"Xiankun","family":"Yan","sequence":"additional","affiliation":[{"name":"Optimisation and Logistics Group, School of Computer Science, University of Adelaide, Adelaide, SA, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,8,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3160715"},{"key":"e_1_3_2_1_2_1","volume-title":"McKay","author":"Aldred R. E. L.","year":"1998","unstructured":"R. E. L. Aldred and Brendan D. McKay. 1998. Graceful and harmonious labellings of trees. Bulletin of the Institute of Combinatorics and its Applications 23 (1998), 69--72."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20027"},{"volume-title":"Magic and Antimagic Graphs: Attributes, Observations and Challenges in Graph Labelings","author":"Ba\u010da Martin","key":"e_1_3_2_1_4_1","unstructured":"Martin Ba\u010da, Mirka Miller, Joe Ryan, and Andrea Semani\u010dov\u00e1-Fe\u0148ov\u010d\u00edkov\u00e1. 2019. Magic and Antimagic Graphs: Attributes, Observations and Challenges in Graph Labelings. Springer."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2006.07290"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528855"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-019-09681-3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.21905"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11786-014-0213-x"},{"key":"e_1_3_2_1_10_1","volume-title":"Perkins","author":"Ernstberger Jon","year":"2013","unstructured":"Jon Ernstberger and Andy D. Perkins. 2013. A Metaheuristic Search Technique for Graceful Labels of Graphs. Technical Report. LaGrange College. Presented at the 44th annual Southeastern International Conference on Combinatorics, Graph Theory, and Computing."},{"key":"e_1_3_2_1_11_1","volume-title":"A Computational Approach to the Graceful Tree Conjecture. CoRR abs\/1003.3045","author":"Fang Wenjie","year":"2010","unstructured":"Wenjie Fang. 2010. A Computational Approach to the Graceful Tree Conjecture. CoRR abs\/1003.3045 (2010). arXiv:1003.3045 http:\/\/arxiv.org\/abs\/1003.3045"},{"key":"e_1_3_2_1_12_1","volume-title":"A dynamic survey of graph labeling. Electronic Journal of Combinatorics","author":"Gallian Joseph A.","year":"2022","unstructured":"Joseph A. Gallian. 2022. A dynamic survey of graph labeling. Electronic Journal of Combinatorics (2022). Dynamic Surveys #DS6."},{"volume-title":"Pearls in Graph Theory","author":"Hartsfield Nora","key":"e_1_3_2_1_13_1","unstructured":"Nora Hartsfield and Gerhard Ringel. 1990. Pearls in Graph Theory. Academic Press, Boston."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:NACO.0000023417.31393.c7"},{"key":"e_1_3_2_1_15_1","volume-title":"Graceful Trees: Statistics and Algorithms. Bachelor's Thesis","author":"Horton Michael","year":"2003","unstructured":"Michael Horton. 2003. Graceful Trees: Statistics and Algorithms. Bachelor's Thesis. University of Tasmania."},{"volume-title":"Entry A000055 in The On-Line Encyclopedia of Integer Sequences. https:\/\/oeis.org\/A000055","author":"OEIS Foundation Inc. 2023.","key":"e_1_3_2_1_16_1","unstructured":"OEIS Foundation Inc. 2023. Entry A000055 in The On-Line Encyclopedia of Integer Sequences. https:\/\/oeis.org\/A000055."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/3929.3937"},{"volume-title":"The Art of Computer Programming, Volume 3: Sorting and Searching","author":"Knuth Donald","key":"e_1_3_2_1_18_1","unstructured":"Donald Knuth. 1998. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00009-020-01688-z"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SIS.2007.368030"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107200"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10852-005-2584-0"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.11.022"},{"key":"e_1_3_2_1_24_1","first-page":"276","article-title":"Product Dimension of Uniform Spider","volume":"11","author":"Shinde Pramod","year":"2022","unstructured":"Pramod Shinde, Samina Boxwala, Aditi Phadke, Nilesh Mundlik, and Vikas Jadhav. 2022. Product Dimension of Uniform Spider. Palestine Journal of Mathematics 11, 4 (2022), 276--281.","journal-title":"Palestine Journal of Mathematics"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215039"}],"event":{"name":"FOGA '23: Foundations of Genetic Algorithms XVII","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Potsdam Germany","acronym":"FOGA '23"},"container-title":["Proceedings of the 17th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3594805.3607133","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3594805.3607133","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3594805.3607133","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3594805.3607133","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:01Z","timestamp":1750182541000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3594805.3607133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,30]]},"references-count":25,"alternative-id":["10.1145\/3594805.3607133","10.1145\/3594805"],"URL":"https:\/\/doi.org\/10.1145\/3594805.3607133","relation":{},"subject":[],"published":{"date-parts":[[2023,8,30]]},"assertion":[{"value":"2023-08-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}