| 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 | 2023-06-05 | Paper |
| Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality | 2023-03-09 | Paper |
| Flip-swap languages in binary reflected Gray code order | 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 | 2022-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4956509 | 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 | 2021-02-02 | Paper |
| A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles | 2020-01-28 | Paper |
| Solving the Sigma-Tau Problem | 2019-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633912 | 2019-05-06 | Paper |
| A framework for constructing de Bruijn sequences via simple successor rules | 2018-09-21 | Paper |
| Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence | 2018-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607918 | 2018-03-15 | Paper |
| Necklaces and Lyndon words in colexicographic and binary reflected Gray code order | 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 | 2017-05-29 | Paper |
| A simple shift rule for \(k\)-ary de Bruijn sequences | 2016-12-22 | Paper |
| Greedy flipping of pancakes and burnt pancakes | 2016-06-22 | Paper |
| The Grandmama de Bruijn Sequence for Binary Strings | 2016-05-03 | Paper |
| Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles | 2016-02-11 | Paper |
| A surprisingly simple de Bruijn sequence construction | 2015-10-08 | Paper |
| The coolest way to generate binary strings | 2015-01-21 | Paper |
| An explicit universal cycle for the ( n -1)-permutations of an n -set | 2014-11-18 | Paper |
| An explicit universal cycle for the \((n-1)\)-permutations of an \(n\)-set | 2014-11-18 | Paper |
| The lexicographically smallest universal cycle for binary strings with minimum specified weight | 2014-09-05 | Paper |
| Universal Cycles for Weight-Range Binary Strings | 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 | 2013-01-18 | Paper |
| Hamilton Cycles in Restricted and Incomplete Rotator Graphs | 2012-12-07 | Paper |
| The feline Josephus problem | 2012-12-06 | Paper |
| Shorthand universal cycles for permutations | 2012-11-21 | Paper |
| De Bruijn sequences for fixed-weight binary strings | 2012-09-12 | Paper |
| Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order | 2012-01-13 | Paper |
| Hamilton Cycles in Restricted Rotator Graphs | 2012-01-13 | Paper |
| Binary bubble languages and cool-lex order | 2011-11-11 | Paper |
| De Bruijn Sequences for the Binary Strings with Maximum Density | 2011-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576763 | 2010-08-02 | Paper |
| Faster Generation of Shorthand Universal Cycles for Permutations | 2010-07-20 | Paper |
| The coolest way to generate combinations | 2009-12-15 | Paper |
| Packing Dicycle Covers in Planar Graphs with No K 5–e Minor | 2008-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439690 | 2007-05-29 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
