| Publication | Date of Publication | Type |
|---|
An algorithm for conditional-fault local diagnosis of multiprocessor systems under the \(\mathrm{MM}^\ast\) model
Theoretical Computer Science | 2024-03-01 | Paper |
| A new measure for locally \(t\)-diagnosable under PMC model | 2023-03-30 | Paper |
A new structure for a vertex to be locally \(t\)-diagnosable in large multiprocessor systems
Theoretical Computer Science | 2022-10-06 | Paper |
Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks
Information Sciences | 2020-07-20 | Paper |
Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs
IEEE Transactions on Computers | 2018-09-14 | Paper |
Fault tolerance properties of pyramid networks
IEEE Transactions on Computers | 2018-07-09 | Paper |
| On the extremal number of edges in Hamiltonian graphs | 2012-03-02 | Paper |
The construction of mutually independent Hamiltonian cycles in bubble-sort graphs
International Journal of Computer Mathematics | 2010-11-12 | Paper |
On the extremal number of edges in Hamiltonian connected graphs
Applied Mathematics Letters | 2010-01-08 | Paper |
Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs
Discrete Mathematics | 2009-12-15 | Paper |
Short containers in Cayley graphs
Discrete Applied Mathematics | 2009-06-30 | Paper |
On the spanning fan-connectivity of graphs
Discrete Applied Mathematics | 2009-06-30 | Paper |
On the spanning connectivity and spanning laceability of hypercube-like networks
Theoretical Computer Science | 2007-09-03 | Paper |
On the spanningw-wide diameter of the star graph
Networks | 2007-02-02 | Paper |
| scientific article; zbMATH DE number 2149828 (Why is no real title available?) | 2005-03-30 | Paper |
Generalized diameters of the mesh of trees
Theory of Computing Systems | 2004-10-01 | Paper |
On the hardness of counting problems of complete mappings.
Discrete Mathematics | 2004-03-14 | Paper |
On shortest three-edge-connected Steiner networks with Euclidean distance
Discrete Applied Mathematics | 2003-07-29 | Paper |
On connectivity of consecutive-\(d\) digraphs
Discrete Mathematics | 2002-12-02 | Paper |
On the enumeration of Abelian \(K\)-complete mappings
Congressus Numerantium | 2002-09-17 | Paper |
| On shortest two-connected Steiner networks with Euclidean distance | 2002-07-21 | Paper |
On minimum-weight \(k\)-edge connected Steiner networks on metric spaces
Graphs and Combinatorics | 2001-10-04 | Paper |
| scientific article; zbMATH DE number 1472120 (Why is no real title available?) | 2001-07-22 | Paper |
Fault-tolerant routing in circulant networks and cycle prefix networks
Annals of Combinatorics | 1999-11-11 | Paper |
Packet routing in fixed-connection networks: A survey
Journal of Parallel and Distributed Computing | 1999-04-19 | Paper |
Super line-connectivity of consecutive-\(d\) digraphs
Discrete Mathematics | 1998-05-04 | Paper |
Combinatorial properties of generalized hypercube graphs
Information Processing Letters | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 895361 (Why is no real title available?) | 1997-01-05 | Paper |
On the diameter vulnerability of Kautz digraphs
Discrete Mathematics | 1996-12-09 | Paper |
| scientific article; zbMATH DE number 828047 (Why is no real title available?) | 1996-04-23 | Paper |
| scientific article; zbMATH DE number 867632 (Why is no real title available?) | 1996-04-22 | Paper |
| scientific article; zbMATH DE number 857070 (Why is no real title available?) | 1996-03-17 | Paper |
On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
Discrete Mathematics | 1994-12-08 | Paper |
The Hamiltonian property of consecutive-\(d\) digraphs
Mathematical and Computer Modelling | 1994-06-12 | Paper |
Extremal Problems in the Construction of Distributed Loop Networks
SIAM Journal on Discrete Mathematics | 1994-05-12 | Paper |
ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS
International Journal of Foundations of Computer Science | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 219243 (Why is no real title available?) | 1993-06-29 | Paper |
Connectivity of consecutive-\(d\) digraphs
Discrete Applied Mathematics | 1993-01-16 | Paper |
Distributed loop network with minimum transmission delay
Theoretical Computer Science | 1992-09-27 | Paper |
Foreword to the special issue ``Advances in graph labelling
Discrete Mathematics | 1992-06-28 | Paper |
Partitionable starters for twin prime power type
Discrete Mathematics | 1991-01-01 | Paper |
A combinatorial problem related to distributed loop networks
Networks | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4204369 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4116781 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 3910418 (Why is no real title available?) | 1985-01-01 | Paper |
On Graceful Directed Graphs
SIAM Journal on Algebraic Discrete Methods | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3863228 (Why is no real title available?) | 1982-01-01 | Paper |
Harmonious labelings of windmill graphs and related graphs
Journal of Graph Theory | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3781227 (Why is no real title available?) | 1981-01-01 | Paper |
Cyclic neofields and combinatorial designs
Lecture Notes in Mathematics | 1980-01-01 | Paper |
