{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:12Z","timestamp":1759637772911},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_37","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T11:12:41Z","timestamp":1435057961000},"page":"469-480","source":"Crossref","is-referenced-by-count":8,"title":["A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion"],"prefix":"10.1007","author":[{"given":"Bang Ye","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-540-73951-7_38","volume-title":"Algorithms and Data Structures","author":"FN Abu-Khzam","year":"2007","unstructured":"Abu-Khzam, F.N.: Kernelization algorithms for d-hitting set problems. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 434\u2013445. Springer, Heidelberg (2007)"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.dam.2011.08.013","volume":"160","author":"N Betzler","year":"2012","unstructured":"Betzler, N., Bredereck, R., Niedermeier, R., Uhlmann, J.: On bounded-degree vertex deletion parameterized by treewidth. Discrete Applied Mathematics 160, 53\u201360 (2012)","journal-title":"Discrete Applied Mathematics"},{"key":"37_CR3","unstructured":"Chang, M.S., Chen, L.H., Hung, L.J., Liu, Y.Z., Rossmanith, P., Sikdar, S.: An \n                      \n                        \n                      \n                      $$O^{\\ast }(1.4658^n)$$\n                      \n                        \n                          \n                            \n                              O\n                              *\n                            \n                            \n                              (\n                              1\n                              .\n                              \n                                4658\n                                n\n                              \n                              )\n                            \n                          \n                        \n                      \n                    -time exact algorithm for the maximum bounded-degree-1 set problem. In: Proceedings of the 31st Workshop on Combinatorial Mathematics and Computation Theory, pp. 9\u201318 (2014)"},{"issue":"2","key":"37_CR4","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J Chen","year":"2001","unstructured":"Chen, J., Kanj, I.A., Jia, W.: Vertex cover: Further observations and further improvements. Journal of Algorithms 41(2), 280\u2013301 (2001)","journal-title":"Journal of Algorithms"},{"issue":"40\u201342","key":"37_CR5","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. Theoretical Computer Science 411(40\u201342), 3736\u20133756 (2010)","journal-title":"Theoretical Computer Science"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer-Verlag (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer-Verlag (2013)","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"7009","DOI":"10.1016\/j.tcs.2011.09.009","volume":"412","author":"F Kardo\u0161","year":"2011","unstructured":"Kardo\u0161, F., Katreni\u010d, J., Schiermeyer, I.: On computing the minimum 3-path vertex cover and dissociation number of graphs. Theoretical Computer Science 412, 7009\u20137017 (2011)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"37_CR9","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1016\/j.jcss.2010.12.001","volume":"77","author":"MR Fellows","year":"2011","unstructured":"Fellows, M.R., Guo, J., Moser, H., Niedermeier, R.: A generalization of nemhauser and trotters local optimization theorem. Journal of Computer and System Sciences 77(6), 1141\u20131158 (2011)","journal-title":"Journal of Computer and System Sciences"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer (2010)","DOI":"10.1007\/978-3-642-16533-7"},{"issue":"5","key":"37_CR11","doi-asserted-by":"publisher","first-page":"25:1","DOI":"10.1145\/1552285.1552286","volume":"56","author":"FV Fomin","year":"2009","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5), 25:1\u201325:32 (2009)","journal-title":"J. ACM"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-29700-7_19","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"J Chen","year":"2012","unstructured":"Chen, J., Fernau, H., Shaw, P., Wang, J., Yang, Z.: Kernels for packing and covering problems. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) AAIM 2012 and FAW 2012. LNCS, vol. 7285, pp. 199\u2013211. Springer, Heidelberg (2012)"},{"issue":"38\u201340","key":"37_CR13","doi-asserted-by":"publisher","first-page":"3640","DOI":"10.1016\/j.tcs.2009.04.021","volume":"410","author":"C Komusiewicz","year":"2009","unstructured":"Komusiewicz, C., Hffner, F., Moser, H., Niedermeier, R.: Isolation concepts for efficiently enumerating dense subgraphs. Theoretical Computer Science 410(38\u201340), 3640\u20133654 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"37_CR14","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10878-011-9391-5","volume":"24","author":"H Moser","year":"2012","unstructured":"Moser, H., Niedermeier, R., Sorge, M.: Exact combinatorial algorithms and experiments for finding maximum \n                      \n                        \n                      \n                      $$k$$\n                      \n                        \n                          k\n                        \n                      \n                    -plexes. Journal of Combinatorial Optimization 24(3), 347\u2013373 (2012)","journal-title":"Journal of Combinatorial Optimization"},{"key":"37_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.dam.2005.02.029","volume":"152","author":"N Nishmura","year":"2005","unstructured":"Nishmura, N., Ragde, P., Thilikos, D.M.: Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. Discrete Applied Mathematics 152, 229\u2013245 (2005)","journal-title":"Discrete Applied Mathematics"},{"issue":"3\u20134","key":"37_CR16","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0020-0190(00)00004-1","volume":"73","author":"R Niedermeier","year":"2000","unstructured":"Niedermeier, R., Rossmanith, P.: A general method to speed up fixed-parameter-tractable algorithms. Information Processing Letters 73(3\u20134), 125\u2013129 (2000)","journal-title":"Information Processing Letters"},{"key":"37_CR17","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ipl.2014.06.018","volume":"115","author":"J Tu","year":"2015","unstructured":"Tu, J.: A fixed-parameter algorithm for the vertex cover \n                      \n                        \n                      \n                      $$P_3$$\n                      \n                        \n                          \n                            P\n                            3\n                          \n                        \n                      \n                     problem. Information Processing Letters 115, 96\u201399 (2015)","journal-title":"Information Processing Letters"},{"key":"37_CR18","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1016\/j.ipl.2011.04.009","volume":"111","author":"J Tu","year":"2011","unstructured":"Tu, J., Zhou, W.: A factor 2 approximation algorithm for the vertex cover \n                      \n                        \n                      \n                      $$P_3$$\n                      \n                        \n                          \n                            P\n                            3\n                          \n                        \n                      \n                     problem. Information Processing Letters 111, 683\u2013686 (2011)","journal-title":"Information Processing Letters"},{"key":"37_CR19","doi-asserted-by":"publisher","first-page":"7044","DOI":"10.1016\/j.tcs.2011.09.013","volume":"412","author":"J Tu","year":"2011","unstructured":"Tu, J., Zhou, W.: A primal-dual approximation algorithm for the vertex cover \n                      \n                        \n                      \n                      $$P_3$$\n                      \n                        \n                          \n                            P\n                            3\n                          \n                        \n                      \n                     problem. Theoretical Computer Science 412, 7044\u20137048 (2011)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T04:02:34Z","timestamp":1559188954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}