| Publication | Date of Publication | Type |
|---|
| Star transposition gray codes for multiset permutations | 2024-04-23 | Paper |
| Packing coloring of hypercubes with extended Hamming codes | 2023-12-22 | Paper |
| Star transposition Gray codes for multiset permutations | 2023-10-12 | Paper |
| On the central levels problem | 2023-03-23 | Paper |
| The Hamilton compression of highly symmetric graphs | 2022-05-17 | Paper |
| Gray codes and symmetric chains | 2022-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002744 | 2021-07-28 | Paper |
| Modelling simultaneous broadcasting by level-disjoint partitions | 2019-12-12 | Paper |
| On the central levels problem | 2019-12-03 | Paper |
| Rooted level-disjoint partitions of Cartesian products | 2019-03-15 | Paper |
| A short proof of the middle levels theorem | 2019-01-09 | Paper |
| Broadcasting multiple messages in the 1-in port model in optimal time | 2018-12-06 | Paper |
| Extending perfect matchings to Gray codes with prescribed ends | 2018-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636639 | 2018-04-19 | Paper |
| Trimming and gluing Gray codes | 2018-02-06 | Paper |
| Towards a problem of Ruskey and Savage on matching extendability | 2018-01-18 | Paper |
| Note on incidence chromatic number of subquartic graphs | 2017-10-17 | Paper |
| Generalized Gray codes with prescribed ends | 2017-02-27 | Paper |
| Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model | 2017-02-01 | Paper |
| Hamiltonian laceability of hypercubes without isometric subgraphs | 2017-01-13 | Paper |
| On incidence coloring conjecture in Cartesian products of graphs | 2016-09-12 | Paper |
| Linear extension diameter of level induced subposets of the Boolean lattice | 2014-07-29 | Paper |
| On the mutually independent Hamiltonian cycles in faulty hypercubes | 2014-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857368 | 2013-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857380 | 2013-11-01 | Paper |
| Hypercube 1-factorizations from extended Hamming codes | 2013-10-10 | Paper |
| Embedded paths and cycles in faulty hypercubes | 2013-10-10 | Paper |
| Long cycles in hypercubes with optimal number of faulty vertices | 2013-01-03 | Paper |
| Linear time construction of a compressed Gray code | 2012-11-15 | Paper |
| Testing connectivity of faulty networks in sublinear time | 2012-09-13 | Paper |
| Parity vertex colorings of binomial trees | 2012-09-05 | Paper |
| Queue Layouts of Hypercubes | 2012-08-22 | Paper |
| Gray codes with bounded weights | 2012-08-10 | Paper |
| Efficient Connectivity Testing of Hypercubic Networks with Faults | 2011-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576719 | 2010-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575453 | 2010-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575463 | 2010-07-27 | Paper |
| On generalized middle-level problem | 2010-07-20 | Paper |
| Path partitions of hypercubes | 2010-06-09 | Paper |
| Gray Code Compression | 2009-12-11 | Paper |
| Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices | 2009-11-27 | Paper |
| Long paths and cycles in hypercubes with faulty vertices | 2009-10-01 | Paper |
| Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes | 2009-06-17 | Paper |
| Hamiltonian fault-tolerance of hypercubes | 2008-06-05 | Paper |
| Hamiltonian paths with prescribed edges in hypercubes | 2007-06-26 | Paper |
| Recursive fault-tolerance of Fibonacci cube in hypercubes | 2006-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536361 | 2002-10-07 | Paper |
| The Hamilton compression of highly symmetric graphs | 0001-01-03 | Paper |
| Combinatorial generation via permutation languages. VI. Binary trees | 0001-01-03 | Paper |
| Hamiltonian graphs are cup-stackable | 0001-01-03 | Paper |
| Generating all invertible matrices by row operations | 0001-01-03 | Paper |
