Joachim Kneis, Alexander Langer, Peter Rossmanith. A New Algorithm for Finding Trees with Many Leaves. In Seok-Hee Hong, Hiroshi Nagamochi, Takuro Fukunaga, editors, Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings. Volume 5369 of Lecture Notes in Computer Science, pages 270-281, Springer, 2008. [doi]
@inproceedings{KneisLR08, title = {A New Algorithm for Finding Trees with Many Leaves}, author = {Joachim Kneis and Alexander Langer and Peter Rossmanith}, year = {2008}, doi = {10.1007/978-3-540-92182-0_26}, url = {http://dx.doi.org/10.1007/978-3-540-92182-0_26}, researchr = {https://researchr.org/publication/KneisLR08}, cites = {0}, citedby = {0}, pages = {270-281}, booktitle = {Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings}, editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga}, volume = {5369}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-540-92181-3}, }