| Publication | Date of Publication | Type |
|---|
| Matchings extend to Hamiltonian cycles in hypercubes with faulty edges | 2020-04-29 | Paper |
| Edge-fault-tolerant diameter and bipanconnectivity of hypercubes | 2017-11-03 | Paper |
| A fast algorithm for computing the determinants of banded circulant matrices | 2017-06-09 | Paper |
| Hamiltonicity of hypercubes with faulty vertices | 2016-03-01 | Paper |
| Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes | 2015-12-08 | Paper |
| Paired 2-disjoint path covers of multidimensional torus networks with faulty edges | 2015-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3447600 | 2015-10-27 | Paper |
| Construction of optimal independent spanning trees on folded hypercubes | 2015-09-25 | Paper |
| The 2-path-bipanconnectivity of hypercubes | 2015-09-23 | Paper |
| Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges | 2015-02-27 | Paper |
| Panconnectivity and edge-pancyclicity of multidimensional torus networks | 2014-09-12 | Paper |
| Paired many-to-many disjoint path covers of the hypercubes | 2014-04-16 | Paper |
| Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph | 2014-04-16 | Paper |
| Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs | 2013-04-04 | Paper |
| Cycles passing through a prescribed path in a hypercube with faulty edges | 2012-03-19 | Paper |
| Paired many-to-many disjoint path covers of hypercubes with faulty edges | 2012-03-09 | Paper |
| Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs | 2010-09-07 | Paper |
| Hamiltonian paths and cycles passing through a prescribed path in hypercubes | 2010-09-02 | Paper |
| On path bipancyclicity of hypercubes | 2010-08-16 | Paper |
| Some results on topological properties of folded hypercubes | 2010-06-16 | Paper |
| A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges | 2010-04-19 | Paper |
| Cycles passing through prescribed edges in a hypercube with some faulty edges | 2010-03-24 | Paper |
| Many-to-many disjoint paths in faulty hypercubes | 2009-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3513425 | 2008-08-06 | Paper |
| The construction of infinite families of any \(k\)-tight optimal and singular \(k\)-tight optimal directed double loop networks | 2007-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5292833 | 2007-06-25 | Paper |
| The number of spanning trees in directed circulant graphs with non-fixed jumps | 2007-05-23 | Paper |
| A new method for constructing infinite families of \(k\)-tight optimal double loop networks | 2007-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5489994 | 2006-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5490074 | 2006-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5717354 | 2006-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5717363 | 2006-01-13 | Paper |
| The number of spanning trees in odd valent circulant graphs | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707565 | 2004-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2749138 | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4531480 | 2002-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2743083 | 2001-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2743098 | 2001-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2743116 | 2001-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4489800 | 2000-11-19 | Paper |
| Some families of chromatically unique bipartite graphs | 2000-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232254 | 1999-03-15 | Paper |
| A new method for constructing minimal broadcast networks | 1993-02-18 | Paper |
| Study on the values of broadcast function \(B(2^ k-2)\) and \(B(2^ k- 1)\) | 1993-01-17 | Paper |
