{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:52:56Z","timestamp":1762390376245,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T00:00:00Z","timestamp":1247011200000},"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":[[2009,7,8]]},"DOI":"10.1145\/1569901.1569943","type":"proceedings-article","created":{"date-parts":[[2009,7,21]],"date-time":"2009-07-21T13:32:17Z","timestamp":1248183137000},"page":"293-300","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Fixed-parameter evolutionary algorithms and the vertex cover problem"],"prefix":"10.1145","author":[{"given":"Stefan","family":"Kratsch","sequence":"first","affiliation":[{"name":"Max-Planck-Institute for Computer Science, Saarbruecken, Germany"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut for Computer Science, Saarbruecken, Germany"}]}],"member":"320","published-online":{"date-parts":[[2009,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"434","volume-title":"Proceedings of the Princeton symposium on mathematical programming","author":"Balinski M. L.","year":"1970","unstructured":"M. L. Balinski . On maximum matching, minimum covering and their connections . In Proceedings of the Princeton symposium on mathematical programming , pages 434 -- 445 , 1970 . M. L. Balinski. On maximum matching, minimum covering and their connections. In Proceedings of the Princeton symposium on mathematical programming, pages 434--445, 1970."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1186"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11821069_21"},{"key":"e_1_3_2_1_4_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . MIT Press , 2. edition, 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2. edition, 2001."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389202"},{"key":"e_1_3_2_1_6_1","volume-title":"Parameterized Complexity (Monographs in Computer Science)","author":"Downey R. G.","year":"1998","unstructured":"R. G. Downey and M. R. Fellows . Parameterized Complexity (Monographs in Computer Science) . Springer , November 1998 . R. G. Downey and M. R. Fellows. Parameterized Complexity (Monographs in Computer Science). Springer, November 1998."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374465"},{"key":"e_1_3_2_1_8_1","volume-title":"Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)","author":"Flum J.","year":"2006","unstructured":"J. Flum and M. Grohe . Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) . Springer , March 2006 . J. Flum and M. Grohe. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series). Springer, March 2006."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2009.17.1.3"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277118"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/646517.694055"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580444"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.08.005"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.11.002"},{"key":"e_1_3_2_1_16_1","volume-title":"Proc. of CEC 2007","author":"Oliveto P. S.","year":"1870","unstructured":"P. S. Oliveto , J. He , and X. Yao . Evolutionary algorithms and the vertex cover problem . In Proc. of CEC 2007 , IEEE Press, pages 1870 --1877, 2007. P. S. Oliveto, J. He, and X. Yao. Evolutionary algorithms and the vertex cover problem. In Proc. of CEC 2007, IEEE Press, pages 1870--1877, 2007."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2008.4631000"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JMMA.0000049379.14872.f5"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"L. G.\n      Valiant\n    .\n  Evolvability\n  . In L. Kucera and A. Kucera editors MFCS volume \n  4708\n   of \n  Lecture Notes in Computer Science pages \n  22\n  --\n  43\n  . \n  Springer 2007\n  . Journal version appears in the Journal of ACM.   L. G. Valiant. Evolvability. In L. Kucera and A. Kucera editors MFCS volume 4708 of Lecture Notes in Computer Science pages 22--43. Springer 2007. Journal version appears in the Journal of ACM.","DOI":"10.1007\/978-3-540-74456-6_5"},{"key":"e_1_3_2_1_20_1","first-page":"349","volume-title":"Evolutionary Optimization","author":"Wegener I.","year":"2002","unstructured":"I. Wegener . Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In R. Sarker, X. Yao, and M. Mohammadian, editors, Evolutionary Optimization , pages 349 -- 369 . Kluwer , 2002 . I. Wegener. Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In R. Sarker, X. Yao, and M. Mohammadian, editors, Evolutionary Optimization, pages 349--369. Kluwer, 2002."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_4"}],"event":{"name":"GECCO09: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Montreal Qu\u00e9bec Canada","acronym":"GECCO09"},"container-title":["Proceedings of the 11th Annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1569901.1569943","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1569901.1569943","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:49Z","timestamp":1750249069000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1569901.1569943"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,8]]},"references-count":21,"alternative-id":["10.1145\/1569901.1569943","10.1145\/1569901"],"URL":"https:\/\/doi.org\/10.1145\/1569901.1569943","relation":{},"subject":[],"published":{"date-parts":[[2009,7,8]]},"assertion":[{"value":"2009-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}