| Publication | Date of Publication | Type |
|---|
Enabling high reliability via matroidal connectivity and conditional matroidal connectivity on arrangement graph networks
Theoretical Computer Science | 2024-12-12 | Paper |
Two-disjoint-cycle-cover pancyclicity of data center networks
Applied Mathematics and Computation | 2024-07-11 | Paper |
A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks
International Journal of Foundations of Computer Science | 2024-07-09 | Paper |
On the minimum size of graphs with given generalized connectivity
Discrete Applied Mathematics | 2024-06-21 | Paper |
Improved algorithms for ranking and unranking \((k, m)\)-ary trees
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
Matroidal connectivity and conditional matroidal connectivity of star graphs
Theoretical Computer Science | 2023-10-17 | 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 |
Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes
Information Processing Letters | 2023-06-05 | Paper |
Constructing tri-CISTs in shuffle-cubes
Lecture Notes in Computer Science | 2023-03-30 | Paper |
The generalized 4-connectivity of pancake graphs
Discrete Applied Mathematics | 2023-01-11 | Paper |
Reliability assessment of the divide-and-swap cube in terms of generalized connectivity
Theoretical Computer Science | 2023-01-05 | Paper |
Neighbor connectivity of pancake graphs and burnt pancake graphs
Discrete Applied Mathematics | 2022-11-11 | Paper |
Constructing tri-CISTs in shuffle-cubes
Journal of Combinatorial Optimization | 2022-10-31 | Paper |
Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
scientific article; zbMATH DE number 7511525 (Why is no real title available?)
(available as arXiv preprint) | 2022-04-22 | Paper |
Three completely independent spanning trees of crossed cubes with application to secure-protection routing
Information Sciences | 2021-11-30 | Paper |
Parallel construction of multiple independent spanning trees on highly scalable datacenter networks
Applied Mathematics and Computation | 2021-11-16 | Paper |
Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes
Theoretical Computer Science | 2021-07-22 | Paper |
| A loopless algorithm for generating \((k, m)\)-ary trees in gray-code order | 2021-07-08 | Paper |
| On the Decycling Number of Bubble-sort Star Graphs | 2021-05-22 | Paper |
On component connectivity of hierarchical star networks
International Journal of Foundations of Computer Science | 2021-04-20 | Paper |
The reliability analysis based on the generalized connectivity in balanced hypercubes
Discrete Applied Mathematics | 2021-02-01 | Paper |
Constructing dual-CISTs of folded divide-and-swap cubes
Theoretical Computer Science | 2021-01-19 | Paper |
Reliability assessment of the Cayley graph generated by trees
Discrete Applied Mathematics | 2020-10-14 | Paper |
Relationship between extra edge connectivity and component edge connectivity for regular graphs
Theoretical Computer Science | 2020-08-03 | 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 |
Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes
Applied Mathematics and Computation | 2020-06-04 | Paper |
Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs
Discrete Applied Mathematics | 2020-05-18 | Paper |
Constructing dual-CISTs of DCell data center networks
Applied Mathematics and Computation | 2020-01-09 | 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 |
| Strong Menger connectedness of augmented $k$-ary $n$-cubes | 2019-10-02 | 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 |
A fast parallel algorithm for constructing independent spanning trees on parity cubes
Applied Mathematics and Computation | 2019-03-18 | Paper |
The 4-component connectivity of alternating group networks
Theoretical Computer Science | 2019-03-14 | Paper |
| The Component Connectivity of Alternating Group Graphs and Split-Stars | 2018-12-03 | Paper |
Improving the diameters of completely independent spanning trees in locally twisted cubes
Information Processing Letters | 2018-11-09 | Paper |
Realizing Exchanged Crossed Cube Communication Patterns on Linear Array WDM Optical Networks
International Journal of Foundations of Computer Science | 2018-11-01 | 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 |
Independent Spanning Trees on Multidimensional Torus Networks
IEEE Transactions on Computers | 2017-07-27 | Paper |
Construction independent spanning trees on locally twisted cubes in parallel
Journal of Combinatorial Optimization | 2017-06-22 | Paper |
Gray Codes for AT-Free Orders
(available as arXiv preprint) | 2017-06-20 | 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 parallel algorithm for constructing independent spanning trees in twisted cubes
Discrete Applied Mathematics | 2017-01-23 | 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 |
Solving the all-pairs-shortest-length problem on chordal bipartite graphs
Information Processing Letters | 2016-06-16 | Paper |
The recognition of geodetically connected graphs
Information Processing Letters | 2016-06-09 | Paper |
Locally exchanged twisted cubes: connectivity and super connectivity
Information Processing Letters | 2016-04-06 | Paper |
Gray codes for AT-free orders via antimatroids
Lecture Notes in Computer Science | 2016-04-04 | 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 |
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
Information Processing Letters | 2012-01-18 | Paper |
A quadratic algorithm for finding next-to-shortest paths in graphs
Algorithmica | 2011-09-20 | Paper |
Amortized efficiency of generating planar paths in convex position
Theoretical Computer Science | 2011-09-12 | Paper |
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
Discrete Applied Mathematics | 2011-08-10 | Paper |
Ranking and unranking of non-regular trees with a prescribed branching sequence
Mathematical and Computer Modelling | 2011-07-21 | Paper |
Independent spanning trees on folded hyper-stars
Networks | 2010-12-20 | 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 |
On the diameter of geometric path graphs of points in convex position
Information Processing Letters | 2010-06-16 | 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 |
CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2m, 2)
International Journal of Foundations of Computer Science | 2010-03-09 | Paper |
The interchange graphs of tournaments with minimum score vectors are exactly hypercubes
Graphs and Combinatorics | 2009-12-09 | Paper |
Feedback vertex sets in star graphs
Information Processing Letters | 2009-07-09 | Paper |
On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
Theoretical Computer Science | 2009-05-28 | Paper |
Sorting a sequence of strong kings in a tournament
Information Processing Letters | 2009-04-28 | Paper |
Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes
Applied Mathematics and Computation | 2009-02-25 | Paper |
The existence and uniqueness of strong kings in tournaments
Discrete Mathematics | 2008-05-13 | Paper |
Fault-tolerant cycle-embedding in alternating group graphs
Applied Mathematics and Computation | 2008-03-26 | Paper |
Geodesic-pancyclic graphs
Discrete Applied Mathematics | 2007-09-19 | Paper |
The lower and upper forcing geodetic numbers of block--cactus graphs
European Journal of Operational Research | 2006-10-25 | Paper |
| A sufficient condition for quasi-claw-free hamiltonian graphs. | 2006-10-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 |
An efficient distributed algorithm for finding all hinge vertices in networks
International Journal of Computer Mathematics | 2005-08-25 | Paper |
An efficient algorithm for estimating rotation distance between two binary trees
International Journal of Computer Mathematics | 2005-08-25 | Paper |
| scientific article; zbMATH DE number 2191988 (Why is no real title available?) | 2005-08-04 | Paper |
Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
Networks | 2005-01-12 | Paper |
Induced matchings in asteroidal triple-free graphs
Discrete Applied Mathematics | 2003-12-04 | Paper |
Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars.
Journal of Parallel and Distributed Computing | 2003-08-07 | Paper |
Recognizing hinge-free line graphs and total graphs
Taiwanese Journal of Mathematics | 2002-05-22 | Paper |
On the powers of graphs with bounded asteroidal number
Discrete Mathematics | 2001-10-03 | Paper |
| scientific article; zbMATH DE number 1522927 (Why is no real title available?) | 2001-08-12 | Paper |
A new way of counting \(n^ m\)
Computers & Mathematics with Applications | 1996-02-01 | Paper |
Task scheduling with precedence constraints to minimize the total completion time
International Journal of Systems Science. Principles and Applications of Systems and Integration | 1995-12-20 | Paper |
Packing internally disjoint Steiner paths of data center networks
(available as arXiv preprint) | N/A | Paper |
