{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:53:11Z","timestamp":1743065591700,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112683"},{"type":"electronic","value":"9783642112690"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-11269-0_13","type":"book-chapter","created":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T08:36:15Z","timestamp":1259656575000},"page":"161-172","source":"Crossref","is-referenced-by-count":11,"title":["An Exact Algorithm for the Maximum Leaf Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Henning","family":"Fernau","sequence":"first","affiliation":[]},{"given":"Joachim","family":"Kneis","sequence":"additional","affiliation":[]},{"given":"Dieter","family":"Kratsch","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Langer","sequence":"additional","affiliation":[]},{"given":"Mathieu","family":"Liedloff","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Raible","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Rossmanith","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1993.1001","volume":"14","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: On linear time minor tests with depth-first search. J. Algorithms\u00a014(1), 1\u201323 (1993)","journal-title":"J. Algorithms"},{"key":"13_CR2","unstructured":"Bonsma, P.: Sparse cuts, matching-cuts and leafy trees in graphs. PhD thesis, University of Twente, the Netherlands (2006)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/978-3-540-45138-9_20","volume-title":"Mathematical Foundations of Computer Science 2003","author":"P.S. Bonsma","year":"2003","unstructured":"Bonsma, P.S., Brueggemann, T., Woeginger, G.J.: A faster FPT algorithm for finding spanning trees with many leaves. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 259\u2013268. Springer, Heidelberg (2003)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-540-78773-0_46","volume-title":"LATIN 2008: Theoretical Informatics","author":"P.S. Bonsma","year":"2008","unstructured":"Bonsma, P.S., Zickfeld, F.: Spanning trees with many leaves in graphs without diamonds and blossoms. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 531\u2013543. Springer, Heidelberg (2008)"},{"issue":"10","key":"13_CR5","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1109\/TPDS.2004.48","volume":"15","author":"F. Dai","year":"2004","unstructured":"Dai, F., Wu, J.: An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems\u00a015(10), 908\u2013920 (2004)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"#cr-split#-13_CR6.1","unstructured":"Daligault, J., Gutin, G., Kim, E.J., Yeo, A.: FPT Algorithms and Kernels for the Directed k-Leaf Problem. CoRR abs\/0810.4946 (2008)"},{"key":"#cr-split#-13_CR6.2","doi-asserted-by":"crossref","unstructured":"also: J. Comput. System Sci. (2009), doi:10.1016\/j.jcss.2009.06.005","DOI":"10.1016\/j.jcss.2009.06.005"},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-1-4612-2566-9_7","volume-title":"Feasible Mathematics II","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized computational feasibility. In: Feasible Mathematics II, pp. 219\u2013244. Birkh\u00e4user, Boston (1995)"},{"key":"13_CR8","unstructured":"Estivill-Castro, V., Fellows, M.R., Langston, M.A., Rosamond, F.A.: FPT is P-time extremal structure I. In: Proc. of 1st ACiD, pp. 1\u201341. College Publications (2005)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","first-page":"240","volume-title":"FST TCS 2000: Foundations of Software Technology and Theoretical Science","author":"M.R. Fellows","year":"2000","unstructured":"Fellows, M.R., McCartin, C., Rosamond, F.A., Stege, U.: Coordinatized kernels and catalytic reductions: An improved FPT algorithm for max leaf spanning tree and other problems. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol.\u00a01974, pp. 240\u2013251. Springer, Heidelberg (2000)"},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00453-007-9145-z","volume":"52","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Solving connected dominating set faster than 2n. Algorithmica\u00a052(2), 153\u2013166 (2008)","journal-title":"Algorithmica"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. J. ACM\u00a056(5) (2009)","DOI":"10.1145\/1552285.1552286"},{"key":"13_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-540-92182-0_26","volume-title":"Algorithms and Computation","author":"J. Kneis","year":"2008","unstructured":"Kneis, J., Langer, A., Rossmanith, P.: A new algorithm for finding trees with many leaves. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 270\u2013281. Springer, Heidelberg (2008)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Liang, W.: Constructing minimum-energy broadcast trees in wireless ad hoc networks. In: Proc. of 3rd MOBIHOC, pp. 112\u2013122 (2002)","DOI":"10.1145\/513800.513815"},{"key":"13_CR15","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/1288107.1288111","volume-title":"Proc. of 8th MOBIHOC","author":"M.A. Park","year":"2007","unstructured":"Park, M.A., Willson, J., Wang, C., Thai, M., Wu, W., Farago, A.: A dominating and absorbent set in a wireless ad-hoc network with different transmission ranges. In: Proc. of 8th MOBIHOC, pp. 22\u201331. ACM, New York (2007)"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/11560586_30","volume-title":"Theoretical Computer Science","author":"V. Raman","year":"2005","unstructured":"Raman, V., Saurabh, S., Sikdar, S.: Improved exact exponential algorithms for vertex bipartization and other problems. In: Coppo, M., Lodi, E., Pinna, G.M. (eds.) ICTCS 2005. LNCS, vol.\u00a03701, pp. 375\u2013389. Springer, Heidelberg (2005)"},{"issue":"7","key":"13_CR18","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TMC.2007.1034","volume":"6","author":"M. Thai","year":"2007","unstructured":"Thai, M., Wang, F., Liu, D., Zhu, S., Du. Connected, D.Z.: dominating sets in wireless networks with different transmission ranges. IEEE Trans. Mobil. Comp.\u00a06(7), 721\u2013730 (2007)","journal-title":"IEEE Trans. Mobil. Comp."}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11269-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T00:35:16Z","timestamp":1676680516000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-11269-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642112683","9783642112690"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11269-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}