| Publication | Date of Publication | Type |
|---|
| New upper bound on \(m\)-time-relaxed \(k\)-broadcast graphs | 2024-05-03 | Paper |
| Line-broadcasting in complete \(k\)-ary trees | 2018-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3134374 | 2018-02-09 | Paper |
| Gossiping and set-to-set broadcasting in weighted graphs | 2017-06-13 | Paper |
| Anti-Ramsey numbers of small graphs. | 2016-10-26 | Paper |
| Anti-Ramsey numbers of graphs with small connected components | 2016-06-13 | Paper |
| Efficient construction of broadcast graphs | 2014-05-06 | Paper |
| \(k\)-port line broadcasting in trees | 2011-08-24 | Paper |
| On graph labeling problems and regular decompositions of complete graphs | 2011-06-29 | Paper |
| On zero-sum partitions and anti-magic trees | 2009-06-19 | Paper |
| The depression of a graph and the diameter of its line graph | 2009-06-17 | Paper |
| On rainbow connection | 2009-04-07 | Paper |
| Bertrand's postulate, the prime number theorem and product anti-magic graphs | 2008-02-14 | Paper |
| Connected colorings of graphs. | 2006-06-26 | Paper |
| Gracefulness, group sequencings and graph factorizations | 2006-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5466078 | 2005-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5460884 | 2005-07-20 | Paper |
| A note: Some results in step domination of trees | 2005-02-22 | Paper |
| Dense graphs are antimagic | 2005-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4798524 | 2003-06-18 | Paper |
| Regular Oberwolfach problems and group sequencings | 2003-05-11 | Paper |
| Performance analysis of hybrid network multiprocessor architecture | 2003-01-27 | Paper |
| On some Ramsey numbers of unicyclic graphs | 2002-10-13 | Paper |
| Efficient line broadcasting in a \(d\)-dimensional grid | 2002-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552171 | 2002-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552227 | 2002-08-29 | Paper |
| Transitive large sets of disjoint decompositions and group sequencings | 2002-08-29 | Paper |
| Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees | 2002-07-01 | Paper |
| On colored designs. III: On lambda-colored \(H\)-designs, \(H\) having \(\lambda\) edges | 2002-05-28 | Paper |
| Monotone paths in edge-ordered sparse graphs | 2001-05-21 | Paper |
| Computation of broadcasting multiple messages in a positive weighted tree | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500623 | 2001-01-23 | Paper |
| On Hering decomposition of DK\(_n\) induced by group actions on conjugacy classes | 2000-06-07 | Paper |
| On colored designs. I | 1999-05-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4388199 | 1998-05-17 | Paper |
| On a reconstruction problem for sequences | 1997-09-14 | Paper |
| On broadcasting multiple messages in a \(d\)-dimensional grid | 1997-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4856616 | 1996-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873676 | 1996-04-17 | Paper |
| On colored designs. II | 1995-08-27 | Paper |
| Zero-sum partition theorems for graphs | 1995-03-20 | Paper |
| Bounds for the harmonious chromatic number of a graph | 1994-09-15 | Paper |
| More on vertex-switching reconstruction | 1994-08-28 | Paper |
| Acyclic edge-colorings of sparse graphs | 1994-05-24 | Paper |
| On induced subgraphs of trees, with restricted degrees | 1994-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4201555 | 1993-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4201561 | 1993-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4015311 | 1993-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3991016 | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4712032 | 1992-06-25 | Paper |
| On the largest tree of given maximum degree in a connected graph | 1991-01-01 | Paper |
| Switching reconstruction and diophantine equations | 1991-01-01 | Paper |
| A note on packing trees into complete bipartite graphs and on Fishburn's conjecture | 1990-01-01 | Paper |
| A note on the k-domination number of a graph | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3201068 | 1990-01-01 | Paper |
| Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3490027 | 1990-01-01 | Paper |
| Combinatorial reconstruction problems | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3801590 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3804741 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3476841 | 1988-01-01 | Paper |
| A monotone path in an edge-ordered graph | 1987-01-01 | Paper |
| Balance equations for reconstruction problems | 1987-01-01 | Paper |
| Reconstructing graphs from their k-edge deleted subgraphs | 1987-01-01 | Paper |
| The packing and covering of the complete graph. I: The forests of order five | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3699702 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3760574 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3718755 | 1985-01-01 | Paper |
| Packing and covering of the complete graph with a graph G of four vertices or less | 1983-01-01 | Paper |
| 3K2-decomposition of a graph | 1982-01-01 | Paper |
| On Rolle's theorem — the mean value theorems and applications | 1982-01-01 | Paper |
| On covering Kn+1 by T1,...,Tn special trees | 1981-01-01 | Paper |
| On the class reconstruction number of trees | N/A | Paper |
