{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T12:40:02Z","timestamp":1741437602528,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222993"},{"type":"electronic","value":"9783642223006"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22300-6_24","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:41:31Z","timestamp":1312893691000},"page":"279-289","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized Reductions and Algorithms for Another Vertex Cover Generalization"],"prefix":"10.1007","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[]},{"given":"Leonid","family":"Molokov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/090773313","volume":"24","author":"R. Bar-Yehuda","year":"2010","unstructured":"Bar-Yehuda, R., Hermelin, D., Rawitz, D.: An Extension of the Nemhauser-Trotter Theorem to Generalized Vertex Cover with Applications. SIAM J. Discr. Math.\u00a024, 287\u2013300 (2010)","journal-title":"SIAM J. Discr. Math."},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"J. Chen","year":"2010","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved Upper Bounds for Vertex Cover. Theor. Comput. Sci.\u00a0411, 3736\u20133756 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-11269-0_9","volume-title":"Parameterized and Exact Computation","author":"P. Damaschke","year":"2009","unstructured":"Damaschke, P.: Pareto complexity of two-parameter FPT problems: A case study for partial vertex cover. In: Chen, J., Fomin, F. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 110\u2013121. Springer, Heidelberg (2009)"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.jda.2009.01.003","volume":"7","author":"P. Damaschke","year":"2009","unstructured":"Damaschke, P., Molokov, L.: The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting. J. Discr. Algor.\u00a07, 391\u2013401 (2009)","journal-title":"J. Discr. Algor."},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-02008-7_26","volume-title":"Research in Computational Molecular Biology","author":"B. Dost","year":"2009","unstructured":"Dost, B., Bandeira, N., Li, X., Shen, Z., Briggs, S., Bafna, V.: Shared peptides in mass spectrometry based protein quantification. In: Batzoglou, S. (ed.) RECOMB 2009. LNCS, vol.\u00a05541, pp. 356\u2013371. Springer, Heidelberg (2009)"},{"key":"24_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.jda.2008.09.007","volume":"7","author":"H. Fernau","year":"2009","unstructured":"Fernau, H., Manlove, D.: Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms. J. Discr. Algor.\u00a07, 149\u2013167 (2009)","journal-title":"J. Discr. Algor."},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s00224-007-1309-3","volume":"41","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R., Wernicke, S.: Parameterized Complexity of Vertex Cover Variants. Theory Comput. Syst.\u00a041, 501\u2013520 (2007)","journal-title":"Theory Comput. Syst."},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-02008-7_2","volume-title":"Research in Computational Molecular Biology","author":"Z. He","year":"2009","unstructured":"He, Z., Yang, C., Yang, C., Qi, R.Z., Tam, J.P.M., Yu, W.: Optimization-based peptide mass fingerprinting for protein mixture identification. In: Batzoglou, S. (ed.) RECOMB 2009. LNCS, vol.\u00a05541, pp. 16\u201330. Springer, Heidelberg (2009)"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-540-92248-3_22","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Kneis","year":"2008","unstructured":"Kneis, J., Langer, A., Rossmanith, P.: Improved upper bounds for partial vertex cover. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol.\u00a05344, pp. 240\u2013251. Springer, Heidelberg (2008)"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Molokov, L.: Application of Combinatorial Methods to Protein Identification in Peptide Mass Fingerprinting. In: Int. Conf. on Knowledge Discovery and Info. Retrieval KDIR 2010, pp. 307\u2013313. SciTePress (2010)","DOI":"10.5220\/0003102703070313"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1074\/mcp.R500012-MCP200","volume":"4","author":"A.I. Nesvizhskii","year":"2005","unstructured":"Nesvizhskii, A.I., Aebersold, R.: Interpretation of Shotgun Proteomic Data: The Protein Inference Problem. Mol. Cellular Proteomics\u00a04, 1419\u20131440 (2005)","journal-title":"Mol. Cellular Proteomics"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Math. and its Appl. Oxford Univ. Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-540-85097-7_11","volume-title":"Combinatorial Optimization and Applications","author":"V. Raman","year":"2008","unstructured":"Raman, V., Saurabh, S., Srihari, S.: Parameterized algorithms for generalized domination. In: Yang, B., Du, D.Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol.\u00a05165, pp. 116\u2013126. Springer, Heidelberg (2008)"},{"key":"24_CR15","unstructured":"Wahlstr\u00f6m, M.: Algorithms, Measures, and Upper Bounds for Satisfiability and Related Problems. PhD Thesis 1079, Link\u00f6ping Studies in Science and Technol. (2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22300-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T12:05:41Z","timestamp":1741435541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22300-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222993","9783642223006"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22300-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}