{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:42Z","timestamp":1750219782127,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T00:00:00Z","timestamp":1689120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,15]]},"DOI":"10.1145\/3583131.3590501","type":"proceedings-article","created":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T19:40:19Z","timestamp":1689190819000},"page":"1537-1545","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1090-0267","authenticated-orcid":false,"given":"Samuel","family":"Baguley","sequence":"first","affiliation":[{"name":"Hasso-Plattner-Institute, Potsdam University, Potsdam, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0076-6308","authenticated-orcid":false,"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[{"name":"Hasso-Plattner-Institute, Potsdam University, Potsdam, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0036-4782","authenticated-orcid":false,"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[{"name":"University of Adelaide, Adelaide, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2721-3618","authenticated-orcid":false,"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"University of Adelaide, Adelaide, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2480-3073","authenticated-orcid":false,"given":"Marcus","family":"Pappik","sequence":"additional","affiliation":[{"name":"Hasso-Plattner-Institute, Potsdam University, Potsdam, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0378-1458","authenticated-orcid":false,"given":"Ziena","family":"Zeif","sequence":"additional","affiliation":[{"name":"Hasso-Plattner-Institute, Potsdam University, Potsdam, Germany"}]}],"member":"320","published-online":{"date-parts":[[2023,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem. arXiv preprint arXiv:2303.11281","author":"Baguley Samuel","year":"2023","unstructured":"Samuel Baguley , Tobias Friedrich , Aneta Neumann , Frank Neumann , Marcus Pappik , and Ziena Zeif . 2023. Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem. arXiv preprint arXiv:2303.11281 ( 2023 ). Samuel Baguley, Tobias Friedrich, Aneta Neumann, Frank Neumann, Marcus Pappik, and Ziena Zeif. 2023. Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem. arXiv preprint arXiv:2303.11281 (2023)."},{"key":"e_1_3_2_1_2_1","first-page":"1","article-title":"Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems","volume":"3","author":"Branson Luke","year":"2021","unstructured":"Luke Branson and Andrew M. Sutton . 2021 . Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems . In FOGA. ACM , 3 : 1 -- 3 :10. Luke Branson and Andrew M. Sutton. 2021. Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems. In FOGA. ACM, 3:1--3:10.","journal-title":"FOGA. ACM"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2021.26"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29414-4"},{"volume-title":"Parameterized complexity","author":"Downey Rodney G","key":"e_1_3_2_1_5_1","unstructured":"Rodney G Downey and Michael Ralph Fellows . 2012. Parameterized complexity . Springer Science & Business Media . Rodney G Downey and Michael Ralph Fellows. 2012. Parameterized complexity. Springer Science & Business Media."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0127-x"},{"volume-title":"Kernelization: theory of parameterized preprocessing","author":"Fomin Fedor V","key":"e_1_3_2_1_7_1","unstructured":"Fedor V Fomin , Daniel Lokshtanov , Saket Saurabh , and Meirav Zehavi . 2019. Kernelization: theory of parameterized preprocessing . Cambridge University Press . Fedor V Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi. 2019. Kernelization: theory of parameterized preprocessing. Cambridge University Press."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17339-4"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.06.019"},{"key":"e_1_3_2_1_10_1","volume-title":"Frank Neumann, and Pietro Simone Oliveto.","author":"Kratsch Stefan","year":"2010","unstructured":"Stefan Kratsch , Per Kristian Lehre , Frank Neumann, and Pietro Simone Oliveto. 2010 . Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation. In PPSN (1) (Lecture Notes in Computer Science , Vol. 6238). Springer, 204-- 213 . Stefan Kratsch, Per Kristian Lehre, Frank Neumann, and Pietro Simone Oliveto. 2010. Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation. In PPSN (1) (Lecture Notes in Computer Science, Vol. 6238). Springer, 204--213."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9660-4"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.IPEC.2016.20"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1255-7"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0136016"},{"key":"e_1_3_2_1_15_1","volume-title":"Sutton","author":"Neumann Frank","year":"2020","unstructured":"Frank Neumann and Andrew M . Sutton . 2020 . Parameterized Complexity Analysis of Randomized Search Heuristics. In Theory of Evolutionary Computation. Springer , 213--248. Frank Neumann and Andrew M. Sutton. 2020. Parameterized Complexity Analysis of Randomized Search Heuristics. In Theory of Evolutionary Computation. Springer, 213--248."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16544-3"},{"key":"e_1_3_2_1_17_1","volume-title":"Heath","author":"Rosenberg Arnold L.","year":"2001","unstructured":"Arnold L. Rosenberg and Lenwood S . Heath . 2001 . Graph separators with applications. Kluwer . Arnold L. Rosenberg and Lenwood S. Heath. 2001. Graph separators with applications. Kluwer."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00809-8"},{"key":"e_1_3_2_1_19_1","volume-title":"Sutton and Frank Neumann","author":"Andrew","year":"2012","unstructured":"Andrew M. Sutton and Frank Neumann . 2012 . A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling. In PPSN (1) (Lecture Notes in Computer Science , Vol. 7491). Springer, 52-- 61 . Andrew M. Sutton and Frank Neumann. 2012. A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling. In PPSN (1) (Lecture Notes in Computer Science, Vol. 7491). Springer, 52--61."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00119"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2017.04.004"}],"event":{"name":"GECCO '23: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Lisbon Portugal","acronym":"GECCO '23"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583131.3590501","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583131.3590501","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:44Z","timestamp":1750178264000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583131.3590501"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,12]]},"references-count":21,"alternative-id":["10.1145\/3583131.3590501","10.1145\/3583131"],"URL":"https:\/\/doi.org\/10.1145\/3583131.3590501","relation":{},"subject":[],"published":{"date-parts":[[2023,7,12]]},"assertion":[{"value":"2023-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}