{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T03:22:37Z","timestamp":1752981757046},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540787723"},{"type":"electronic","value":"9783540787730"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78773-0_46","type":"book-chapter","created":{"date-parts":[[2008,4,3]],"date-time":"2008-04-03T04:38:35Z","timestamp":1207197515000},"page":"531-543","source":"Crossref","is-referenced-by-count":15,"title":["Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms"],"prefix":"10.1007","author":[{"given":"Paul","family":"Bonsma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Zickfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"46_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"},{"unstructured":"Bonsma, P.S.: Sparse cuts, matching-cuts and leafy trees in graphs. PhD thesis, University of Twente, Enschede, the Netherlands (2006), \n                  \n                    http:\/\/purl.org\/utwente\/57117","key":"46_CR2"},{"key":"46_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)"},{"unstructured":"Correa, J.R., Fernandes, C.G., Matamala, M., Wakabayashi, Y.: A 5\/3-approximation for finding spanning trees with many leaves in cubic graphs. In: WAOA 2007 (to appear, 2007)","key":"46_CR4"},{"unstructured":"Estivill-Castro, V., Fellows, M.R., Langston, M.A., Rosamond, F.A.: FPT is P-time extremal structure I. In: ACiD 2005. Texts in algorithmics, vol.\u00a04, pp. 1\u201341. King\u2019s College Publications","key":"46_CR5"},{"key":"46_CR6","volume-title":"Parameterized complexity theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized complexity theory. Springer, Berlin (2006)"},{"issue":"6","key":"46_CR7","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1002\/jgt.3190130604","volume":"13","author":"J.R. Griggs","year":"1989","unstructured":"Griggs, J.R., Kleitman, D.J., Shastri, A.: Spanning trees with many leaves in cubic graphs. J. Graph Theory\u00a013(6), 669\u2013695 (1989)","journal-title":"J. Graph Theory"},{"issue":"1","key":"46_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/0404010","volume":"4","author":"D.J. Kleitman","year":"1991","unstructured":"Kleitman, D.J., West, D.B.: Spanning trees with many leaves. SIAM J. Discrete Math.\u00a04(1), 99\u2013106 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"46_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-68530-8_37","volume-title":"Algorithms - ESA \u201998","author":"R. Solis-Oba","year":"1998","unstructured":"Solis-Oba, R.: 2-approximation algorithm for finding a spanning tree with maximum number of leaves. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 441\u2013452. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2008: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78773-0_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:21:42Z","timestamp":1619508102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78773-0_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540787723","9783540787730"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78773-0_46","relation":{},"subject":[]}}