{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:43:33Z","timestamp":1725864213898},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319458229"},{"type":"electronic","value":"9783319458236"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45823-6_69","type":"book-chapter","created":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T13:26:31Z","timestamp":1472563591000},"page":"740-750","source":"Crossref","is-referenced-by-count":0,"title":["Fixed-Parameter Single Objective Search Heuristics for Minimum Vertex Cover"],"prefix":"10.1007","author":[{"given":"Wanru","family":"Gao","sequence":"first","affiliation":[]},{"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,31]]},"reference":[{"key":"69_CR1","doi-asserted-by":"crossref","unstructured":"Bringmann, K., Friedrich, T.: Parameterized average-case complexity of the hypervolume indicator. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 575\u2013582 (2013)","DOI":"10.1145\/2463372.2463450"},{"key":"69_CR2","unstructured":"Cai, S., Su, K., Sattar, A.: Two new local search strategies for minimum vertex cover. In: Twenty-Sixth AAAI Conference on Artificial Intelligence (2012)"},{"key":"69_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1162\/EVCO_a_00147","volume":"24","author":"D Corus","year":"2015","unstructured":"Corus, D., Lehre, P.K., Neumann, F., Pourhassan, M.: A parameterised complexity analysis of bi-level optimisation with evolutionary algorithms. Evol. Comput. 24, 183\u2013203 (2015)","journal-title":"Evol. Comput."},{"key":"69_CR4","series-title":"Texts in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, Heidelberg (2013)"},{"key":"69_CR5","unstructured":"Johnson, D.J., Trick, M.A. (eds.): Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11\u201313, 1993. American Mathematical Society, Boston (1996)"},{"key":"69_CR6","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1007\/s00453-012-9660-4","volume":"65","author":"S Kratsch","year":"2013","unstructured":"Kratsch, S., Neumann, F.: Fixed-parameter evolutionary algorithms and the vertex cover problem. Algorithmica 65, 754\u2013771 (2013)","journal-title":"Algorithmica"},{"key":"69_CR7","series-title":"Lecture Notes in Computer Science","first-page":"204","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"S Kratsch","year":"2010","unstructured":"Kratsch, S., Lehre, P.K., Neumann, F., Oliveto, P.S.: Fixed parameter evolutionary algorithms and maximum leaf spanning trees: a matter of mutation. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6238, pp. 204\u2013213. Springer, Heidelberg (2010)"},{"key":"69_CR8","doi-asserted-by":"crossref","unstructured":"Nallaperuma, S., Sutton, A.M., Neumann, F.: Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem. In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC, pp. 2045\u20132052. IEEE (2013)","DOI":"10.1109\/CEC.2013.6557810"},{"key":"69_CR9","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI, pp. 4292\u20134293 (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"69_CR10","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1162\/EVCO_a_00119","volume":"22","author":"AM Sutton","year":"2014","unstructured":"Sutton, A.M., Neumann, F., Nallaperuma, S.: Parameterized runtime analyses of evolutionary algorithms for the planar euclidean traveling salesperson problem. Evol. Comput. 22, 595\u2013628 (2014)","journal-title":"Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XIV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45823-6_69","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T11:01:45Z","timestamp":1657191705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45823-6_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458229","9783319458236"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45823-6_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}