{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T03:25:08Z","timestamp":1752981908661},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106309"},{"type":"electronic","value":"9783642106316"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_29","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T02:03:43Z","timestamp":1259892223000},"page":"275-282","source":"Crossref","is-referenced-by-count":4,"title":["A Linear Vertex Kernel for Maximum Internal Spanning Tree"],"prefix":"10.1007","author":[{"given":"Fedor V.","family":"Fomin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serge","family":"Gaspers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phan","family":"Thomass\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"29_CR1","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00224-007-1328-0","volume":"41","author":"F.N. 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.\u00a041(3), 411\u2013430 (2007)","journal-title":"Theory Comput. Syst."},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-642-02882-3_5","volume-title":"COCOON 2009","author":"N. Cohen","year":"2009","unstructured":"Cohen, N., Fomin, F.V., Gutin, G., Kim, E.J., Saurabh, S., Yeo, A.: Algorithm for Finding k-Vertex Out-trees and its Application to k-Internal Out-branching Problem. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol.\u00a05609, pp. 37\u201346. Springer, Heidelberg (2009)"},{"issue":"2","key":"29_CR3","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. J.\u00a0Algorithms\u00a041(2), 280\u2013301 (2001)","journal-title":"J.\u00a0Algorithms"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/S0166-218X(02)00463-8","volume":"131","author":"A. Frank","year":"2003","unstructured":"Frank, A., Kir\u00e1ly, T., Kriesell, M.: On decomposing a hypergraph into k connected sub-hypergraphs. Discrete Appl. Math.\u00a0131, 373\u2013383 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"8-10","key":"29_CR5","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.tcs.2008.10.021","volume":"410","author":"J. Guo","year":"2009","unstructured":"Guo, J.: A more effective linear kernelization for cluster editing. Theor. Comput. Sci.\u00a0410(8-10), 718\u2013726 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Saurabh, S.: Even faster algorithm for Set Splitting!.To appear in the proceedings of IWPEC 2009 (2009)","DOI":"10.1007\/978-3-642-11269-0_24"},{"key":"29_CR7","first-page":"289","volume":"17","author":"M. Lorea","year":"1975","unstructured":"Lorea, M.: Hypergraphes et matroides. Cahiers Centre Etud. Rech. Oper.\u00a017, 289\u2013291 (1975)","journal-title":"Cahiers Centre Etud. Rech. Oper."},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/BF01894789","volume":"21","author":"L. Lov\u00e1sz","year":"1970","unstructured":"Lov\u00e1sz, L.: A generalization of K\u00f6nig\u2019s theorem. Acta. Math. Acad. Sci. Hungar.\u00a021, 443\u2013446 (1970)","journal-title":"Acta. Math. Acad. Sci. Hungar."},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1007\/978-3-642-02927-1_59","volume-title":"ICALP 2009","author":"J. Nederlof","year":"2009","unstructured":"Nederlof, J.: Fast polynomial-space algorithms using M\u00f6bius inversion: Improving on Steiner Tree and related problems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Niko-letsea, S. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 713\u2013725. Springer, Heidelberg (2009)"},{"key":"29_CR10","first-page":"153","volume-title":"Surveys in Combinatorics","author":"N. Robertson","year":"1985","unstructured":"Robertson, N., Seymour, P.D.: Graph minors-a survey. In: Anderson, I. (ed.) Surveys in Combinatorics, pp. 153\u2013171. Cambridge Univ. Press, Cambridge (1985)"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1007\/978-3-540-45078-8_41","volume-title":"Algorithms and Data Structures","author":"E. Prieto","year":"2003","unstructured":"E.\u00a0Prieto and C.\u00a0Sloper. Either\/or: Using vertex cover structure in designing FPT-algorithms\u2014the case of k-internal spanning tree. In the proceedings of WADS 2003, volume 2748 of LNCS, pp. 465\u2013483. Springer, 2003."},{"issue":"3","key":"29_CR12","first-page":"308","volume":"12","author":"E. Prieto","year":"2005","unstructured":"Prieto, E., Sloper, C.: Reducing to Independent Set Structure \u2013 the Case of k-Internal Spanning Tree. Nord. J. Comput.\u00a012(3), 308\u2013318 (2005)","journal-title":"Nord. J. Comput."},{"key":"29_CR13","first-page":"115","volume-title":"The Proceedings of SODA 2009","author":"S. Thomass\u00e9","year":"2009","unstructured":"Thomass\u00e9, S.: A quadratic kernel for feedback vertex set. In: The Proceedings of SODA 2009, pp. 115\u2013119. SIAM, Philadelphia (2009)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:58:26Z","timestamp":1558270706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}