| Flip-swap languages in binary reflected Gray code order | 0 | 0.34 | 2022 |
| Inside the Binary Reflected Gray Code - Flip-Swap Languages in 2-Gray Code Order. | 0 | 0.34 | 2021 |
| Block Dude Puzzles are NP-Hard (and the Rugs Really Tie the Reductions Together). | 0 | 0.34 | 2021 |
| Turning Around and Around - Motion Planning through Thick and Thin Turnstiles. | 0 | 0.34 | 2021 |
| Solving the Sigma-Tau Problem | 0 | 0.34 | 2020 |
| Combinatorial generation via permutation languages. I. Fundamentals. | 0 | 0.34 | 2019 |
| A framework for constructing de Bruijn sequences via simple successor rules. | 0 | 0.34 | 2018 |
| Constructing de Bruijn sequences with co-lexicographic order: The k-ary Grandmama sequence. | 3 | 0.40 | 2018 |
| Sto-Stone is NP-Complete. | 0 | 0.34 | 2018 |
| A Paper on Pencils - A Pencil and Paper Puzzle - Pencils is NP-Complete. | 0 | 0.34 | 2018 |
| Switches are PSPACE-Complete. | 0 | 0.34 | 2018 |
| Generating Puzzle Progressions to Study Mental Model Matching. | 0 | 0.34 | 2018 |
| A Hamilton Path for the Sigma-Tau Problem. | 0 | 0.34 | 2018 |
| Necklaces and Lyndon words in colexicographic and binary reflected Gray code order. | 1 | 0.36 | 2017 |
| A simple shift rule for k-ary de Bruijn sequences. | 0 | 0.34 | 2017 |
| Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences. | 1 | 0.40 | 2017 |
| A surprisingly simple de Bruijn sequence construction | 9 | 0.77 | 2016 |
| Greedy Flipping of Pancakes and Burnt Pancakes | 2 | 0.38 | 2016 |
| Super Mario Bros. is Harder/Easier Than We Thought. | 1 | 0.36 | 2016 |
| The Grandmama de Bruijn Sequence for Binary Strings. | 3 | 0.42 | 2016 |
| Single-Player and Two-Player Buttons & Scissors Games. | 0 | 0.34 | 2016 |
| Successor rules for flipping pancakes and burnt pancakes. | 0 | 0.34 | 2016 |
| Generalizing the Classic Greedy and Necklace Constructions of de Bruijn Sequences and Universal Cycles. | 2 | 0.40 | 2016 |
| Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). | 0 | 0.34 | 2015 |
| Buttons & Scissors is NP-Complete. | 0 | 0.34 | 2015 |
| The lexicographically smallest universal cycle for binary strings with minimum specified weight. | 3 | 0.41 | 2014 |
| The Coolest Way to Generate Binary Strings. | 9 | 0.62 | 2014 |
| The greedy gray code algorithm | 5 | 0.52 | 2013 |
| A 'Hot Potato' Gray Code for Permutations. | 0 | 0.34 | 2013 |
| Universal Cycles for Weight-Range Binary Strings. | 6 | 0.50 | 2013 |
| Greedy Pancake Flipping. | 5 | 0.51 | 2013 |
| Shorthand Universal Cycles for Permutations | 5 | 0.49 | 2012 |
| Binary bubble languages and cool-lex order | 8 | 0.53 | 2012 |
| Cool-lex order and k-ary Catalan structures | 3 | 0.41 | 2012 |
| Efficient Oracles for Generating Binary Bubble Languages. | 6 | 0.51 | 2012 |
| The coolest order of binary strings | 6 | 0.51 | 2012 |
| The Feline Josephus Problem | 1 | 0.78 | 2012 |
| Hamilton Cycles in Restricted and Incomplete Rotator Graphs. | 1 | 0.36 | 2012 |
| De Bruijn Sequences for Fixed-Weight Binary Strings. | 12 | 0.69 | 2012 |
| Ranking and loopless generation of k-ary dyck words in cool-lex order | 2 | 0.37 | 2011 |
| De Bruijn sequences for the binary strings with maximum density | 6 | 0.52 | 2011 |
| Hamilton cycles in restricted rotator graphs | 2 | 0.42 | 2011 |
| Faster generation of shorthand universal cycles for permutations | 5 | 0.54 | 2010 |
| An explicit universal cycle for the (n-1)-permutations of an n-set | 14 | 0.87 | 2010 |
| The coolest way to generate combinations | 18 | 0.97 | 2009 |
| Advances in packing directed joins | 0 | 0.34 | 2005 |
