{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T22:40:06Z","timestamp":1739227206380,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642028816"},{"type":"electronic","value":"9783642028823"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02882-3_5","type":"book-chapter","created":{"date-parts":[[2009,7,10]],"date-time":"2009-07-10T10:49:21Z","timestamp":1247222961000},"page":"37-46","source":"Crossref","is-referenced-by-count":4,"title":["Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem"],"prefix":"10.1007","author":[{"given":"Nathann","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fedor V.","family":"Fomin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Gutin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eun Jung","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anders","family":"Yeo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. Journal of the ACM\u00a042, 844\u2013856 (1995)","journal-title":"Journal of the ACM"},{"key":"5_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-998-1","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J. Bang-Jensen","year":"2009","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer, London (2009)","edition":"2"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1137\/0209055","volume":"9","author":"T. Beyer","year":"1980","unstructured":"Beyer, T., Hedetniemi, S.M.: Constant time generation of rooted trees. SIAM J. Computing\u00a09, 706\u2013712 (1980)","journal-title":"SIAM J. Computing"},{"unstructured":"Chen, J., Lu, S., Sze, S.-H., Zhang, F.: Improved Algorithms for Path, Matching, and Packing Problems. In: Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 298\u2013307 (2007)","key":"5_CR4"},{"key":"5_CR5","first-page":"17","volume-title":"Paths, Flows, and VLSI-Layout","author":"F.R.K. Chung","year":"1990","unstructured":"Chung, F.R.K.: Separator theorems and their applications. In: Korte, B., Lov\u00e1sz, L., Pr\u00f6mel, H.J., Schrijver, A. (eds.) Paths, Flows, and VLSI-Layout, pp. 17\u201334. Springer, Berlin (1990)"},{"doi-asserted-by":"crossref","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, Preprint arXiv:0903.0938 (March 2009)","key":"5_CR6","DOI":"10.1007\/978-3-642-02882-3_5"},{"unstructured":"Demers, A., Downing, A.: Minimum leaf spanning tree. US Patent no. 6,105,018 (August 2000)","key":"5_CR7"},{"doi-asserted-by":"crossref","unstructured":"Gutin, G., Razgon, I., Kim, E.J.: Minimum Leaf Out-Branching Problems. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol.\u00a05034, pp. 235\u2013246. Springer, Heidelberg (2008)","key":"5_CR8","DOI":"10.1007\/978-3-540-68880-8_23"},{"doi-asserted-by":"crossref","unstructured":"Kneis, J., M\u00f6lle, D., Richter, S., Rossmanith, P.: Divide-and-color. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 58\u201367. Springer, Heidelberg (2006)","key":"5_CR9","DOI":"10.1007\/11917496_6"},{"key":"5_CR10","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)"},{"doi-asserted-by":"crossref","unstructured":"Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and Near-Optimal Derandomization. In: Proc. 17th Ann. Symp. Found. Comput. Sci., pp. 182\u2013193 (1995)","key":"5_CR11","DOI":"10.1109\/SFCS.1995.492475"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1017\/S0963548300001280","volume":"3","author":"A. Nilli","year":"1994","unstructured":"Nilli, A.: Perfect hashing and probability. Combinatorics Prob. Comput.\u00a03, 407\u2013409 (1994)","journal-title":"Combinatorics Prob. Comput."},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"583","DOI":"10.2307\/1969046","volume":"49","author":"R. Otter","year":"1948","unstructured":"Otter, R.: The Number of Trees. Ann. Math.\u00a049, 583\u2013599 (1948)","journal-title":"Ann. Math."},{"doi-asserted-by":"crossref","unstructured":"Prieto, E., Sloper, C.: Either\/Or: Using Vertex Cover Structure in desigining FPT-algorithms - The Case of k-Internal Spanning Tree. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 474\u2013483. Springer, Heidelberg (2003)","key":"5_CR14","DOI":"10.1007\/978-3-540-45078-8_41"},{"key":"5_CR15","first-page":"308","volume":"15","author":"E. Prieto","year":"2005","unstructured":"Prieto, E., Sloper, C.: Reducing To Independent Set Structure - The Case of k-Internal Spanning Tree. Nordic Journal of Computing\u00a015, 308\u2013318 (2005)","journal-title":"Nordic Journal of Computing"},{"issue":"6","key":"5_CR16","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 a path of length k in O *(2 k ) time. Inform. Proc. Letters.\u00a0109(6), 315\u2013318 (2009)","journal-title":"Inform. Proc. Letters."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02882-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T21:58:47Z","timestamp":1739224727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02882-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642028816","9783642028823"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02882-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}