| Publication | Date of Publication | Type |
|---|
Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults
International Journal of Foundations of Computer Science | 2023-08-16 | Paper |
Torus-like graphs and their paired many-to-many disjoint path covers
Discrete Applied Mathematics | 2020-12-29 | Paper |
Characterization of interval graphs that are unpaired 2-disjoint path coverable
Theoretical Computer Science | 2020-04-22 | Paper |
Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs
Journal of Computer and System Sciences | 2019-08-07 | Paper |
Disjoint path covers joining prescribed source and sink sets in interval graphs
Theoretical Computer Science | 2019-05-29 | Paper |
A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph
Information Processing Letters | 2018-12-05 | Paper |
Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$
IEEE Transactions on Computers | 2017-10-19 | Paper |
Disjoint path covers with path length constraints in restricted hypercube-like graphs
Journal of Computer and System Sciences | 2017-09-07 | Paper |
Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
IEEE Transactions on Computers | 2017-08-08 | Paper |
A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
Discrete Applied Mathematics | 2016-12-28 | Paper |
Paired many-to-many disjoint path covers in restricted hypercube-like graphs
Theoretical Computer Science | 2016-05-18 | Paper |
Algorithms for finding disjoint path covers in unit interval graphs
Discrete Applied Mathematics | 2016-04-07 | Paper |
Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
Theoretical Computer Science | 2016-01-28 | Paper |
Ore-type degree conditions for disjoint path covers in simple graphs
Discrete Mathematics | 2015-12-08 | Paper |
Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
Information Sciences | 2015-09-23 | Paper |
Many-to-many two-disjoint path covers in cylindrical and toroidal grids
Discrete Applied Mathematics | 2015-04-28 | Paper |
The bicube: an interconnection of two hypercubes
International Journal of Computer Mathematics | 2015-03-25 | Paper |
An approach to conditional diagnosability analysis under the PMC model and its application to torus networks
Theoretical Computer Science | 2014-08-27 | Paper |
Disjoint path covers in cubes of connected graphs
Discrete Mathematics | 2014-05-06 | Paper |
Single-source three-disjoint path covers in cubes of connected graphs
Information Processing Letters | 2014-04-11 | Paper |
Many-to-many two-disjoint path covers in restricted hypercube-like graphs
Theoretical Computer Science | 2014-03-28 | Paper |
Paired many-to-many disjoint path covers in faulty hypercubes
Theoretical Computer Science | 2014-01-13 | Paper |
Strong matching preclusion under the conditional fault model
Discrete Applied Mathematics | 2013-04-25 | Paper |
General-demand disjoint path covers in a graph with faulty elements
International Journal of Computer Mathematics | 2013-01-22 | Paper |
Strong matching preclusion
Theoretical Computer Science | 2012-01-09 | Paper |
Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements
Theoretical Computer Science | 2011-09-12 | Paper |
Fault-Hamiltonicity of product graph of path and cycle
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Conditional matching preclusion for hypercube-like interconnection networks
Theoretical Computer Science | 2009-07-10 | Paper |
Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
Theoretical Computer Science | 2008-03-05 | Paper |
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science | 2007-06-06 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
Longest paths and cycles in faulty star graphs
Journal of Parallel and Distributed Computing | 2005-01-31 | Paper |
scientific article; zbMATH DE number 1420914 (Why is no real title available?)
| 2000-08-03 | Paper |
Embedding trees in recursive circulants
Discrete Applied Mathematics | 1997-04-13 | Paper |
An optimal algorithm for finding the edge visibility polygon under limited visibility
Information Processing Letters | 1997-02-28 | Paper |
On the construction of regular minimal broadcast digraphs
Theoretical Computer Science | 1994-04-05 | Paper |
On the number of guard edges of a polygon
Discrete \& Computational Geometry | 1994-01-19 | Paper |
