{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T01:40:30Z","timestamp":1780969230806,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540688655","type":"print"},{"value":"9783540688808","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68880-8_23","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:37:59Z","timestamp":1217486279000},"page":"235-246","source":"Crossref","is-referenced-by-count":16,"title":["Minimum Leaf Out-Branching Problems"],"prefix":"10.1007","author":[{"given":"Gregory","family":"Gutin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Igor","family":"Razgon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eun Jung","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"23_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)"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77050-3_26","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"N. Alon","year":"2007","unstructured":"Alon, N., Fomin, F., Gutin, G., Krivelevich, M., Saurabh, S.: Better Algorithms and Bounds for Directed Maximum Leaf Problems. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, Springer, Heidelberg (2007)"},{"key":"23_CR3","unstructured":"Alon, N., Fomin, F.V., Gutin, G., Krivelevich, M., Saurabh, S.: Spanning directed trees with many leaves. Report arXiv: 0803.0701 (2008)"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0020-0190(91)90195-N","volume":"37","author":"H. Alt","year":"1991","unstructured":"Alt, H., Blum, N., Melhorn, K., Paul, M.: Computing of maximum cardinality matching in a bipartite graph in time \n                  \n                    \n                  \n                  $O(n^{1.5}\\sqrt{m\/\\log n})$\n                . Inf. Proc. Letters\u00a037, 237\u2013240 (1991)","journal-title":"Inf. Proc. Letters"},{"key":"23_CR5","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J. Bang-Jensen","year":"2000","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, Heidelberg (2000), \n                  \n                    www.cs.rhul.ac.uk\/books\/dbook\/"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Bang-Jensen, J., Yeo, A.: The minimum spanning strong subdigraph problem is fixed parameter tractable. Discrete Applied Math. (to appear)","DOI":"10.1016\/j.dam.2007.12.003"},{"key":"23_CR7","unstructured":"Bonsma, P.S., Dorn, F.: An FPT Algorithm for Directed Spanning k-Leaf. Preprint 046-2007, Combinatorial Optimization & Graph Algorithms Group, TU Berlin (November 2007) (preprint 046-2007)"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.ipl.2004.10.003","volume":"93","author":"L.S. Chandran","year":"2005","unstructured":"Chandran, L.S., Grandoni, F.: Refined memorization for vertex cover. Inform. Proc. Letters\u00a093, 125\u2013131 (2005)","journal-title":"Inform. Proc. Letters"},{"key":"23_CR9","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":"23_CR10","unstructured":"Demers, A., Downing, A.: Minimum leaf spanning tree. US Patent no. 6,105,018 (August 2000)"},{"key":"23_CR11","unstructured":"Fernau, H.: Parameterized Algorithmics: A Graph-theoretic Approach. Habilitation thesis, U. T\u00fcbingen (2005)"},{"key":"23_CR12","unstructured":"Fernau, H.: Parameterized Algorithmics for Linear Arrangement Problems(manscript, July 2005)"},{"key":"23_CR13","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"23_CR14","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. ACM SIGACT News\u00a038, 31\u201345 (2007)","journal-title":"ACM SIGACT News"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s00224-007-1330-6","volume":"41","author":"G. Gutin","year":"2007","unstructured":"Gutin, G., Rafiey, A., Szeider, S., Yeo, A.: The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory of Computing Systems\u00a041, 521\u2013538 (2007)","journal-title":"Theory of Computing Systems"},{"key":"23_CR16","unstructured":"Gutin, G., Szeider, S., Yeo, A.: Fixed-Parameter Complexity of Minimum Profile Problems. Algorithmica (to appear)"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Heggernes, P., Paul, C., Telle, J.A., Villanger, Y.: Interval completion with few edges. In: Proc. STOC 2007 - 39th ACM Symposium on Theory of Computing, pp. 374\u2013381 (2007)","DOI":"10.1145\/1250790.1250847"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s004530010008","volume":"27","author":"S. Kapoor","year":"2000","unstructured":"Kapoor, S., Ramesh, H.: An Algorithm for Enumerating All Spanning Trees of a Directed Graph. Algorithmica\u00a027, 120\u2013130 (2000)","journal-title":"Algorithmica"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0012-365X(76)90107-2","volume":"15","author":"M. Las Vergnas","year":"1976","unstructured":"Las Vergnas, M.: Sur les arborescences dans un graphe orient\u00e9. Discrete Math.\u00a015, 27\u201329 (1976)","journal-title":"Discrete Math."},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jagm.1998.0996","volume":"31","author":"M. Mahajan","year":"1999","unstructured":"Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algorithms\u00a031, 335\u2013354 (1999)","journal-title":"J. Algorithms"},{"key":"23_CR21","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 University Press, Oxford (2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68880-8_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:17:04Z","timestamp":1620015424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68880-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688655","9783540688808"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68880-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}