Chakraborty S, Chakraborty M and Pal R. (2024). Generation of all rooted trees up to a given height. Innovations in Systems and Software Engineering. 20:3. (467-475). Online publication date: 1-Sep-2024.

https://doi.org/10.1007/s11334-022-00467-1

Chakraborty S, Bhattacharyya R, Chakraborty M and Pal R. (2023). Generation of All Rooted Ordered Trees. Applied Computing for Software and Smart Systems. 10.1007/978-981-99-7783-3_1. (3-19).

https://link.springer.com/10.1007/978-981-99-7783-3_1

Parque V. Learning Obstacle-Avoiding Lattice Paths using Swarm Heuristics: Exploring the Bijection to Ordered Trees. 2022 IEEE Congress on Evolutionary Computation (CEC). (1-8).

https://doi.org/10.1109/CEC55065.2022.9870344

Varrette S, Kieffer E and Pinel F. (2022). Optimizing the Resource and Job Management System of an Academic HPC & Research Computing Facility 2022 21st International Symposium on Parallel and Distributed Computing (ISPDC). 10.1109/ISPDC55340.2022.00027. 978-1-6654-8802-0. (129-137).

https://ieeexplore.ieee.org/document/9934965/

Parque V and Miyashita T. (2021). An Efficient Scheme for the Generation of Ordered Trees in Constant Amortized Time 2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM). 10.1109/IMCOM51814.2021.9377349. 978-1-6654-2318-2. (1-8).

https://ieeexplore.ieee.org/document/9377349/

Mohammadi S and Nowzari-Dalini A. (2017). A parallel algorithm for generation of RNA secondary structures with length n and k base-pairs. Iran Journal of Computer Science. 10.1007/s42044-017-0001-2. 1:1. (11-17). Online publication date: 1-Apr-2018.

http://link.springer.com/10.1007/s42044-017-0001-2

Hoppe T and Petrone A. (2019). Integer sequence discovery from small graphs. Discrete Applied Mathematics. 201:C. (172-181). Online publication date: 11-Mar-2016.

https://doi.org/10.1016/j.dam.2015.07.017

Yamanaka K, Otachi Y and Nakano S. (2012). Efficient enumeration of ordered trees with <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>k</mml:mi></mml:math> leaves. Theoretical Computer Science. 10.1016/j.tcs.2011.01.017. 442. (22-27). Online publication date: 1-Jul-2012.

http://linkinghub.elsevier.com/retrieve/pii/S030439751100051X

ISHIKAWA M, YAMANAKA K, OTACHI Y and NAKANO S. (2012). Enumerating All Rooted Trees Including k Leaves. IEICE Transactions on Information and Systems. 10.1587/transinf.E95.D.763. E95-D:3. (763-768).

http://joi.jlc.jst.go.jp/JST.JSTAGE/transinf/E95.D.763?from=CrossRef

Yamanaka K, Otachi Y and Nakano S. Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract). Proceedings of the 3rd International Workshop on Algorithms and Computation. (141-150).

https://doi.org/10.1007/978-3-642-00202-1_13

Chakraborty S, Bhattacharyya R, Chakraborty M and Pal R. Generation of All Rooted Ordered Trees. SSRN Electronic Journal. 10.2139/ssrn.4167527.

https://www.ssrn.com/abstract=4167527