Aaron Williams

77 papers A* 3B 9C 7Misc 8Journal 37Unranked 13
YearRankTypeTitle / Venue / Authors
2025 B conf
Maximize the Rightmost Digit:Gray Codes for Restricted Growth Strings.
WALCOM
Yuan Qiu, Joe Sawada, Aaron Williams
2025 — conf
Reverse Rush Hour is NP-Complete.
CCCG
Jonathan Gabor, Aaron Williams
2025 B conf
Skipping Ropes: An Efficient Gray Code Algorithm for Generating Wiggly Permutations.
WADS
Vincent Pilaud, Aaron Williams
2024 — conf
Generating Signed Permutations by Twisting Two-Sided Ribbons.
LATIN (1)
Yuan Qiu, Aaron Williams
2024 B conf
On the Hardness of Gray Code Problems for Combinatorial Objects.
WALCOM
Arturo Merino, Namrata, Aaron Williams
2024 J jnl
On the Hardness of Gray Code Problems for Combinatorial Objects.
CoRR
Arturo Merino, Namrata, Aaron Williams
2023 — conf
Catalan Squares and Staircases: Relayering and Repositioning Gray Codes.
CCCG
Emily Downing, Stephanie Einstein, Elizabeth J. Hartung, Aaron Williams
2023 C conf
Constant Time and Space Updates for the Sigma-Tau Problem.
SPIRE
Zsuzsanna Lipták, Francesco Masillo, Gonzalo Navarro, Aaron Williams
2023 J jnl
Constructing the first (and coolest) fixed-content universal cycle.
Algorithmica
Joe Sawada, Aaron Williams
2023 B conf
Cordial Forests.
FCT
Feston Kastrati, Wendy J. Myrvold, Lucas D. Panjer, Aaron Williams
2023 J jnl
Demystifying our Grandparent's De Bruijn Sequences with Concatenation Trees.
CoRR
Joe Sawada, Jackson Sears, Andrew Trautrim, Aaron Williams
2023 J jnl
Generating Signed Permutations by Twisting Two-Sided Ribbons.
CoRR
Yuan Qiu, Aaron Williams
2023 J jnl
Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality.
Algorithmica
Ben Cameron, Joe Sawada, Wei Therese, Aaron Williams
2023 J jnl
Pattern Avoidance for Fibonacci Sequences using k-Regular Words.
CoRR
Emily Downing, Elizabeth J. Hartung, Aaron Williams
2022 C conf
A Shift Gray Code for Fixed-Content Łukasiewicz Words.
IWOCA
Paul W. Lapey, Aaron Williams
2022 Misc conf
All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges.
FUN
Arturo Merino, Torsten Mütze, Aaron Williams
2022 C conf
Entropy Lost: Nintendo's Not-So-Random Sequence of 32, 767 Bits.
FDG
Trang Ngo, Aaron Williams
2022 J jnl
Flip-swap languages in binary reflected Gray code order.
Theor. Comput. Sci.
Joe Sawada, Aaron Williams, Dennis Wong
2022 B conf
Pop & Push: Ordered Tree Iteration in 𝒪(1)-Time.
ISAAC
Paul W. Lapey, Aaron Williams
2022 Misc conf
Rolling Polyhedra on Tessellations.
FUN
Akira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth J. Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, Aaron Williams
2022 — conf
Unstacking Slabs Safely in Megalit is NP-Hard.
CCCG
Kirby Gordon, Jacob Lezberg, Aaron Williams
2021 C conf
A Hamilton Cycle in the k-Sided Pancake Network.
IWOCA
Ben Cameron, Joe Sawada, Aaron Williams
2021 J jnl
A Hamilton Cycle in the k-Sided Pancake Network.
CoRR
Ben Cameron, Joe Sawada, Aaron Williams
2021 B conf
A Universal Cycle for Strings with Fixed-Content (Which Are Also Known as Multiset Permutations).
WADS
Joe Sawada, Aaron Williams
2021 — conf
Block Dude Puzzles are NP-Hard (and the Rugs Really Tie the Reductions Together).
CCCG
Austin Barr, Calvin Chung, Aaron Williams
2021 — conf
Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order.
WORDS
Joe Sawada, Aaron Williams, Dennis Wong
2021 J jnl
Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order.
CoRR
Joe Sawada, Aaron Williams, Dennis Wong
2021 — conf
Turning Around and Around: Motion Planning through Thick and Thin Turnstiles.
CCCG
Aster Greenblatt, Oscar I. Hernandez, Robert A. Hearn, Yichao Hou, Hiro Ito, Minwoo Kang, Aaron Williams, Andrew Winslow
2020 J jnl
A Successor Rule Framework for Constructing k-Ary de Bruijn Sequences and Universal Cycles.
IEEE Trans. Inf. Theory
Daniel Gabric, Joe Sawada, Aaron Williams, Dennis Wong
2020 A* conf
Combinatorial generation via permutation languages.
SODA
Elizabeth J. Hartung, Hung Phuc Hoang, Torsten Mütze, Aaron Williams
2020 J jnl
Solving the Sigma-Tau Problem.
ACM Trans. Algorithms
Joe Sawada, Aaron Williams
2019 J jnl
Combinatorial generation via permutation languages. I. Fundamentals.
CoRR
Elizabeth J. Hartung, Hung Phuc Hoang, Torsten Mütze, Aaron Williams
2018 A* conf
A Hamilton Path for the Sigma-Tau Problem.
SODA
Joe Sawada, Aaron Williams
2018 — conf
A Paper on Pencils: A Pencil and Paper Puzzle - Pencils is NP-Complete.
CCCG
Daniel Packer, Sophia White, Aaron Williams
2018 J jnl
A framework for constructing de Bruijn sequences via simple successor rules.
Discret. Math.
Daniel Gabric, Joe Sawada, Aaron Williams, Dennis Wong
2018 J jnl
Constructing de Bruijn sequences with co-lexicographic order: The k-ary Grandmama sequence.
Eur. J. Comb.
Patrick Baxter Dragon, Oscar I. Hernandez, Joe Sawada, Aaron Williams, Dennis Wong
2018 — conf
Sto-Stone is NP-Complete.
CCCG
Addison Allen, Aaron Williams
2018 — conf
Switches are PSPACE-Complete.
CCCG
Jonathan Gabor, Aaron Williams
2017 J jnl
A simple shift rule for k-ary de Bruijn sequences.
Discret. Math.
Joe Sawada, Aaron Williams, Dennis Wong
2017 J jnl
Necklaces and Lyndon words in colexicographic and binary reflected Gray code order.
J. Discrete Algorithms
Joe Sawada, Aaron Williams, Dennis Wong
2017 J jnl
Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences.
J. Discrete Algorithms
Joe Sawada, Aaron Williams
2016 J jnl
A surprisingly simple de Bruijn sequence construction.
Discret. Math.
Joe Sawada, Aaron Williams, Dennis Wong
2016 J jnl
Generalizing the Classic Greedy and Necklace Constructions of de Bruijn Sequences and Universal Cycles.
Electron. J. Comb.
Joe Sawada, Aaron Williams, Dennis Wong
2016 J jnl
Greedy flipping of pancakes and burnt pancakes.
Discret. Appl. Math.
Joe Sawada, Aaron Williams
2016 J jnl
Single-Player and Two-Player Buttons & Scissors Games.
CoRR
Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams
2016 J jnl
Successor rules for flipping pancakes and burnt pancakes.
Theor. Comput. Sci.
Joe Sawada, Aaron Williams
2016 Misc conf
Super Mario Bros. is Harder/Easier Than We Thought.
FUN
Erik D. Demaine, Giovanni Viglietta, Aaron Williams
2016 B conf
The Grandmama de Bruijn Sequence for Binary Strings.
LATIN
Patrick Baxter Dragon, Oscar I. Hernandez, Aaron Williams
2015 — conf
Buttons & Scissors is NP-Complete.
CCCG
Harrison Gregg, Jody Leonard, Aaron Santiago, Aaron Williams
2015 — conf
Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract).
JCDCGG
Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams
2014 J jnl
The Coolest Way to Generate Binary Strings.
Theory Comput. Syst.
Brett Stevens, Aaron Williams
2014 J jnl
The lexicographically smallest universal cycle for binary strings with minimum specified weight.
J. Discrete Algorithms
Joe Sawada, Aaron Williams, Dennis Wong
2013 J jnl
A 'Hot Potato' Gray Code for Permutations.
Electron. Notes Discret. Math.
Xi Sisi Shen, Aaron Williams
2013 J jnl
A Gray code for fixed-density necklaces and Lyndon words in constant amortized time.
Theor. Comput. Sci.
Joe Sawada, Aaron Williams
2013 J jnl
Greedy Pancake Flipping.
Electron. Notes Discret. Math.
Aaron Williams, Joe Sawada
2013 C conf
Universal Cycles for Weight-Range Binary Strings.
IWOCA
Joe Sawada, Aaron Williams, Dennis Chi-Him Wong
2012 J jnl
Binary bubble languages and cool-lex order.
J. Comb. Theory A
Frank Ruskey, Joe Sawada, Aaron Williams
2012 J jnl
Cool-lex order and k-ary Catalan structures.
J. Discrete Algorithms
Stephane Durocher, Pak Ching Li, Debajyoti Mondal, Frank Ruskey, Aaron Williams
2012 J jnl
De Bruijn Sequences for Fixed-Weight Binary Strings.
SIAM J. Discret. Math.
Frank Ruskey, Joe Sawada, Aaron Williams
2012 J jnl
Efficient Oracles for Generating Binary Bubble Languages.
Electron. J. Comb.
Joe Sawada, Aaron Williams
2012 J jnl
Hamilton Cycles in Restricted and Incomplete Rotator Graphs.
J. Graph Algorithms Appl.
Brett Stevens, Aaron Williams
2012 J jnl
Shorthand Universal Cycles for Permutations.
Algorithmica
Alexander E. Holroyd, Frank Ruskey, Aaron Williams
2012 Misc conf
The Coolest Order of Binary Strings.
FUN
Brett Stevens, Aaron Williams
2012 J jnl
The Feline Josephus Problem.
Theory Comput. Syst.
Frank Ruskey, Aaron Williams
2011 B conf
De Bruijn Sequences for the Binary Strings with Maximum Density.
WALCOM
Joe Sawada, Brett Stevens, Aaron Williams
2011 C conf
Hamilton Cycles in Restricted Rotator Graphs.
IWOCA
Brett Stevens, Aaron Williams
2011 C conf
Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order.
IWOCA
Stephane Durocher, Pak Ching Li, Debajyoti Mondal, Aaron Williams
2010 J jnl
An explicit universal cycle for the (
ACM Trans. Algorithms
Frank Ruskey, Aaron Williams
2010 Misc conf
Faster Generation of Shorthand Universal Cycles for Permutations.
COCOON
Alexander E. Holroyd, Frank Ruskey, Aaron Williams
2010 Misc conf
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List.
FUN
Aaron Williams
2010 Misc conf
The Feline Josephus Problem.
FUN
Frank Ruskey, Aaron Williams
2009 A* conf
Loopless generation of multiset permutations using a constant number of variables by prefix shifts.
SODA
Aaron Williams
2009 J jnl
The coolest way to generate combinations.
Discret. Math.
Frank Ruskey, Aaron Williams
2008 — conf
Generating Balanced Parentheses and Binary Trees by Prefix Shifts.
CATS
Frank Ruskey, Aaron Williams
2007 J jnl
An explicit universal cycle for the (n-1)-permutations of an n-set
CoRR
Frank Ruskey, Aaron Williams
2006 B conf
Packing Dicycle Covers in Planar Graphs with No
LATIN
Orlando Lee, Aaron Williams
2005 Misc conf
Generating Combinations by Prefix Shifts.
COCOON
Frank Ruskey, Aaron Williams