| Publication | Date of Publication | Type |
|---|
| Distance-constrained labellings of Cartesian products of graphs | 2021-09-30 | Paper |
| The partial line digraph technique in the design of large interconnection networks | 2018-09-14 | Paper |
| Decomposing almost complete graphs by random trees | 2017-11-09 | Paper |
| Approximate results for rainbow labelings | 2017-04-25 | Paper |
| On star forest ascending subgraph decomposition | 2017-02-17 | Paper |
| On the ascending subgraph decomposition problem for bipartite graphs | 2016-05-13 | Paper |
| Decomposing almost complete graphs by random trees | 2016-05-13 | Paper |
| On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity | 2014-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5420003 | 2014-06-11 | Paper |
| Almost Every Tree With m Edges Decomposes K2m,2m | 2014-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857407 | 2013-11-01 | Paper |
| On the Sumset Partition Problem | 2013-10-10 | Paper |
| On vosperian and superconnected vertex-transitive digraphs | 2013-05-13 | Paper |
| On the modular sumset partition problem | 2012-05-04 | Paper |
| Magic and antimagic \(H\)-decompositions | 2012-03-16 | Paper |
| Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors | 2011-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576692 | 2010-07-30 | Paper |
| Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) | 2010-04-27 | Paper |
| On a conjecture of Graham and Häggkvist with the polynomial method | 2009-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3625875 | 2009-05-22 | Paper |
| On complete subsets of the cyclic group | 2008-12-08 | Paper |
| On a Häggkvist's Conjecture with the Polynomial Method | 2008-06-05 | Paper |
| Cycle-magic graphs | 2007-11-30 | Paper |
| Largest cliques in connected supermagic graphs | 2007-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3433938 | 2007-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5480723 | 2006-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4659585 | 2005-03-21 | Paper |
| Edge-decompositions ofKn,ninto isomorphic copies of a given tree | 2005-02-16 | Paper |
| Covering a finite abelian group by subset sums | 2004-10-19 | Paper |
| Minimum degree and minimum number of edge-disjoint trees | 2004-02-02 | Paper |
| On Restricted Sums | 2001-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505234 | 2000-09-26 | Paper |
| An isoperimetric problem in Cayley graphs | 2000-05-18 | Paper |
| On Sets with a Small Subset Sum | 2000-03-19 | Paper |
| On Isoperimetric Connectivity in Vertex-Transitive Graphs | 2000-03-19 | Paper |
| On subsets with small product in torsion-free groups | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4236613 | 1999-03-28 | Paper |
| On the tree number of regular graphs | 1998-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4717035 | 1997-08-20 | Paper |
| Small cutsets in quasiminimal Cayley graphs | 1996-12-08 | Paper |
| Minimum order of loop networks of given degree and girth | 1995-11-09 | Paper |
| The connectivity of hierarchical Cayley digraphs | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3984532 | 1992-06-27 | Paper |
| Vosperian and superconnected abelian Cayley digraphs | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3791171 | 1988-01-01 | Paper |
