| 2026 | FUN | The Quaternary Gray Code and Ziggu Puzzles. | Madeleine Goertz, Aaron Williams |
| 2026 | FUN | Pyramid Schemes for Eating M&Ms: Enumeration, Generation, and Gray Codes. | Elizabeth J. Hartung, Brett Stevens, Aaron Williams |
| 2026 | IWOCA | One Sequence to Rule Them All: 풪(1)-Time Parallel Generation of Mixed-Radix Gray Codes. | Lucia Moura, Prangya Parida, Brett Stevens, Aaron Williams |
| 2025 | WADS | Skipping Ropes: An Efficient Gray Code Algorithm for Generating Wiggly Permutations. | Vincent Pilaud, Aaron Williams |
| 2025 | WALCOM | Maximize the Rightmost Digit:Gray Codes for Restricted Growth Strings. | Yuan Qiu, Joe Sawada, Aaron Williams |
| 2024 | LATIN | Generating Signed Permutations by Twisting Two-Sided Ribbons. | Yuan Qiu, Aaron Williams |
| 2024 | WALCOM | On the Hardness of Gray Code Problems for Combinatorial Objects. | Arturo Merino, Namrata, Aaron Williams |
| 2023 | FCT | Cordial Forests. | Feston Kastrati, Wendy J. Myrvold, Lucas D. Panjer, Aaron Williams |
| 2023 | SPIRE | Constant Time and Space Updates for the Sigma-Tau Problem. | Zsuzsanna Liptk, Francesco Masillo, Gonzalo Navarro, Aaron Williams |
| 2022 | FDG | Entropy Lost: Nintendo's Not-So-Random Sequence of 32, 767 Bits. | Trang Ngo, Aaron Williams |
| 2022 | FUN | 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 |
| 2022 | FUN | All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges. | Arturo Merino, Torsten Mtze, Aaron Williams |
| 2022 | ISAAC | Pop & Push: Ordered Tree Iteration in 𝒪(1)-Time. | Paul W. Lapey, Aaron Williams |
| 2022 | IWOCA | A Shift Gray Code for Fixed-Content Łukasiewicz Words. | Paul W. Lapey, Aaron Williams |
| 2021 | IWOCA | A Hamilton Cycle in the k-Sided Pancake Network. | Ben Cameron, Joe Sawada, Aaron Williams |
| 2021 | WADS | A Universal Cycle for Strings with Fixed-Content (Which Are Also Known as Multiset Permutations). | Joe Sawada, Aaron Williams |
| 2020 | SODA | Combinatorial generation via permutation languages. | Elizabeth J. Hartung, Hung Phuc Hoang, Torsten Mtze, Aaron Williams |
| 2018 | SODA | A Hamilton Path for the Sigma-Tau Problem. | Joe Sawada, Aaron Williams |
| 2016 | FUN | Super Mario Bros. is Harder/Easier Than We Thought. | Erik D. Demaine, Giovanni Viglietta, Aaron Williams |
| 2016 | LATIN | The Grandmama de Bruijn Sequence for Binary Strings. | Patrick Baxter Dragon, Oscar I. Hernandez, Aaron Williams |
| 2013 | IWOCA | Universal Cycles for Weight-Range Binary Strings. | Joe Sawada, Aaron Williams, Dennis Chi-Him Wong |
| 2013 | WADS | The Greedy Gray Code Algorithm. | Aaron Williams |
| 2012 | FUN | The Coolest Order of Binary Strings. | Brett Stevens, Aaron Williams |
| 2011 | IWOCA | Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order. | Stephane Durocher, Pak Ching Li, Debajyoti Mondal, Aaron Williams |
| 2011 | IWOCA | Hamilton Cycles in Restricted Rotator Graphs. | Brett Stevens, Aaron Williams |
| 2011 | WALCOM | De Bruijn Sequences for the Binary Strings with Maximum Density. | Joe Sawada, Brett Stevens, Aaron Williams |
| 2010 | COCOON | Faster Generation of Shorthand Universal Cycles for Permutations. | Alexander E. Holroyd, Frank Ruskey, Aaron Williams |
| 2010 | FUN | The Feline Josephus Problem. | Frank Ruskey, Aaron Williams |
| 2010 | FUN | O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List. | Aaron Williams |
| 2009 | SODA | Loopless generation of multiset permutations using a constant number of variables by prefix shifts. | Aaron Williams |
| 2006 | LATIN | Packing Dicycle Covers in Planar Graphs with No | Orlando Lee, Aaron Williams |
| 2005 | COCOON | Generating Combinations by Prefix Shifts. | Frank Ruskey, Aaron Williams |