Generating Combinations by Prefix Shifts. - Frank Ruskey; Aaron Williams 001 (COCOON, 2005)

Advances in packing directed joins. - Aaron Michael Williams; Bertrand Guenin (Electron. Notes Discret. Math., 2005)

Packing Dicycle Covers in Planar Graphs with No K5-e Minor. - Orlando Lee; Aaron Williams 001 (LATIN, 2006)

An explicit universal cycle for the (n-1)-permutations of an n-set - Frank Ruskey; Aaron Williams 001 (CoRR, 2007)

Generating Balanced Parentheses and Binary Trees by Prefix Shifts. - Frank Ruskey; Aaron Williams 001 (CATS, 2008)

Loopless generation of multiset permutations using a constant number of variables by prefix shifts. - Aaron Williams 001 (SODA, 2009)

The coolest way to generate combinations. - Frank Ruskey; Aaron Williams 001 (Discret. Math., 2009)

Shift gray codes. - Aaron Michael Williams (2009)

Faster Generation of Shorthand Universal Cycles for Permutations. - Alexander E. Holroyd; Frank Ruskey; Aaron Williams 001 (COCOON, 2010)

O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List. - Aaron Williams 001 (FUN, 2010)

An explicit universal cycle for the (n-1)-permutations of an n-set. - Frank Ruskey; Aaron Williams 001 (ACM Trans. Algorithms, 2010)

Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order. - Stephane Durocher; Pak Ching Li; Debajyoti Mondal; Aaron Williams 001 (IWOCA, 2011)

Hamilton Cycles in Restricted Rotator Graphs. - Brett Stevens; Aaron Williams 001 (IWOCA, 2011)

De Bruijn Sequences for the Binary Strings with Maximum Density. - Joe Sawada; Brett Stevens; Aaron Williams 001 (WALCOM, 2011)

The Coolest Order of Binary Strings. - Brett Stevens; Aaron Williams 001 (FUN, 2012)

Shorthand Universal Cycles for Permutations. - Alexander E. Holroyd; Frank Ruskey; Aaron Williams 001 (Algorithmica, 2012)

Efficient Oracles for Generating Binary Bubble Languages. - Joe Sawada; Aaron Williams 001 (Electron. J. Comb., 2012)

Binary bubble languages and cool-lex order. - Frank Ruskey; Joe Sawada; Aaron Williams 001 (J. Comb. Theory A, 2012)

Cool-lex order and k-ary Catalan structures. - Stephane Durocher; Pak Ching Li; Debajyoti Mondal; Frank Ruskey; Aaron Williams 001 (J. Discrete Algorithms, 2012)

Hamilton Cycles in Restricted and Incomplete Rotator Graphs. - Brett Stevens; Aaron Williams 001 (J. Graph Algorithms Appl., 2012)

The Feline Josephus Problem. - Frank Ruskey; Aaron Williams 001 (Theory Comput. Syst., 2012)

De Bruijn Sequences for Fixed-Weight Binary Strings. - Frank Ruskey; Joe Sawada; Aaron Williams 001 (SIAM J. Discret. Math., 2012)

Universal Cycles for Weight-Range Binary Strings. - Joe Sawada; Aaron Williams 001; Dennis Chi-Him Wong (IWOCA, 2013)

A 'Hot Potato' Gray Code for Permutations. - Xi Sisi Shen; Aaron Williams 001 (Electron. Notes Discret. Math., 2013)

Greedy Pancake Flipping. - Aaron Williams 001; Joe Sawada (Electron. Notes Discret. Math., 2013)

A Gray code for fixed-density necklaces and Lyndon words in constant amortized time. - Joe Sawada; Aaron Williams 001 (Theor. Comput. Sci., 2013)

The lexicographically smallest universal cycle for binary strings with minimum specified weight. - Joe Sawada; Aaron Williams 001; Dennis Wong (J. Discrete Algorithms, 2014)

The Coolest Way to Generate Binary Strings. - Brett Stevens; Aaron Williams 001 (Theory Comput. Syst., 2014)

Buttons & Scissors is NP-Complete. - Harrison Gregg; Jody Leonard; Aaron Santiago; Aaron Williams 001 (CCCG, 2015)

Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). - Kyle Burke; Erik D. Demaine; Harrison Gregg; Robert A. Hearn; Adam Hesterberg; Michael Hoffmann 001; Hiro Ito; Irina Kostitsyna; Jody Leonard; Maarten Löffler; Aaron Santiago; Christiane Schmidt 001; et al. (JCDCGG, 2015)

Super Mario Bros. is Harder/Easier Than We Thought. - Erik D. Demaine; Giovanni Viglietta; Aaron Williams 001 (FUN, 2016)

The Grandmama de Bruijn Sequence for Binary Strings. - Patrick Baxter Dragon; Oscar I. Hernandez; Aaron Williams 001 (LATIN, 2016)

Generalizing the Classic Greedy and Necklace Constructions of de Bruijn Sequences and Universal Cycles. - Joe Sawada; Aaron Williams 001; Dennis Wong (Electron. J. Comb., 2016)

Single-Player and Two-Player Buttons & Scissors Games. - Kyle Burke; Erik D. Demaine; Harrison Gregg; Robert A. Hearn; Adam Hesterberg; Michael Hoffmann 001; Hiro Ito; Irina Kostitsyna; Jody Leonard; Maarten Löffler; Aaron Santiago; Christiane Schmidt 001; et al. (CoRR, 2016)

Greedy flipping of pancakes and burnt pancakes. - Joe Sawada; Aaron Williams 001 (Discret. Appl. Math., 2016)

A surprisingly simple de Bruijn sequence construction. - Joe Sawada; Aaron Williams 001; Dennis Wong (Discret. Math., 2016)

Successor rules for flipping pancakes and burnt pancakes. - Joe Sawada; Aaron Williams 001 (Theor. Comput. Sci., 2016)

A simple shift rule for k-ary de Bruijn sequences. - Joe Sawada; Aaron Williams 001; Dennis Wong (Discret. Math., 2017)

Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences. - Joe Sawada; Aaron Williams 001 (J. Discrete Algorithms, 2017)

Necklaces and Lyndon words in colexicographic and binary reflected Gray code order. - Joe Sawada; Aaron Williams 001; Dennis Wong (J. Discrete Algorithms, 2017)

Sto-Stone is NP-Complete. - Addison Allen; Aaron Williams 001 (CCCG, 2018)

Switches are PSPACE-Complete. - Jonathan Gabor; Aaron Williams 001 (CCCG, 2018)

A Paper on Pencils: A Pencil and Paper Puzzle - Pencils is NP-Complete. - Daniel Packer; Sophia White; Aaron Williams 001 (CCCG, 2018)

A Hamilton Path for the Sigma-Tau Problem. - Joe Sawada; Aaron Williams 001 (SODA, 2018)

A framework for constructing de Bruijn sequences via simple successor rules. - Daniel Gabric; Joe Sawada; Aaron Williams 001; Dennis Wong (Discret. Math., 2018)

Constructing de Bruijn sequences with co-lexicographic order: The k-ary Grandmama sequence. - Patrick Baxter Dragon; Oscar I. Hernandez; Joe Sawada; Aaron Williams 001; Dennis Wong (Eur. J. Comb., 2018)

Combinatorial generation via permutation languages. I. Fundamentals. - Elizabeth J. Hartung; Hung Phuc Hoang; Torsten Mütze; Aaron Williams 001 (CoRR, 2019)

Combinatorial generation via permutation languages. - Elizabeth J. Hartung; Hung Phuc Hoang; Torsten Mütze; Aaron Williams 001 (SODA, 2020)

Solving the Sigma-Tau Problem. - Joe Sawada; Aaron Williams 001 (ACM Trans. Algorithms, 2020)

A Successor Rule Framework for Constructing k-Ary de Bruijn Sequences and Universal Cycles. - Daniel Gabric; Joe Sawada; Aaron Williams 001; Dennis Wong (IEEE Trans. Inf. Theory, 2020)

Block Dude Puzzles are NP-Hard (and the Rugs Really Tie the Reductions Together). - Austin Barr; Calvin Chung; Aaron Williams 001 (CCCG, 2021)

Turning Around and Around: Motion Planning through Thick and Thin Turnstiles. - Aster Greenblatt; Oscar I. Hernandez; Robert A. Hearn; Yichao Hou; Hiro Ito; Minwoo Kang; Aaron Williams 001; Andrew Winslow (CCCG, 2021)

Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order. - Joe Sawada; Aaron Williams 001; Dennis Wong (WORDS, 2021)

A Hamilton Cycle in the k-Sided Pancake Network. - Ben Cameron; Joe Sawada; Aaron Williams 001 (IWOCA, 2021)

A Universal Cycle for Strings with Fixed-Content (Which Are Also Known as Multiset Permutations). - Joe Sawada; Aaron Williams 001 (WADS, 2021)

Unstacking Slabs Safely in Megalit is NP-Hard. - Kirby Gordon; Jacob Lezberg; Aaron Williams 001 (CCCG, 2022)

Entropy Lost: Nintendo's Not-So-Random Sequence of 32, 767 Bits. - Trang Ngo; Aaron Williams 001 (FDG, 2022)

Rolling Polyhedra on Tessellations. - Akira Baes; Erik D. Demaine; Martin L. Demaine; Elizabeth J. Hartung; Stefan Langerman; Joseph O'Rourke; Ryuhei Uehara; Yushi Uno; Aaron Williams 001 (FUN, 2022)

All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges. - Arturo Merino; Torsten Mütze; Aaron Williams 001 (FUN, 2022)

Pop & Push: Ordered Tree Iteration in 𝒪(1)-Time. - Paul W. Lapey; Aaron Williams 001 (ISAAC, 2022)

A Shift Gray Code for Fixed-Content Łukasiewicz Words. - Paul W. Lapey; Aaron Williams 001 (IWOCA, 2022)

Flip-swap languages in binary reflected Gray code order. - Joe Sawada; Aaron Williams 001; Dennis Wong (Theor. Comput. Sci., 2022)

Catalan Squares and Staircases: Relayering and Repositioning Gray Codes. - Emily Downing; Stephanie Einstein; Elizabeth J. Hartung; Aaron Williams 001 (CCCG, 2023)

Cordial Forests. - Feston Kastrati; Wendy J. Myrvold; Lucas D. Panjer; Aaron Williams 001 (FCT, 2023)

Constant Time and Space Updates for the Sigma-Tau Problem. - Zsuzsanna Lipták; Francesco Masillo; Gonzalo Navarro 001; Aaron Williams 001 (SPIRE, 2023)

Demystifying our Grandparent's De Bruijn Sequences with Concatenation Trees. - Joe Sawada; Jackson Sears; Andrew Trautrim; Aaron Williams 001 (CoRR, 2023)

Pattern Avoidance for Fibonacci Sequences using k-Regular Words. - Emily Downing; Elizabeth J. Hartung; Aaron Williams 001 (CoRR, 2023)

Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality. - Ben Cameron; Joe Sawada; Wei Therese; Aaron Williams 001 (Algorithmica, 2023)

Constructing the first (and coolest) fixed-content universal cycle. - Joe Sawada; Aaron Williams 001 (Algorithmica, 2023)

Generating Signed Permutations by Twisting Two-Sided Ribbons. - Yuan Qiu 013; Aaron Williams 001 (LATIN (1), 2024)

On the Hardness of Gray Code Problems for Combinatorial Objects. - Arturo Merino; Namrata; Aaron Williams 001 (WALCOM, 2024)

Maximize the Rightmost Digit:Gray Codes for Restricted Growth Strings. - Yuan Qiu 013; Joe Sawada; Aaron Williams 001 (WALCOM, 2025)