{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T22:14:27Z","timestamp":1769724867796,"version":"3.49.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319426334","type":"print"},{"value":"9783319426341","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-42634-1_7","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T15:50:21Z","timestamp":1468943421000},"page":"79-91","source":"Crossref","is-referenced-by-count":4,"title":["A Parameterized Algorithm for Bounded-Degree Vertex Deletion"],"prefix":"10.1007","author":[{"given":"Mingyu","family":"Xiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/opre.1100.0851","volume":"59","author":"B Balasundaram","year":"2011","unstructured":"Balasundaram, B., Butenko, S., Hicks, I.V.: Clique relaxations in social network analysis: the maximum k-plex problem. Oper. Res. 59(1), 133\u2013142 (2011)","journal-title":"Oper. Res."},{"issue":"1\u20132","key":"7_CR2","doi-asserted-by":"crossref","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 Appl. Math. 160(1\u20132), 53\u201360 (2012)","journal-title":"Discrete Appl. Math."},{"key":"7_CR3","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 411, 3736\u20133756 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","first-page":"90","volume-title":"Algorithmic Aspects in Information and Management","author":"Z-Z Chen","year":"2010","unstructured":"Chen, Z.-Z., Fellows, M., Fu, B., Jiang, H., Liu, Y., Wang, L., Zhu, B.: A linear kernel for co-path\/cycle packing. In: Chen, B. (ed.) AAIM 2010. LNCS, vol. 6124, pp. 90\u2013102. Springer, Heidelberg (2010)"},{"key":"7_CR5","doi-asserted-by":"crossref","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 Trotter\u2019s local optimization theorem. J. Comput. Syst. Sci. 77, 1141\u20131158 (2011)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"7_CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10878-013-9691-z","volume":"29","author":"Q Feng","year":"2015","unstructured":"Feng, Q., Wang, J., Li, S., Chen, J.: Randomized parameterized algorithms for $$P_2$$ -packing and co-path packing problems. J. Comb. Optim. 29(1), 125\u2013140 (2015)","journal-title":"J. Comb. Optim."},{"key":"7_CR7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s00453-008-9199-6","volume":"57","author":"H Fernau","year":"2010","unstructured":"Fernau, H.: A top-down approach to search-trees: improved algorithmics for 3-hitting Set. Algorithmica 57, 97\u2013118 (2010)","journal-title":"Algorithmica"},{"issue":"16\u201318","key":"7_CR8","doi-asserted-by":"crossref","first-page":"1698","DOI":"10.1016\/j.tcs.2010.01.001","volume":"411","author":"H Fernau","year":"2010","unstructured":"Fernau, H.: Parameterized algorithms for d-hitting set: the weighted case. Theor. Comput. Sci. 411(16\u201318), 1698\u20131713 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"14","key":"7_CR9","doi-asserted-by":"crossref","first-page":"3157","DOI":"10.1080\/00207160903176868","volume":"87","author":"H Fernau","year":"2010","unstructured":"Fernau, H.: Parameterized algorithmics for d-hitting set. Int. J. Comput. Math. 87(14), 3157\u20133174 (2010)","journal-title":"Int. J. Comput. Math."},{"key":"7_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer, Heidelberg (2010)"},{"issue":"4","key":"7_CR11","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.ipl.2015.12.002","volume":"116","author":"J Katreni\u010d","year":"2016","unstructured":"Katreni\u010d, J.: A faster FPT algorithm for 3-path vertex cover. Inf. Process. Lett. 116(4), 273\u2013278 (2016)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"7_CR12","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1137\/120890946","volume":"42","author":"I Newnan","year":"2013","unstructured":"Newnan, I., Sohler, C.: Every proerty of hyperfinite graphs is testable. SIAM J. Comput. 42(3), 1095\u20131112 (2013)","journal-title":"SIAM J. Comput."},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S1570-8667(03)00009-1","volume":"1","author":"R Niedermeier","year":"2003","unstructured":"Niedermeier, R., Rossmanith, P.: An efficient fixed-parameter algorithm for 3-hitting set. J. Discrete Algorithms 1, 89\u2013102 (2003)","journal-title":"J. Discrete Algorithms"},{"key":"7_CR14","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman, S.B., Foster, B.L.: A graph-theoretic generalization of the clique concept. J. Math. Soc. 6, 139\u2013154 (1978)","journal-title":"J. Math. Soc."},{"key":"7_CR15","doi-asserted-by":"crossref","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 P3 problem. Inf. Process. Lett. 115, 96\u201399 (2015)","journal-title":"Inf. Process. Lett."},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","first-page":"469","volume-title":"Computing and Combinatorics","author":"BY Wu","year":"2015","unstructured":"Wu, B.Y.: A measure and conquer approach for the parameterized bounded degree-one vertex deletion. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 469\u2013480. Springer, Heidelberg (2015)"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-662-48971-0_38","volume-title":"Algorithms and Computation","author":"M Xiao","year":"2015","unstructured":"Xiao, M.: On a generalization of Nemhauser and Trotter\u2019s local optimization theorem. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 442\u2013452. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48971-0_38"}],"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-42634-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T18:44:10Z","timestamp":1498329850000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}