Meirav Zehavi. The k-Leaf Spanning Tree Problem Admits a Klam Value of 39. In Zsuzsanna Lipták, William F. Smyth, editors, Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers. Volume 9538 of Lecture Notes in Computer Science, pages 346-357, Springer, 2015. [doi]
@inproceedings{Zehavi15-1,
title = {The k-Leaf Spanning Tree Problem Admits a Klam Value of 39},
author = {Meirav Zehavi},
year = {2015},
doi = {10.1007/978-3-319-29516-9_29},
url = {http://dx.doi.org/10.1007/978-3-319-29516-9_29},
researchr = {https://researchr.org/publication/Zehavi15-1},
cites = {0},
citedby = {0},
pages = {346-357},
booktitle = {Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers},
editor = {Zsuzsanna Lipták and William F. Smyth},
volume = {9538},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-29515-2},
}