Reference21 articles.
1. Lecture Notes in Computer Science 1276;V Berry,1997
2. Böcker, S. 1999. From Subtrees to Supertrees. Ph.D. thesis, Universität Bielefeld, Germany. (Available from http://archiv.ub.uni-bielefeld.de/disshabi/2000/0001.ps)
3. Böcker, S. 2002. Exponentially many supertrees. Applied Mathematical Letters 15:861–865.
4. Böcker, S., Bryant, D., Dress, A. W., and Steel, M. A. 2000. Algorithmic aspects of tree amalgamation. Journal ofAlgorithms 37:522–537.
5. Böcker, S.
and Dress, A. W. 2001. Patchworks. Advances in Mathematics 157:1–21.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献