| Publication | Date of Publication | Type |
|---|
Pop \& Push: ordered tree iteration in \(\mathcal{O}(1)\)-time
| 2024-09-11 | Paper |
On the hardness of Gray code problems for combinatorial objects
| 2024-07-19 | Paper |
Generating signed permutations by twisting two-sided ribbons
| 2024-05-31 | Paper |
Constant time and space updates for the sigma-tau problem
| 2024-05-29 | Paper |
Cordial forests
| 2024-05-29 | Paper |
Rolling polyhedra on tessellations
| 2024-05-16 | Paper |
All your bases are belong to us: listing all bases of a matroid by greedy exchanges
| 2024-05-16 | Paper |
Pattern Avoidance for Fibonacci Sequences using $k$-Regular Words
| 2023-12-26 | Paper |
Concatenation trees: A framework for efficient universal cycle and de Bruijn sequence constructions
| 2023-08-23 | Paper |
Constructing the first (and coolest) fixed-content universal cycle
Algorithmica | 2023-06-05 | Paper |
Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality
Algorithmica | 2023-03-09 | Paper |
Flip-swap languages in binary reflected Gray code order
Theoretical Computer Science | 2022-09-27 | Paper |
A shift Gray code for fixed-content Łukasiewicz words
| 2022-08-30 | Paper |
Inside the binary reflected gray code: flip-swap languages in 2-gray code order
| 2022-05-20 | Paper |
A Hamilton cycle in the \(k\)-sided pancake network
| 2022-03-22 | Paper |
Combinatorial generation via permutation languages. I: Fundamentals
Transactions of the American Mathematical Society | 2022-03-10 | Paper |
Pairwise disagreements of Kekulé, Clar, and Fries numbers for benzenoids: a mathematical and computational investigation
| 2021-09-02 | Paper |
Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order
| 2021-05-07 | Paper |
A Hamilton Cycle in the $k$-Sided Pancake Network
| 2021-03-16 | Paper |
Combinatorial generation via permutation languages
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Solving the sigma-tau problem
ACM Transactions on Algorithms | 2019-12-02 | Paper |
scientific article; zbMATH DE number 7051269 (Why is no real title available?)
| 2019-05-06 | Paper |
A framework for constructing de Bruijn sequences via simple successor rules
Discrete Mathematics | 2018-09-21 | Paper |
Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
European Journal of Combinatorics | 2018-06-28 | Paper |
scientific article; zbMATH DE number 6850346 (Why is no real title available?)
| 2018-03-15 | Paper |
Necklaces and Lyndon words in colexicographic and binary reflected Gray code order
Journal of Discrete Algorithms | 2017-11-09 | Paper |
Super Mario Bros. is harder/easier than we thought
| 2017-07-17 | Paper |
Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
Journal of Discrete Algorithms | 2017-05-29 | Paper |
A simple shift rule for \(k\)-ary de Bruijn sequences
Discrete Mathematics | 2016-12-22 | Paper |
Greedy flipping of pancakes and burnt pancakes
Discrete Applied Mathematics | 2016-06-22 | Paper |
The grandmama de Bruijn sequence for binary strings
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
The Electronic Journal of Combinatorics | 2016-02-11 | Paper |
A surprisingly simple de Bruijn sequence construction
Discrete Mathematics | 2015-10-08 | Paper |
The coolest way to generate binary strings
Theory of Computing Systems | 2015-01-21 | Paper |
An explicit universal cycle for the \((n-1)\)-permutations of an \(n\)-set
ACM Transactions on Algorithms | 2014-11-18 | Paper |
The lexicographically smallest universal cycle for binary strings with minimum specified weight
Journal of Discrete Algorithms | 2014-09-05 | Paper |
Universal Cycles for Weight-Range Binary Strings
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Hamiltonicity of the Cayley Digraph on the Symmetric Group Generated by {\sigma} = (1 2 ... n) and {\tau} = (1 2)
| 2013-07-09 | Paper |
Cool-lex order and \(k\)-ary Catalan structures
Journal of Discrete Algorithms | 2013-01-18 | Paper |
Hamilton cycles in restricted and incomplete rotator graphs
Journal of Graph Algorithms and Applications | 2012-12-07 | Paper |
The feline Josephus problem
Theory of Computing Systems | 2012-12-06 | Paper |
Shorthand universal cycles for permutations
Algorithmica | 2012-11-21 | Paper |
De Bruijn sequences for fixed-weight binary strings
SIAM Journal on Discrete Mathematics | 2012-09-12 | Paper |
Ranking and loopless generation of \(k\)-ary Dyck words in cool-lex order
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Hamilton cycles in restricted rotator graphs
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Binary bubble languages and cool-lex order
Journal of Combinatorial Theory. Series A | 2011-11-11 | Paper |
De Bruijn sequences for the binary strings with maximum density
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
Hamming distance from irreducible polynomials over \(\mathbb F_2\)
| 2010-08-02 | Paper |
Faster generation of shorthand universal cycles for permutations
Lecture Notes in Computer Science | 2010-07-20 | Paper |
The coolest way to generate combinations
Discrete Mathematics | 2009-12-15 | Paper |
Packing Dicycle Covers in Planar Graphs with No K 5–e Minor
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
scientific article; zbMATH DE number 5158510 (Why is no real title available?)
| 2007-05-29 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
