Paul Bonsma, Frederic Dorn. Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree. ACM Transactions on Algorithms, 7(4):44, 2011. [doi]
@article{BonsmaD11,
title = {Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree},
author = {Paul Bonsma and Frederic Dorn},
year = {2011},
doi = {10.1145/2000807.2000812},
url = {http://doi.acm.org/10.1145/2000807.2000812},
researchr = {https://researchr.org/publication/BonsmaD11},
cites = {0},
citedby = {0},
journal = {ACM Transactions on Algorithms},
volume = {7},
number = {4},
pages = {44},
}