{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:49:43Z","timestamp":1725511783597},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-70918-3_29","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"332-343","source":"Crossref","is-referenced-by-count":1,"title":["The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting"],"prefix":"10.1007","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","volume-title":"Encyclopedia of Genetics, Genomics, Proteomics and Bioinformatics","author":"V. Bafna","year":"2005","unstructured":"Bafna, V., Reinert, K.: Mass spectrometry and computational proteomics. In: Encyclopedia of Genetics, Genomics, Proteomics and Bioinformatics, Wiley, Chichester (2005)"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0166-218X(01)00327-4","volume":"124","author":"E. Boros","year":"2002","unstructured":"Boros, E., Golumbic, M.C., Levit, V.E.: On the number of vertices belonging to all maximum stable sets of a graph. Discrete Appl. Math.\u00a0124, 17\u201325 (2002)","journal-title":"Discrete Appl. Math."},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.1016\/j.jcss.2006.04.007","volume":"72","author":"J. Chen","year":"2006","unstructured":"Chen, J., et al.: Strong computational lower bounds via paramterized complexity. J. Comp. and System Sci.\u00a072, 1346\u20131367 (2006)","journal-title":"J. Comp. and System Sci."},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/11847250_20","volume-title":"Parameterized and Exact Computation","author":"J. Chen","year":"2006","unstructured":"Chen, J., et al.: On the effective enumerability of NP problems. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 215\u2013226. Springer, Heidelberg (2006)"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a04162, pp. 238\u2013249. Springer, Heidelberg (2006)"},{"key":"29_CR6","unstructured":"Chlebik, M., Chlebikova, J.: Crown reductions for the minimum weighted vertex cover problem. ECCC Report 101, to appear in Discrete Appl. Math. (2004)"},{"key":"29_CR7","unstructured":"Cicalese, F.: Center for Biotechnology, Univ. Bielefeld (personal communication)"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Parameterized and Exact Computation","author":"P. Damaschke","year":"2004","unstructured":"Damaschke, P.: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction, Theoretical Computer Science 351. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 1\u201312. Springer, Heidelberg (2004)"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/3-540-45655-4_60","volume-title":"Computing and Combinatorics","author":"H. Fernau","year":"2002","unstructured":"Fernau, H.: On parameterized enumeration. In: H. Ibarra, O., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 564\u2013573. Springer, Heidelberg (2002)"},{"key":"29_CR10","unstructured":"Fernau, H.: A top-down approach to search-trees: Improved algorithmics for 3-hitting set. ECCC Report 073 (2004)"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/11758471_32","volume-title":"Algorithms and Complexity","author":"H. Fernau","year":"2006","unstructured":"Fernau, H.: Parameterized algorithms for hitting set: The weighted case. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol.\u00a03998, pp. 332\u2013343. Springer, Heidelberg (2006)"},{"key":"29_CR12","volume-title":"Machine Learning","author":"T. Mitchell","year":"1997","unstructured":"Mitchell, T.: Machine Learning. McGraw-Hill, New York (1997)"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:36:13Z","timestamp":1558272973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540709176","9783540709183"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}