{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:18Z","timestamp":1759637838788},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038971"},{"type":"electronic","value":"9783319038988"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03898-8_30","type":"book-chapter","created":{"date-parts":[[2013,11,19]],"date-time":"2013-11-19T02:57:26Z","timestamp":1384829846000},"page":"361-373","source":"Crossref","is-referenced-by-count":8,"title":["Algorithms for k-Internal Out-Branching"],"prefix":"10.1007","author":[{"given":"Meirav","family":"Zehavi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"30_CR1","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1016\/j.jcss.2010.01.001","volume":"76","author":"N. Cohen","year":"2010","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. J. Comput. Syst. Sci.\u00a076(7), 650\u2013662 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"30_CR2","unstructured":"Demers, A., Downing, A.: Minimum leaf spanning tree. US Patent no. 6,105,018 (August 2013)"},{"issue":"1","key":"30_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2012.03.004","volume":"79","author":"F.V. Fomin","year":"2013","unstructured":"Fomin, F.V., Gaspers, S., Saurabh, S., Thomass\u00e9, S.: A linear vertex kernel for maximum internal spanning tree. J. Comput. Syst. Sci.\u00a079(1), 1\u20136 (2013)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"30_CR4","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1007\/s00453-011-9555-9","volume":"63","author":"F.V. Fomin","year":"2012","unstructured":"Fomin, F.V., Grandoni, F., Lokshtanov, D., Saurabh, S.: Sharp separation and applications to exact and parameterized algorithms. Algorithmica\u00a063(3), 692\u2013706 (2012)","journal-title":"Algorithmica"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems. In: Proc. STOC, pp. 47\u201363 (1974)","DOI":"10.1145\/800119.803884"},{"issue":"45","key":"30_CR6","doi-asserted-by":"publisher","first-page":"4571","DOI":"10.1016\/j.tcs.2009.03.036","volume":"410","author":"G. Gutin","year":"2009","unstructured":"Gutin, G., Razgon, I., Kim, E.J.: Minimum leaf out-branching and related problems. Theor. Comput. Sci.\u00a0410(45), 4571\u20134579 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-540-70575-8_47","volume-title":"Automata, Languages and Programming","author":"I. Koutis","year":"2008","unstructured":"Koutis, I.: Faster algebraic algorithms for path and packing problems. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 575\u2013586. Springer, Heidelberg (2008)"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-642-02927-1_54","volume-title":"Automata, Languages and Programming","author":"I. Koutis","year":"2009","unstructured":"Koutis, I., Williams, R.: Limits and applications of group algebras for parameterized problems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 653\u2013664. Springer, Heidelberg (2009)"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/978-3-642-02927-1_59","volume-title":"Automata, Languages and Programming","author":"J. Nederlof","year":"2009","unstructured":"Nederlof, J.: Fast polynomial-space algorithms using mobius inversion: improving on steiner tree and related problems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 713\u2013725. Springer, Heidelberg (2009)"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"issue":"1","key":"30_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-010-0973-2","volume":"27","author":"K. Ozeki","year":"2011","unstructured":"Ozeki, K., Yamashita, T.: Spanning trees: A survey. Graphs and Combinatorics\u00a027(1), 1\u201326 (2011)","journal-title":"Graphs and Combinatorics"},{"issue":"3","key":"30_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":"30_CR13","first-page":"39","volume":"7","author":"L. R\u00e9dei","year":"1934","unstructured":"R\u00e9dei, L.: Ein kombinatorischer satz. Acta Litteraria Szeged\u00a07, 39\u201343 (1934)","journal-title":"Acta Litteraria Szeged"},{"issue":"1","key":"30_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00453-011-9575-5","volume":"65","author":"D. Raible","year":"2013","unstructured":"Raible, D., Fernau, H., Gaspers, D., Liedloff, M.: Exact and parameterized algorithms for max internal spanning tree. Algorithmica\u00a065(1), 95\u2013128 (2013)","journal-title":"Algorithmica"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1016\/j.endm.2010.05.153","volume":"36","author":"G. Salamon","year":"2010","unstructured":"Salamon, G.: A survey on algorithms for the maximum internal spanning tree and related problems. Electronic Notes in Discrete Mathematics\u00a036, 1209\u20131216 (2010)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"3","key":"30_CR16","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.ipl.2005.12.007","volume":"98","author":"S. Skulrattanakulchai","year":"2006","unstructured":"Skulrattanakulchai, S.: Delta-list vertex coloring in linear time. Inf. Process. Lett.\u00a098(3), 101\u2013106 (2006)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"30_CR17","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ipl.2008.11.004","volume":"109","author":"R. Williams","year":"2009","unstructured":"Williams, R.: Finding paths of length k in O\n                        *(2\n                  k\n                ) time. Inf. Process. Lett.\u00a0109(6), 315\u2013318 (2009)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03898-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T06:40:25Z","timestamp":1558680025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03898-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038971","9783319038988"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03898-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}