{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T23:57:30Z","timestamp":1794527850663,"version":"4.9.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319449524","type":"print"},{"value":"9783319449531","type":"electronic"}],"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-44953-1_10","type":"book-chapter","created":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T11:12:23Z","timestamp":1471864343000},"page":"147-156","source":"Crossref","is-referenced-by-count":1,"title":["Propagation via Kernelization: The Vertex Cover Constraint"],"prefix":"10.1007","author":[{"given":"Cl\u00e9ment","family":"Carbonnel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emmanuel","family":"Hebrard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/s00224-007-1328-0","volume":"41","author":"FN Abu-Khzam","year":"2007","unstructured":"Abu-Khzam, F.N., Fellows, M.R., Langston, M.A., Suters, W.H.: Crown structures for vertex cover kernelization. Theory Comput. Syst. 41(3), 411\u2013430 (2007)","journal-title":"Theory Comput. Syst."},{"key":"10_CR2","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall Inc., Upper Saddle River (1993)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N.: Pruning for the minimum constraint family and for the number of distinct values constraint family. In: CP, pp. 211\u2013224 (2001)","DOI":"10.1007\/3-540-45578-7_15"},{"key":"10_CR4","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Quimper, C.-G., Walsh, T.: The parameterized complexity of global constraints. In: AAAI, pp. 235\u2013240 (2008)"},{"issue":"4","key":"10_CR5","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s10601-006-9001-9","volume":"11","author":"C Bessiere","year":"2006","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: Filtering algorithms for the NValue constraint. Constraints 11(4), 271\u2013293 (2006)","journal-title":"Constraints"},{"issue":"3","key":"10_CR6","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1137\/0222038","volume":"22","author":"JF Buss","year":"1993","unstructured":"Buss, J.F., Goldsmith, J.: Nondeterminism within p $$^{*}$$ . SIAM J. Comput. 22(3), 560\u2013572 (1993)","journal-title":"SIAM J. Comput."},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/11821069_21","volume-title":"Mathematical Foundations of Computer Science 2006","author":"J Chen","year":"2006","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved parameterized upper bounds for vertex cover. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 238\u2013249. Springer, Heidelberg (2006)"},{"issue":"3","key":"10_CR8","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/j.dam.2007.03.026","volume":"156","author":"M Chleb\u00edk","year":"2008","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Crown reductions for the minimum weighted vertex cover problem. Discrete Appl. Math. 156(3), 292\u2013312 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10_CR9","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/j.tcs.2005.10.004","volume":"351","author":"P Damaschke","year":"2006","unstructured":"Damaschke, P.: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theor. Comput. Sci. 351(3), 337\u2013350 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Fages, J.-G., Lap\u00e8gue, T.: Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem. In: CP, pp. 63\u201379 (2013)","DOI":"10.1007\/978-3-642-40627-0_8"},{"key":"10_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)"},{"key":"10_CR12","unstructured":"Gaspers, S., Szeider, S.: Kernels for global constraints. In: IJCAI, pp. 540\u2013545 (2011)"},{"key":"10_CR13","unstructured":"Hebrard, E.: Mistral, a constraint satisfaction library. In: The Third International CSP Solver Competition, pp. 31\u201340 (2008)"},{"issue":"4","key":"10_CR14","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n $$^{\\text{5\/2 }}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10_CR15","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"GL Nemhauser","year":"1975","unstructured":"Nemhauser, G.L., Trotter Jr., L.E.: Vertex packings: structural properties and algorithms. Math. Program. 8(1), 232\u2013248 (1975)","journal-title":"Math. Program."},{"key":"10_CR16","unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: AAAI, pp. 362\u2013367 (1994)"},{"key":"10_CR17","unstructured":"Samer, M., Szeider, S.: Backdoor trees. In: AAAI, vol. 8, pp. 13\u201317 (2008)"},{"issue":"4\u20135","key":"10_CR18","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10732-006-6550-4","volume":"12","author":"W-J Hoeve van","year":"2006","unstructured":"van Hoeve, W.-J., Pesant, G., Rousseau, L.-M.: On global warming: flow-based soft global constraints. J. Heuristics 12(4\u20135), 347\u2013373 (2006)","journal-title":"J. Heuristics"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44953-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:07:50Z","timestamp":1498324070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44953-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449524","9783319449531"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1_10","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}