{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:34:13Z","timestamp":1759178053449,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031700705"},{"type":"electronic","value":"9783031700712"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-70071-2_9","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:54Z","timestamp":1725663774000},"page":"133-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Evolving Populations of\u00a0Solved Subgraphs with\u00a0Crossover and\u00a0Constraint Repair"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-2250-3315","authenticated-orcid":false,"given":"Jiwon","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1295-6715","authenticated-orcid":false,"given":"Andrew M.","family":"Sutton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Branson, L., Sutton, A.M.: Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems. In: Proceedings of the Sixteenth ACM\/SIGEVO Conference on Foundations of Genetic Algorithms. Association for Computing Machinery, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/3450218.3477304","DOI":"10.1145\/3450218.3477304"},{"issue":"11\u201312","key":"9_CR2","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/S0045-7825(01)00323-1","volume":"191","author":"CA Coello Coello","year":"2002","unstructured":"Coello Coello, C.A.: Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput. Methods Appl. Mech. Eng. 191(11\u201312), 1245\u20131287 (2002). https:\/\/doi.org\/10.1016\/S0045-7825(01)00323-1","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexiy. Springer, New York (1999). https:\/\/doi.org\/10.1007\/978-1-4612-0515-9","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Cham (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X","DOI":"10.1007\/3-540-29953-X"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Friedrich, T., Hebbinghaus, N., Neumann, F., He, J., Witt, C.: Approximating covering problems by randomized search heuristics using multi-objective models. In: Proceedings of the Conference on Genetic and Evolutionary Computation (GECCO), London, UK, pp. 797\u2013804. ACM (2007).https:\/\/doi.org\/10.1145\/1276958.1277118","DOI":"10.1145\/1276958.1277118"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Friedrich, T., et al.: Crossover for cardinality constrained optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO). ACM, July 2022. https:\/\/doi.org\/10.1145\/3512290.3528713","DOI":"10.1145\/3512290.3528713"},{"key":"9_CR7","unstructured":"Goldberg Jr., D.E., Lingle, R.: Alleles, loci, and the traveling salesman problem. In: Grefenstette, J.J. (ed.) Proceedings of the First International Conference on Genetic Algorithms and their Applications (ICGA), Pittsburgh, PA, USA, vol.\u00a0154, pp. 154\u2013159. Lawrence Erlbaum, Hillsdale, NJ (1985)"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Jansen, T., Oliveto, P.S., Zarges, C.: Approximating vertex cover using edge-based representations. In: Neumann, F., Jong, K.A.D. (eds.) Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms (FOGA XII), Adelaide, SA, Australia, 16\u201320 January 2013, pp. 87\u201396. ACM (2013). https:\/\/doi.org\/10.1145\/2460239.2460248","DOI":"10.1145\/2460239.2460248"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Proceedings of a Symposium on the Complexity of Computer Computations, Held 20\u201322 March 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, USA, pp. 85\u2013103. The IBM Research Symposia Series, Plenum Press, New York (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"9_CR10","unstructured":"Khuri, S., B\u00e4ck, T.: An evolutionary heuristic for the minimum vertex cover problem. In: Kunze, J., Stoyan, H. (eds.) Workshops of the Eighteenth Annual German Conference on Artificial Intelligence (KI-1994), pp. 86\u201390, Saarbr\u00fccken, Germany (1994)"},{"issue":"4","key":"9_CR11","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1007\/s00453-012-9660-4","volume":"65","author":"S Kratsch","year":"2012","unstructured":"Kratsch, S., Neumann, F.: Fixed-parameter evolutionary algorithms and the vertex cover problem. Algorithmica 65(4), 754\u2013771 (2012). https:\/\/doi.org\/10.1007\/s00453-012-9660-4","journal-title":"Algorithmica"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Lengler, J.: Drift analysis. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation - Recent Developments in Discrete Optimization, pp. 89\u2013131. Natural Computing Series, Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_2","DOI":"10.1007\/978-3-030-29414-4_2"},{"key":"9_CR13","unstructured":"Mitchell, G.G., O\u2019Donoghue, D., Barnes, D., McCarville, M.: GeneRepair - a repair operator for genetic algorithms. In: Late-Breaking Papers at the Genetic and Evolutionary Computation Conference (GECCO), Chicago, IL, USA, pp. 235\u2013239 (2003). http:\/\/mural.maynoothuniversity.ie\/10351\/"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Moraglio, A.: Abstract convex evolutionary search. In: Proceedings of the Eleventh Workshop on Foundations of Genetic Algorithms (FOGA XI). ACM, January 2011. https:\/\/doi.org\/10.1145\/1967654.1967668","DOI":"10.1145\/1967654.1967668"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"M\u00fchlenbein, H.: Parallel genetic algorithms in combinatorial optimization. In: Balci, O., Sharda, R., Zenios, S.A. (eds.) Computer Science and Operations Research: New Developments in their Interfaces, pp. 441\u2013453. Pergamon Press, Amsterdam (1992). https:\/\/doi.org\/10.1016\/b978-0-08-040806-4.50034-4","DOI":"10.1016\/b978-0-08-040806-4.50034-4"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Neumann, F., Sutton, A.M.: Parameterized complexity analysis of randomized search heuristics. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, pp. 213\u2013248. Natural Computing Series. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_4","DOI":"10.1007\/978-3-030-29414-4_4"},{"issue":"5","key":"9_CR17","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/tevc.2009.2014362","volume":"13","author":"PS Oliveto","year":"2009","unstructured":"Oliveto, P.S., He, J., Yao, X.: Analysis of the (1+1)-EA for finding approximate solutions to vertex cover problems. IEEE Trans. Evol. Comput. 13(5), 1006\u20131029 (2009). https:\/\/doi.org\/10.1109\/tevc.2009.2014362","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9_CR18","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Upper Saddle River (1982)"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Pelikan, M., Kalapala, R., Hartmann, A.K.: Hybrid evolutionary algorithms on minimum vertex cover for random graphs. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), London, UK, pp. 547\u2013554. ACM (2007). https:\/\/doi.org\/10.1145\/1276958.1277073","DOI":"10.1145\/1276958.1277073"},{"key":"9_CR20","unstructured":"Radcliffe, N.J.: Forma analysis and random respectful recombination. In: Proceedings of the Fourth International Conference on Genetic Algorithms (ICGA) (1991)"},{"key":"9_CR21","unstructured":"Spears, W.M., Jong, K.A.D.: On the virtues of parameterized crossover. In: Proceedings of the Fourth International Conference on Genetic Algorithms (ICGA), pp. 230\u2013236 (1991)"},{"issue":"4","key":"9_CR22","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1007\/s00453-021-00809-8","volume":"83","author":"AM Sutton","year":"2021","unstructured":"Sutton, A.M.: Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem. Algorithmica 83(4), 1138\u20131163 (2021). https:\/\/doi.org\/10.1007\/s00453-021-00809-8","journal-title":"Algorithmica"},{"key":"9_CR23","unstructured":"Syswerda, G.: Uniform crossover in genetic algorithms. In: Proceedings of the Third International Conference on Genetic Algorithms (ICGA), vol.\u00a03, pp.\u00a02\u20139 (1989)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70071-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:41Z","timestamp":1725664241000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70071-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700705","9783031700712"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70071-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hagenberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2024.fh-ooe.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}