| Publication | Date of Publication | Type |
|---|
Reliability analysis of exchanged hypercubes based on the path connectivity
Discrete Applied Mathematics | 2024-09-26 | Paper |
A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks
International Journal of Foundations of Computer Science | 2024-07-09 | Paper |
A tree structure for local diagnosis in multiprocessor systems under the comparison model
Theoretical Computer Science | 2024-03-05 | Paper |
Embedding three edge-disjoint Hamiltonian cycles into locally twisted cubes
| 2023-03-30 | Paper |
Constructing tri-CISTs in shuffle-cubes
Lecture Notes in Computer Science | 2023-03-30 | Paper |
Constructing tri-CISTs in shuffle-cubes
Journal of Combinatorial Optimization | 2022-10-31 | Paper |
Three completely independent spanning trees of crossed cubes with application to secure-protection routing
Information Sciences | 2021-11-30 | Paper |
Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes
Theoretical Computer Science | 2021-07-22 | Paper |
A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes
| 2021-07-05 | Paper |
Constructing dual-CISTs of folded divide-and-swap cubes
Theoretical Computer Science | 2021-01-19 | Paper |
Two kinds of generalized 3-connectivities of alternating group networks
| 2020-07-07 | Paper |
Comments on: ``A Hamilton sufficient condition for completely independent spanning tree
Discrete Applied Mathematics | 2020-06-29 | Paper |
A well-equalized 3-CIST partition of alternating group graphs
Information Processing Letters | 2019-12-19 | 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 |
Improving the diameters of completely independent spanning trees in locally twisted cubes
Information Processing Letters | 2018-11-09 | 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 |
On the Orbits of Crossed Cubes
| 2017-07-21 | Paper |
Corrigendum to: ``Incidence coloring on hypercubes.
Theoretical Computer Science | 2017-03-16 | Paper |
A note on path embedding in crossed cubes with faulty vertices
Information Processing Letters | 2017-02-21 | Paper |
Amortized efficiency of ranking and unranking left-child sequences in lexicographic order
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Constructing two completely independent spanning trees in hypercube-variant networks
Theoretical Computer Science | 2016-11-04 | Paper |
Vertex-transitivity on folded crossed cubes
Information Processing Letters | 2016-07-27 | 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 |
A comment on ``Independent spanning trees in crossed cubes
Information Processing Letters | 2014-08-28 | 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 |
Restricted power domination and fault-tolerant power domination on grids
Discrete Applied Mathematics | 2010-10-11 | Paper |
Upper bounds on the queue number of \(k\)-ary \(n\)-cubes
Information Processing Letters | 2010-09-02 | Paper |
A note on ``An improved upper bound on the queue number of the hypercube
Information Processing Letters | 2010-06-09 | Paper |
Erratum to: ``A new upper bound on the queuenumber of hypercubes
Discrete Mathematics | 2010-05-28 | Paper |
A new upper bound on the queuenumber of hypercubes
Discrete Mathematics | 2010-04-27 | Paper |
