Amortized Efficiency of Generation, Ranking and Unranking Left-Child Sequences in Lexicographic Order
Kung-Jui Pai, Jou-Ming Chang, Ro-Yu Wu, Shun-Chieh Chang
Discrete Applied Mathematics, Vol. 268, (2019) pp. 223-236.

The above article has been cited by the articles listed below.
  1. Yu-Hsuan Chang, Ro-Yu Wu, Ruay-Shiung Chang, Jou-Ming Chang, Improved algorithms for ranking and unranking (k,m)-ary trees, 13th International Conference on Algorithmic Aspects in Information and Management (AAIM 2019), Beijing, China, Aug. 6-8, 2019, Lecture Notes in Computer Science, vol. 10640, pp. 16-28.

  2. Yuriy Shablya, Dmitry Kruchinin, Vladimir Kruchinin, Method for developing combinatorial generation algorithms based on AND/OR trees and its application, Mathematics 8 (2020) 962. (*)

  3. Yu-Hsuan Chang, Ro-Yu Wu, Cheng-Kuan Lin, Jou-Ming Chang, A loopless algorithm for generating (k,m)-ary trees in Gray code order, Optimization Letters 15(4) (2021) 1133-1154. (*)

  4. James F. Korsh, Counting and randomly generating k-ary trees, Applied Mathematics 12(12) (2021) 1210-1215.

  5. Yu-Hsuan Chang, Ro-Yu Wu, Ruay-Shiung Chang, Jou-Ming Chang, Improved algorithms for ranking and unranking (k,m)-ary trees in B-order, Journal of Combinatorial Optimization 44(3) (2022) 1495-1510. (*)

  6. Majid Yousefikhoshbakht, Azam Dolatnezhadsomarin, Esmaile Khorram New decision-making approaches for ranking of non-dominated points for multi-objective optimization problems, Scientia Iranica.

  7. Oleg Fedorovich, Viktor Kosenko, Liudmyla Lutai, Iaroslav Zamirets Methods and models of research of investment attractiveness and competitiveness of project-oriented enterprise in the process of creating innovative high-tech, Innovative Technologies and Scientific Solutions for Industries No. 3(21) 51-59(2022) 1495-1510.

Times cited: 3 (from Web of Science)