@article{dmtcs:1256,
    title      = {A Parameterized Measure-and-ConquerAnalysis for Finding a k-Leaf Spanning Treein an Undirected Graph},
    author     = {Daniel Binkele-Raible and Henning Fernau},
    url        = {https://dmtcs.episciences.org/1256},
    doi        = {10.46298/dmtcs.1256},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {Vol. 16 no. 1},
    issuetitle = {Discrete Algorithms},
    eid        = 14,
    year       = {2014},
    month      = {Mar},
    keywords   = {Parameterized algorithms, graph algorithms, spanning trees, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]},
    language   = {English},
}