| Publication | Date of Publication | Type |
|---|
| An algorithm for conditional-fault local diagnosis of multiprocessor systems under the \(\mathrm{MM}^\ast\) model | 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 | 2022-10-06 | Paper |
| Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks | 2020-07-20 | Paper |
| Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs | 2018-09-14 | Paper |
| Fault tolerance properties of pyramid networks | 2018-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3118590 | 2012-03-02 | Paper |
| The construction of mutually independent Hamiltonian cycles in bubble-sort graphs | 2010-11-12 | Paper |
| On the extremal number of edges in Hamiltonian connected graphs | 2010-01-08 | Paper |
| Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs | 2009-12-15 | Paper |
| Short containers in Cayley graphs | 2009-06-30 | Paper |
| On the spanning fan-connectivity of graphs | 2009-06-30 | Paper |
| On the spanning connectivity and spanning laceability of hypercube-like networks | 2007-09-03 | Paper |
| On the spanningw-wide diameter of the star graph | 2007-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4662345 | 2005-03-30 | Paper |
| Generalized diameters of the mesh of trees | 2004-10-01 | Paper |
| On the hardness of counting problems of complete mappings. | 2004-03-14 | Paper |
| On shortest three-edge-connected Steiner networks with Euclidean distance | 2003-07-29 | Paper |
| On connectivity of consecutive-\(d\) digraphs | 2002-12-02 | Paper |
| On the enumeration of Abelian \(K\)-complete mappings | 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 | 2001-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4489171 | 2001-07-22 | Paper |
| Fault-tolerant routing in circulant networks and cycle prefix networks | 1999-11-11 | Paper |
| Packet routing in fixed-connection networks: A survey | 1999-04-19 | Paper |
| Super line-connectivity of consecutive-\(d\) digraphs | 1998-05-04 | Paper |
| Combinatorial properties of generalized hypercube graphs | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4883373 | 1997-01-05 | Paper |
| On the diameter vulnerability of Kautz digraphs | 1996-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4859013 | 1996-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873745 | 1996-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4870158 | 1996-03-17 | Paper |
| On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs | 1994-12-08 | Paper |
| The Hamiltonian property of consecutive-\(d\) digraphs | 1994-06-12 | Paper |
| Extremal Problems in the Construction of Distributed Loop Networks | 1994-05-12 | Paper |
| ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694729 | 1993-06-29 | Paper |
| Connectivity of consecutive-\(d\) digraphs | 1993-01-16 | Paper |
| Distributed loop network with minimum transmission delay | 1992-09-27 | Paper |
| Foreword to the special issue ``Advances in graph labelling | 1992-06-28 | Paper |
| Partitionable starters for twin prime power type | 1991-01-01 | Paper |
| A combinatorial problem related to distributed loop networks | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3353038 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4731351 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3688412 | 1985-01-01 | Paper |
| On Graceful Directed Graphs | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3331243 | 1982-01-01 | Paper |
| Harmonious labelings of windmill graphs and related graphs | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3960885 | 1981-01-01 | Paper |
| Cyclic neofields and combinatorial designs | 1980-01-01 | Paper |
