| Publication | Date of Publication | Type |
|---|
Two-round probabilistic diagnosis algorithm for fault identification
Discrete Applied Mathematics | 2026-07-02 | Paper |
Concentration phenomenon of h-extra edge-connectivity in the n-th Cartesian product of K₉ - C₉ with large-scale faulty links
Discrete Applied Mathematics | 2026-06-12 | Paper |
An efficient two-stage diagnostic algorithm for assessing system reliability
Theoretical Computer Science | 2026-01-05 | Paper |
Edge isoperimetric method: at least \(2 / 3\) of \(h\)-extra edge-connectivity of a kind of cube-based graphs concentrates on \(2^{n - 1}\)
Discrete Applied Mathematics | 2025-04-28 | Paper |
The reliability of (n,k)-star network in terms of non-inclusive fault pattern
Theoretical Computer Science | 2025-04-16 | Paper |
Evaluating the reliability of complete Josephus cubes under extra link fault with the optimal solution of the edge isoperimetric problem
Theoretical Computer Science | 2025-02-12 | Paper |
Connectivity and diagnosability of the complete Josephus cube networks under h-extra fault-tolerant model
Theoretical Computer Science | 2024-11-07 | Paper |
\( R_3\)-connectivity of folded hypercubes
Discrete Applied Mathematics | 2020-08-31 | Paper |
Conditional diagnosability of component-composition graphs under the PMC model
Theoretical Computer Science | 2020-08-25 | Paper |
Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality
Journal of Computer and System Sciences | 2017-11-14 | Paper |
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Pancyclicity of Matching Composition Networks under the Conditional Fault Model
IEEE Transactions on Computers | 2017-07-12 | Paper |
An Improved Approximation Ratio to the Partial-Terminal Steiner Tree Problem
IEEE Transactions on Computers | 2017-05-16 | Paper |
Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks
Information and Computation | 2016-11-18 | Paper |
Approximation algorithms for the star k-hub center problem in metric graphs
Lecture Notes in Computer Science | 2016-09-02 | Paper |
\(\{2,3\}\)-restricted connectivity of locally twisted cubes
Theoretical Computer Science | 2016-01-21 | Paper |
An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2
Journal of Discrete Algorithms | 2015-11-17 | Paper |
Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths
Discrete Applied Mathematics | 2014-11-28 | Paper |
The internal Steiner tree problem: Hardness and approximations
Journal of Complexity | 2013-01-14 | Paper |
Pancyclicity of restricted hypercube-like networks under the conditional fault model
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Diagnosability of Two-Matching Composition Networks
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Hamiltonicity of Matching Composition Networks with Conditional Edge Faults
Lecture Notes in Computer Science | 2008-05-27 | Paper |
