{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:54Z","timestamp":1759063614092,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"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_7","type":"book-chapter","created":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T08:36:15Z","timestamp":1259656575000},"page":"86-97","source":"Crossref","is-referenced-by-count":22,"title":["On Finding Directed Trees with Many Leaves"],"prefix":"10.1007","author":[{"given":"Jean","family":"Daligault","sequence":"first","affiliation":[]},{"given":"St\u00e9phan","family":"Thomass\u00e9","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-540-73420-8_32","volume-title":"Automata, Languages and Programming","author":"N. Alon","year":"2007","unstructured":"Alon, N., Fomin, F., Gutin, G., Krivelevich, M., Saurabh, S.: Parameterized algorithms for directed maximum leaf problems. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 352\u2013362. Springer, Heidelberg (2007)"},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1137\/070710494","volume":"23","author":"N. Alon","year":"2009","unstructured":"Alon, N., Fomin, F., Gutin, G., Krivelevich, M., Saurabh, S.: Spanning directed trees with many leaves. SIAM J. Discrete Maths.\u00a023(1), 466\u2013476 (2009)","journal-title":"SIAM J. Discrete Maths."},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-540-70575-8_46","volume-title":"Automata, Languages and Programming","author":"H.L. Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels (Extended abstract). 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. 563\u2013574. Springer, Heidelberg (2008)"},{"key":"7_CR4","unstructured":"Paul, S.: Bonsma and Frederic Dorn. An fpt algorithm for directed spanning k-leaf. abs\/0711.4052 (2007)"},{"key":"7_CR5","unstructured":"Chen, J., Liu, Y.: On the parameterized max-leaf problems: digraphs and undirected graphs. Technical report, Department of Computer Science, Texas A& M University (2008)"},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/BF01302965","volume":"14","author":"J. Cheriyan","year":"1994","unstructured":"Cheriyan, J., Reif, J.: Directed s-t numberings, rubber bands, and testing digraph k-vertex connectivity. Combinatorica\u00a014(4), 435\u2013451 (1994)","journal-title":"Combinatorica"},{"key":"7_CR7","unstructured":"Daligault, J., Gutin, G., Kim, E.J., Yeo, A.: FPT algorithms and kernels for the Directed k-Leaf problem. To appear in Journal of Computer and System Sciences"},{"issue":"11","key":"7_CR8","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E. Dijkstra","year":"1974","unstructured":"Dijkstra, E.: Self-stabilizing systems in spite of distributed control. Commun. ACM\u00a017(11), 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1002\/jgt.1013","volume":"37","author":"G. Ding","year":"2001","unstructured":"Ding, G., Johnson, T., Seymour, P.: Spanning trees with many leaves. J. Graph Theory\u00a037(4), 189\u2013197 (2001)","journal-title":"J. Graph Theory"},{"key":"7_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, Heidelberg (1999)"},{"key":"7_CR11","unstructured":"Drescher, M., Vetta, A.: An approximation algorithm for the maximum leaf spanning arborescence problem. To appear in ACM Transactions on Algorithms"},{"key":"7_CR12","unstructured":"Estivill-Castro, V., Fellows, M., Langston, M., Rosamond, F.: Fixed-parameter tractability is polynomial-time extremal structure theory i: The case of max leaf. In: Proc. of ACiD 2005 (2005)"},{"key":"7_CR13","unstructured":"Fernau, H., Fomin, F.V., Lokshtanov, D., Raible, D., Saurabh, S., Villanger, Y.: Kernel(s) for problems with no kernel: On out-trees with many leaves. In: Albers, S., Marion, J.-Y. (eds.) 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), Dagstuhl, Germany. Leibniz International Proceedings in Informatics, vol.\u00a03, pp. 421\u2013432. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2009), \n                    http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2009\/1843"},{"key":"7_CR14","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"issue":"2","key":"7_CR15","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00453-007-9145-z","volume":"52","author":"F. Fomin","year":"2008","unstructured":"Fomin, F., Grandoni, F., Kratsch, D.: Solving connected dominating set faster than 2\n                  n\n                . Algorithmica\u00a052(2), 153\u2013166 (2008)","journal-title":"Algorithmica"},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0020-0190(94)90139-2","volume":"52","author":"G. Galbiati","year":"1994","unstructured":"Galbiati, G., Maffioli, F., Morzenti, A.: A short note on the approximability of the maximum leaves spanning tree problem. Inf. Process. Lett.\u00a052(1), 45\u201349 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News\u00a038(1), 31\u201345 (2007)","journal-title":"SIGACT News"},{"key":"7_CR18","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":"7_CR19","unstructured":"Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: Rosenstiehl, P. (ed.) Theory of Graphs: Internat. Sympos.: Rome, pp. 215\u2013232 (1966)"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02122557","volume":"8","author":"N. Linial","year":"1988","unstructured":"Linial, N., Lovasz, L., Wigderson, A.: Rubber bands, convex embeddings and graph connectivity. Combinatorica\u00a08, 91\u2013102 (1988)","journal-title":"Combinatorica"},{"key":"7_CR21","series-title":"Oxford Lectures Series in Mathematics and its Applications","doi-asserted-by":"crossref","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 Lectures Series in Mathematics and its Applications, vol.\u00a031. Oxford University Press, Oxford (2006)"},{"key":"7_CR22","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)"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0020-0190(81)90141-1","volume":"13","author":"J.A. Storer","year":"1981","unstructured":"Storer, J.A.: Constructing full spanning trees for cubic graphs. Inform Process Lett.\u00a013, 8\u201311 (1981)","journal-title":"Inform Process Lett."},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/313239.313261","volume-title":"DIALM 1999: Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications","author":"J. Wu","year":"1999","unstructured":"Wu, J., Li, H.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: DIALM 1999: Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications, pp. 7\u201314. ACM Press, New York (1999)"}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T22:11:40Z","timestamp":1675894300000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-11269-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642112683","9783642112690"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11269-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}