| Publication | Date of Publication | Type |
|---|
Improved algorithms for ranking and unranking \((k, m)\)-ary trees
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
Generating spanning-tree sequences of a fan graph in lexicographic order and ranking/unranking algorithms
Lecture Notes in Computer Science | 2023-08-03 | Paper |
Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
Three completely independent spanning trees of crossed cubes with application to secure-protection routing
Information Sciences | 2021-11-30 | Paper |
A loopless algorithm for generating \((k, m)\)-ary trees in gray-code order
| 2021-07-08 | Paper |
Two kinds of generalized 3-connectivities of alternating group networks
| 2020-07-07 | Paper |
Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks
Journal of Combinatorial Optimization | 2019-10-29 | Paper |
Constructing three completely independent spanning trees in locally twisted cubes
| 2019-10-11 | Paper |
Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
Discrete Applied Mathematics | 2019-09-19 | Paper |
A two-stages tree-searching algorithm for finding three completely independent spanning trees
Theoretical Computer Science | 2019-08-13 | Paper |
A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order
Frontiers in Algorithmics | 2019-04-26 | Paper |
The 4-component connectivity of alternating group networks
Theoretical Computer Science | 2019-03-14 | Paper |
Constructing independent spanning trees on bubble-sort networks
| 2018-10-04 | Paper |
A parallel construction of vertex-disjoint spanning trees with optimal heights in star networks
| 2018-02-26 | Paper |
Corrigendum to: ``Incidence coloring on hypercubes.
Theoretical Computer Science | 2017-03-16 | Paper |
Amortized efficiency of ranking and unranking left-child sequences in lexicographic order
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
A loopless algorithm for generating multiple binary tree sequences simultaneously
Theoretical Computer Science | 2016-06-27 | Paper |
Incidence coloring on hypercubes
Theoretical Computer Science | 2016-06-27 | Paper |
Locally exchanged twisted cubes: connectivity and super connectivity
Information Processing Letters | 2016-04-06 | Paper |
A loopless algorithm for generating multiple binary tree sequences simultaneously
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Amortized efficiency of generating planar paths in convex position
Theoretical Computer Science | 2011-09-12 | Paper |
Ranking and unranking of non-regular trees with a prescribed branching sequence
Mathematical and Computer Modelling | 2011-07-21 | Paper |
On the diameter of geometric path graphs of points in convex position
Information Processing Letters | 2010-06-16 | Paper |
A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
Theoretical Computer Science | 2006-04-28 | Paper |
