{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T06:58:43Z","timestamp":1781938723189,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T00:00:00Z","timestamp":1720915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"FWF","award":["START Project Y1329"],"award-info":[{"award-number":["START Project Y1329"]}]},{"DOI":"10.13039\/501100007493","name":"Fondation Math\u00e9matique Jacques Hadamard","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007493","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,14]]},"DOI":"10.1145\/3638530.3664062","type":"proceedings-article","created":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T14:54:43Z","timestamp":1722524083000},"page":"63-64","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III)"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0734-0708","authenticated-orcid":false,"given":"Simon","family":"Wietheger","sequence":"first","affiliation":[{"name":"TU Wien, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9786-220X","authenticated-orcid":false,"given":"Benjamin","family":"Doerr","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"PPSN","author":"Bian Chao","year":"2022","unstructured":"Chao Bian and Chao Qian. 2022. Better running time of the non-dominated sorting genetic algorithm II (NSGA-II) by using stochastic tournament selection. In Parallel Problem Solving From Nature, PPSN 2022. Springer, 428--441."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/613"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590421"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i10.26460"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281535"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3250552"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i10.26462"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i10.26461"},{"key":"e_1_3_2_1_10_1","unstructured":"Tudor Ivan Martin S. Krejca and Benjamin Doerr. 2024. Speeding Up the NSGA-II With a Simple Tie-Breaking Rule. (2024). Preprint."},{"key":"e_1_3_2_1_11_1","volume-title":"Evolutionary Multi-Criterion Optimization (Lecture Notes in Computer Science)","author":"Khare Vineet","unstructured":"Vineet Khare, Xin Yao, and Kalyanmoy Deb. 2003. Performance Scaling of Multi-objective Evolutionary Algorithms. In Evolutionary Multi-Criterion Optimization (Lecture Notes in Computer Science). Springer, Berlin, Heidelberg, 376--390."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654218"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.910138"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3296645"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/628"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Simon Wietheger and Benjamin Doerr. 2024. Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms. (2024). Preprint.","DOI":"10.1007\/978-3-031-70085-9_10"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3320278"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i18.30077"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i9.21283"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.03.001"}],"event":{"name":"GECCO '24 Companion: Genetic and Evolutionary Computation Conference Companion","location":"Melbourne VIC Australia","acronym":"GECCO '24 Companion","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\/3638530.3664062","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638530.3664062","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:04:02Z","timestamp":1750291442000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638530.3664062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,14]]},"references-count":20,"alternative-id":["10.1145\/3638530.3664062","10.1145\/3638530"],"URL":"https:\/\/doi.org\/10.1145\/3638530.3664062","relation":{},"subject":[],"published":{"date-parts":[[2024,7,14]]},"assertion":[{"value":"2024-08-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}