{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:10:53Z","timestamp":1725541853725},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114083"},{"type":"electronic","value":"9783642114090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11409-0_9","type":"book-chapter","created":{"date-parts":[[2009,12,3]],"date-time":"2009-12-03T08:12:27Z","timestamp":1259827947000},"page":"100-111","source":"Crossref","is-referenced-by-count":3,"title":["Exact and Parameterized Algorithms for Max Internal Spanning Tree"],"prefix":"10.1007","author":[{"given":"Henning","family":"Fernau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serge","family":"Gaspers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Raible","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R. Bellman","year":"1962","unstructured":"Bellman, R.: Dynamic programming treatment of the Travelling Salesman Problem. J. Assoc. Comput. Mach.\u00a09, 61\u201363 (1962)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-540-70575-8_17","volume-title":"Automata, Languages and Programming","author":"A. Bj\u00f6rklund","year":"2008","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: The travelling salesman problem in bounded degree graphs. 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. 198\u2013209. Springer, Heidelberg (2008)"},{"key":"9_CR3","volume-title":"COCOON 2009","author":"N. Cohen","year":"2008","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: COCOON 2009. Springer, Heidelberg (2008) (to appear)"},{"issue":"1","key":"9_CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.7155\/jgaa.00137","volume":"11","author":"D. Eppstein","year":"2007","unstructured":"Eppstein, D.: The Traveling Salesman problem for cubic graphs. J. Graph Algorithms Appl.\u00a011(1), 61\u201381 (2007)","journal-title":"J. Graph Algorithms Appl."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Gaspers, S., Saurabh, S., Thomass\u00e9, S.: A linear vertex kernel for Maximum Internal Spanning Tree. ArXiv Report CoRR abs\/0907.3473 (2009)","DOI":"10.1007\/978-3-642-10631-6_29"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Indust. Appl. Math.\u00a010, 196\u2013210 (1962)","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-73545-8_13","volume-title":"Computing and Combinatorics","author":"K. Iwama","year":"2007","unstructured":"Iwama, K., Nakashima, T.: An improved exact algorithm for cubic graph TSP. In: Lin, G. (ed.) COCOON 2007. LNCS, vol.\u00a04598, pp. 108\u2013117. Springer, Heidelberg (2007)"},{"issue":"2","key":"9_CR8","first-page":"49","volume":"1","author":"R.M. Karp","year":"1982","unstructured":"Karp, R.M.: Dynamic programming meets the principle of inclusion-exclusion. Inf. Process. Lett.\u00a01(2), 49\u201351 (1982)","journal-title":"Inf. Process. Lett."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Kohn, S., Gottlieb, A., Kohn, M.: A generating function approach to the Traveling Salesman Problem. In: Proceedings of the 1977 ACM Annual Conference (ACM 1977), pp. 294\u2013300. Association for Computing Machinery (1977)","DOI":"10.1145\/800179.810218"},{"key":"9_CR10","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, Part I","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., et al. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 713\u2013725. Springer, Heidelberg (2009)"},{"key":"9_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":"Prieto, E., Sloper, C.: Either\/or: Using vertex cover structure in designing FPT-algorithms\u2014the 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)"},{"issue":"3","key":"9_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."},{"issue":"5","key":"9_CR13","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.ipl.2007.08.030","volume":"105","author":"G. Salamon","year":"2008","unstructured":"Salamon, G., Wiener, G.: On finding spanning trees with few leaves. Inf. Process. Lett.\u00a0105(5), 164\u2013169 (2008)","journal-title":"Inf. Process. Lett."},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-74456-6_10","volume-title":"Mathematical Foundations of Computer Science 2007","author":"G. Salamon","year":"2007","unstructured":"Salamon, G.: Approximation algorithms for the maximum internal spanning tree problem. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 90\u2013102. Springer, Heidelberg (2007)"},{"key":"9_CR15","unstructured":"Wahlstr\u00f6m, M.: Algorithms, Measures and Upper Bounds for Satisfiability and Related Problems. PhD thesis, Link\u00f6pings universitet, Sweden (2007)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11409-0_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:40:22Z","timestamp":1606167622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11409-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114083","9783642114090"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11409-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}