Frank Kammer. A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem. In Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk, editors, Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers. Volume 8165 of Lecture Notes in Computer Science, pages 310-320, Springer, 2013. [doi]
@inproceedings{Kammer13,
title = {A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem},
author = {Frank Kammer},
year = {2013},
doi = {10.1007/978-3-642-45043-3_27},
url = {http://dx.doi.org/10.1007/978-3-642-45043-3_27},
researchr = {https://researchr.org/publication/Kammer13},
cites = {0},
citedby = {0},
pages = {310-320},
booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers},
editor = {Andreas Brandstädt and Klaus Jansen and Rüdiger Reischuk},
volume = {8165},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-45042-6},
}