| Publication | Date of Publication | Type |
|---|
| Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults | 2023-08-16 | Paper |
| Torus-like graphs and their paired many-to-many disjoint path covers | 2020-12-29 | Paper |
| Characterization of interval graphs that are unpaired 2-disjoint path coverable | 2020-04-22 | Paper |
| Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs | 2019-08-07 | Paper |
| Disjoint path covers joining prescribed source and sink sets in interval graphs | 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 | 2018-12-05 | Paper |
| Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$ | 2017-10-19 | Paper |
| Disjoint path covers with path length constraints in restricted hypercube-like graphs | 2017-09-07 | Paper |
| Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements | 2017-08-08 | Paper |
| A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph | 2016-12-28 | Paper |
| Paired many-to-many disjoint path covers in restricted hypercube-like graphs | 2016-05-18 | Paper |
| Algorithms for finding disjoint path covers in unit interval graphs | 2016-04-07 | Paper |
| Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs | 2016-01-28 | Paper |
| Ore-type degree conditions for disjoint path covers in simple graphs | 2015-12-08 | Paper |
| Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs | 2015-09-23 | Paper |
| Many-to-many two-disjoint path covers in cylindrical and toroidal grids | 2015-04-28 | Paper |
| The bicube: an interconnection of two hypercubes | 2015-03-25 | Paper |
| An approach to conditional diagnosability analysis under the PMC model and its application to torus networks | 2014-08-27 | Paper |
| Disjoint path covers in cubes of connected graphs | 2014-05-06 | Paper |
| Single-source three-disjoint path covers in cubes of connected graphs | 2014-04-11 | Paper |
| Many-to-many two-disjoint path covers in restricted hypercube-like graphs | 2014-03-28 | Paper |
| Paired many-to-many disjoint path covers in faulty hypercubes | 2014-01-13 | Paper |
| Strong matching preclusion under the conditional fault model | 2013-04-25 | Paper |
| General-demand disjoint path covers in a graph with faulty elements | 2013-01-22 | Paper |
| Strong matching preclusion | 2012-01-09 | Paper |
| Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements | 2011-09-12 | Paper |
| Fault-Hamiltonicity of Product Graph of Path and Cycle | 2011-03-18 | Paper |
| Conditional matching preclusion for hypercube-like interconnection networks | 2009-07-10 | Paper |
| Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\) | 2008-03-05 | Paper |
| Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements | 2007-06-06 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| Longest paths and cycles in faulty star graphs | 2005-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944984 | 2000-08-03 | Paper |
| Embedding trees in recursive circulants | 1997-04-13 | Paper |
| An optimal algorithm for finding the edge visibility polygon under limited visibility | 1997-02-28 | Paper |
| On the construction of regular minimal broadcast digraphs | 1994-04-05 | Paper |
| On the number of guard edges of a polygon | 1994-01-19 | Paper |
