| Publication | Date of Publication | Type |
|---|
| Vertex-independent spanning trees in complete Josephus cubes | 2024-12-12 | Paper |
| High fault-tolerant performance of the divide-and-swap cube network | 2024-11-06 | Paper |
| Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength | 2024-04-24 | Paper |
| An algorithm for conditional-fault local diagnosis of multiprocessor systems under the \(\mathrm{MM}^\ast\) model | 2024-03-01 | Paper |
| Reliability evaluation for a class of recursive match networks | 2024-02-23 | Paper |
| Enhancing fault tolerance of balanced hypercube networks by the edge partition method | 2024-01-16 | Paper |
| Fault tolerance of recursive match networks based on \(g\)-good-neighbor fault pattern | 2023-11-13 | Paper |
| Edge-independent spanning trees in folded crossed cubes | 2023-08-08 | Paper |
| Reliability evaluation of complete graph-based recursive networks | 2023-06-21 | Paper |
| Reliabilities for two kinds of graphs with smaller diameters | 2023-04-21 | Paper |
| The \(t/m\)-diagnosis strategy of augmented \(k\)-ary \(n\)-cubes | 2023-02-01 | Paper |
| A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks | 2022-12-21 | Paper |
| Connectivity and constructive algorithms of disjoint paths in dragonfly networks | 2022-06-13 | Paper |
| Embedding complete multi-partite graphs into Cartesian product of paths and cycles | 2022-03-14 | Paper |
| Efficient algorithms for support path with time constraint | 2021-08-11 | Paper |
| Constructing Node-Independent Spanning Trees in Augmented Cubes | 2021-05-20 | Paper |
| Communication Performance Evaluation of the Locally Twisted Cube | 2021-04-20 | Paper |
| The Conditional-(g, d, k)-Connectivity and Conditional-(g, d, k)-edge-Connectivity on the Hypercubes* | 2020-11-16 | Paper |
| The reliability analysis of \(k\)-ary \(n\)-cube networks | 2020-08-17 | Paper |
| Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks | 2020-07-20 | Paper |
| An improved algorithm to construct edge-independent spanning trees in augmented cubes | 2020-03-23 | Paper |
| The extra connectivity and extra diagnosability of regular interconnection networks | 2020-01-29 | Paper |
| Reliability analysis of data center networks based on precise and imprecise diagnosis strategies | 2020-01-29 | Paper |
| The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell | 2019-03-14 | Paper |
| IRIBE: intrusion-resilient identity-based encryption | 2018-05-22 | Paper |
| A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices | 2018-05-14 | Paper |
| Super spanning connectivity on WK-recursive networks | 2018-02-06 | Paper |
| Cycles Embedding in Exchanged Crossed Cube | 2017-04-26 | Paper |
| Edge-independent spanning trees in augmented cubes | 2017-03-16 | Paper |
| Conditional fault-tolerant routing of (n,k)-star graphs | 2017-01-27 | Paper |
| Constructing completely independent spanning trees in crossed cubes | 2017-01-23 | Paper |
| Structure connectivity and substructure connectivity of hypercubes | 2016-05-18 | Paper |
| The restricted \(h\)-connectivity of the data center network DCell | 2016-03-18 | Paper |
| An efficient algorithm to construct disjoint path covers of DCell networks | 2015-12-08 | Paper |
| Hamiltonian properties of honeycomb meshes | 2015-09-23 | Paper |
| One-to-one disjoint path covers on alternating group graphs | 2014-12-02 | Paper |
| On the metric dimension of HDN | 2014-04-28 | Paper |
| Independent spanning trees in crossed cubes | 2014-04-16 | Paper |
| Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes | 2014-04-02 | Paper |
| Changing the diameter of the locally twisted cube | 2013-10-08 | Paper |
| One-to-one communication in twisted cubes under restricted connectivity | 2013-07-04 | Paper |
| The spined cube: a new hypercube variant with smaller diameter | 2013-03-28 | Paper |
| An algorithm to construct independent spanning trees on parity cubes | 2013-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3165331 | 2012-10-26 | Paper |
| Forward-secure identity-based public-key encryption without random oracles | 2012-05-04 | Paper |
| Independent spanning trees on twisted cubes | 2012-02-14 | Paper |
| An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges | 2011-07-14 | Paper |
| Efficient unicast in bijective connection networks with the restricted faulty node set | 2011-06-22 | Paper |
| Embedding meshes into twisted-cubes | 2011-06-22 | Paper |
| Forward-secure identity-based signature: security notions and construction | 2011-01-28 | Paper |
| Embedding meshes into locally twisted cubes | 2010-09-08 | Paper |
| Node-pancyclicity and edge-pancyclicity of crossed cubes | 2009-08-27 | Paper |
| Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model | 2009-08-14 | Paper |
| Embedding of cycles in twisted cubes with edge-pancyclic | 2008-07-01 | Paper |
| Edge-pancyclicity and path-embeddability of bijective connection graphs | 2008-01-11 | Paper |
| Embedding meshes into crossed cubes | 2007-07-25 | Paper |
| Optimal fault-tolerant embedding of paths in twisted cubes | 2007-02-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Complete path embeddings in crossed cubes | 2006-10-19 | Paper |
| Hamilton-connectivity and cycle-embedding of the Möbius cubes | 2002-07-14 | Paper |
