@article{Char1968,
author = "Char, J.",
doi = "10.1109/TCT.1968.1082817",
issn = "0018-9324",
journal = "IEEE Transactions on Circuit Theory",
link = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1082817",
number = "3",
pages = "228--238",
title = "Generation of Trees, Two-Trees, and Storage of Master Forests",
uri = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1082817",
volume = "15",
year = "1968",
}
@inproceedings{Ferreira2011,
address = "Saarbr\"{u}cken, Germany",
author = "Ferreira, Rui and Grossi, Roberto and Rizzi, Romeo",
booktitle = "ESA 2011: the 19th Annual European Symposium on Algorithms",
doi = "10.1007/978-3-642-23719-5_24",
editor = "Demetrescu, Camil and Halld\'{o}rsson, Magn\'{u}s M.",
link = "http://link.springer.com/10.1007/978-3-642-23719-5_24",
month = "sep",
pages = "275--286",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Output-sensitive listing of bounded-size trees in undirected graphs",
uri = "http://link.springer.com/10.1007/978-3-642-23719-5_24",
volume = "6942",
year = "2011",
}
@article{Hikita1983,
author = "Hikita, Teruo",
doi = "10.1016/0020-0190(83)90046-7",
issn = "00200190",
journal = "Information Processing Letters",
keyword = "Binary tree generation,inorder-preorder sequences,subtree counting,subtree listing",
link = "http://www.sciencedirect.com/science/article/pii/0020019083900467 http://linkinghub.elsevier.com/retrieve/pii/0020019083900467",
month = "nov",
number = "4",
pages = "225--229",
title = "Listing and counting subtrees of equal size of a binary tree",
uri = "http://www.sciencedirect.com/science/article/pii/0020019083900467",
volume = "17",
year = "1983",
}
@article{Maxwell1966,
author = "Maxwell, L.M. and Cline, J.M.",
doi = "10.1049/piee.1966.0224",
issn = "00203270",
journal = "Proceedings of the Institution of Electrical Engineers",
number = "8",
pages = "1344",
title = "Topological network analysis by algebraic methods",
volume = "113",
year = "1966",
}
@article{Ruskey1981,
author = "Ruskey, Frank",
doi = "10.1137/0210011",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,1 subtrees were called,algorithms,in,in solving a certain,introduction,lexicographic enumeration ranking algorithm,networks,optimization problem on,ordered tree,problem of listing all,subtree,subtrees of a given,the problem originally arose,this paper studies the,tree cuts,we will also develop",
link = "http://epubs.siam.org/doi/abs/10.1137/0210011",
month = "feb",
number = "1",
pages = "141--150",
title = "Listing and Counting Subtrees of a Tree",
uri = "http://epubs.siam.org/doi/abs/10.1137/0210011",
volume = "10",
year = "1981",
}
@inproceedings{Wasa2012b,
address = "Sydney, Australia",
author = "Wasa, Kunihiro and Kaneta, Yusaku and Uno, Takeaki and Arimura, Hiroki",
booktitle = "COCOON 2012: the 18th Annual International Conference on Computing and Combinatorics",
doi = "10.1007/978-3-642-32241-9_30",
editor = "Gudmundsson, Joachim and Mestre, Juli\'{a}n and Viglas, Taso",
isbn = "978-3-642-32240-2",
link = "http://link.springer.com/chapter/10.1007/978-3-642-32241-9_30",
month = "aug",
pages = "347--359",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-32241-9_30",
volume = "7434",
year = "2012",
}
@inproceedings{Wasa2014,
address = "Jeonju, Korea",
author = "Wasa, Kunihiro and Arimura, Hiroki and Uno, Takeaki",
booktitle = "ISAAC 2014: the 25th International Symposium on Algorithms and Computation",
doi = "10.1007/978-3-319-13075-0_8",
editor = "Ahn, Hee-Kap and Shin, Chan-Su",
isbn = "978-3-642-17516-9",
issn = "0302-9743",
link = "http://link.springer.com/chapter/10.1007/978-3-319-13075-0_8",
month = "dec",
pages = "488",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph",
uri = "http://link.springer.com/chapter/10.1007/978-3-319-13075-0_8",
volume = "6506",
year = "2014",
}
@article{Wild2013,
author = "Wild, Marcel",
doi = "10.1007/s11083-013-9292-6",
issn = "0167-8094",
journal = "Order",
link = "http://link.springer.com/10.1007/s11083-013-9292-6",
month = "apr",
number = "1",
pages = "121--135",
title = "Output-Polynomial Enumeration of All Fixed-Cardinality Ideals of a Poset, Respectively All Fixed-Cardinality Subtrees of a Tree",
uri = "http://link.springer.com/10.1007/s11083-013-9292-6",
volume = "31",
year = "2013",
}