| Publication | Date of Publication | Type |
|---|
| On the central levels problem | 2026-03-18 | Paper |
Generating all invertible matrices by row operations
Discrete Mathematics | 2025-12-15 | Paper |
| Pattern-avoiding binary trees -- generation, counting, and bijections | 2025-07-24 | Paper |
Graphs that admit a Hamilton path are cup-stackable
Discrete Mathematics | 2025-03-06 | Paper |
Packing coloring of hypercubes with extended Hamming codes
Discrete Applied Mathematics | 2024-11-06 | Paper |
Combinatorial generation via permutation languages. VI: Binary trees
European Journal of Combinatorics | 2024-09-30 | Paper |
| The Hamilton compression of highly symmetric graphs | 2024-08-06 | Paper |
| 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
Journal of Graph Theory | 2023-10-12 | Paper |
On the central levels problem
Journal of Combinatorial Theory. Series B | 2023-03-23 | Paper |
| The Hamilton compression of highly symmetric graphs | 2022-05-17 | Paper |
Gray codes and symmetric chains
Journal of Combinatorial Theory. Series B | 2022-01-26 | Paper |
Gray codes and symmetric chains
Journal of Combinatorial Theory. Series B | 2022-01-26 | Paper |
| Gray codes and symmetric chains | 2021-07-28 | Paper |
Modelling simultaneous broadcasting by level-disjoint partitions
Applied Mathematics and Computation | 2019-12-12 | Paper |
On the central levels problem
(available as arXiv preprint) | 2019-12-03 | Paper |
Rooted level-disjoint partitions of Cartesian products
Applied Mathematics and Computation | 2019-03-15 | Paper |
A short proof of the middle levels theorem
Discrete Analysis | 2019-01-09 | Paper |
Broadcasting multiple messages in the 1-in port model in optimal time
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
Extending perfect matchings to Gray codes with prescribed ends
The Electronic Journal of Combinatorics | 2018-06-27 | Paper |
| Trimming and gluing Gray codes | 2018-04-19 | Paper |
Trimming and gluing Gray codes
Theoretical Computer Science | 2018-02-06 | Paper |
Trimming and gluing Gray codes
Theoretical Computer Science | 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
Journal of Combinatorial Optimization | 2017-10-17 | Paper |
Generalized Gray codes with prescribed ends
Theoretical Computer Science | 2017-02-27 | Paper |
Time-optimal broadcasting of multiple messages in 1-in port model
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Hamiltonian laceability of hypercubes without isometric subgraphs
Graphs and Combinatorics | 2017-01-13 | Paper |
On incidence coloring conjecture in Cartesian products of graphs
Discrete Applied Mathematics | 2016-09-12 | Paper |
Linear extension diameter of level induced subposets of the Boolean lattice
European Journal of Combinatorics | 2014-07-29 | Paper |
On the mutually independent Hamiltonian cycles in faulty hypercubes
Information Sciences | 2014-04-16 | Paper |
| On the queue-number of the hypercube | 2013-11-01 | Paper |
| Linear extension diameter of subposets of Boolean lattice induced by two levels | 2013-11-01 | Paper |
Long paths and cycles in faulty hypercubes: existence, optimality, complexity
Journal of Combinatorial Optimization | 2013-10-10 | Paper |
Hypercube 1-factorizations from extended Hamming codes
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Long cycles in hypercubes with optimal number of faulty vertices
Journal of Combinatorial Optimization | 2013-01-03 | Paper |
Linear time construction of a compressed Gray code
European Journal of Combinatorics | 2012-11-15 | Paper |
Testing connectivity of faulty networks in sublinear time
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Parity vertex colorings of binomial trees
Discussiones Mathematicae. Graph Theory | 2012-09-05 | Paper |
Queue layouts of hypercubes
SIAM Journal on Discrete Mathematics | 2012-08-22 | Paper |
Gray codes with bounded weights
Discrete Mathematics | 2012-08-10 | Paper |
Efficient connectivity testing of hypercubic networks with faults
Lecture Notes in Computer Science | 2011-05-19 | Paper |
| Spanning paths in hypercubes | 2010-07-30 | Paper |
| scientific article; zbMATH DE number 5761830 (Why is no real title available?) | 2010-07-27 | Paper |
| Long cycles in hypercubes with distant faulty vertices | 2010-07-27 | Paper |
On generalized middle-level problem
Information Sciences | 2010-07-20 | Paper |
Path partitions of hypercubes
Information Processing Letters | 2010-06-09 | Paper |
Gray code compression
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
Long paths and cycles in hypercubes with faulty vertices
Information Sciences | 2009-10-01 | Paper |
Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes
Discrete Mathematics | 2009-06-17 | Paper |
Hamiltonian fault-tolerance of hypercubes
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Hamiltonian paths with prescribed edges in hypercubes
Discrete Mathematics | 2007-06-26 | Paper |
Recursive fault-tolerance of Fibonacci cube in hypercubes
Discrete Mathematics | 2006-08-04 | Paper |
| scientific article; zbMATH DE number 1759412 (Why is no real title available?) | 2002-10-07 | Paper |
Combinatorial generation via permutation languages. VI. Binary trees
(available as arXiv preprint) | N/A | Paper |
Hamiltonian graphs are cup-stackable
(available as arXiv preprint) | N/A | Paper |
Generating all invertible matrices by row operations
(available as arXiv preprint) | N/A | Paper |
