Aaron Williams

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 46

Top Topics

Polynomially Solvable

Computationally Challenging

Motion Planning

Top Venues

J. Discrete Algorithms

Publications

Arturo I. Merino, Namrata, Aaron Williams
On the Hardness of Gray Code Problems for Combinatorial Objects. CoRR (2024)
Yuan Qiu, Aaron Williams
Generating Signed Permutations by Twisting Two-Sided Ribbons. CoRR (2023)
Ben Cameron, Joe Sawada, Wei Therese, Aaron Williams
Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality. Algorithmica 85 (3) (2023)
Joe Sawada, Aaron Williams
Constructing the first (and coolest) fixed-content universal cycle. Algorithmica 85 (6) (2023)
Feston Kastrati, Wendy J. Myrvold, Lucas D. Panjer, Aaron Williams
Cordial Forests. FCT (2023)
Emily Downing, Elizabeth Hartung, Aaron Williams
Pattern Avoidance for Fibonacci Sequences using k-Regular Words. CoRR (2023)
Zsuzsanna Lipták, Francesco Masillo, Gonzalo Navarro, Aaron Williams
Constant Time and Space Updates for the Sigma-Tau Problem. SPIRE (2023)
Kirby Gordon, Jacob Lezberg, Aaron Williams
Unstacking Slabs Safely in Megalit is NP-Hard. CCCG (2022)
Joe Sawada, Aaron Williams, Dennis Wong
Flip-swap languages in binary reflected Gray code order. Theor. Comput. Sci. 933 (2022)
Arturo I. Merino, Torsten Mütze, Aaron Williams
All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges. FUN (2022)
Trang Ngo, Aaron Williams
Entropy Lost: Nintendo's Not-So-Random Sequence of 32, 767 Bits. FDG (2022)
Akira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, Aaron Williams
Rolling Polyhedra on Tessellations. FUN (2022)
Paul W. Lapey, Aaron Williams
Pop & Push: Ordered Tree Iteration in 𝒪(1)-Time. ISAAC (2022)
Paul W. Lapey, Aaron Williams
A Shift Gray Code for Fixed-Content Łukasiewicz Words. IWOCA (2022)
Joe Sawada, Aaron Williams, Dennis Wong
Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order. WORDS (2021)
Austin Barr, Calvin Chung, Aaron Williams
Block Dude Puzzles are NP-Hard (and the Rugs Really Tie the Reductions Together). CCCG (2021)
Aster Greenblatt, Oscar Hernandez, Robert A. Hearn, Yichao Hou, Hiro Ito, Minwoo Kang, Aaron Williams, Andrew Winslow
Turning Around and Around: Motion Planning through Thick and Thin Turnstiles. CCCG (2021)
Abhijeet Krishnan, Aaron Williams, Chris Martens
Towards Action Model Learning for Player Modeling. CoRR (2021)
Joe Sawada, Aaron Williams, Dennis Wong
Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order. CoRR (2021)
Ben Cameron, Joe Sawada, Aaron Williams
A Hamilton Cycle in the k-Sided Pancake Network. IWOCA (2021)
Ben Cameron, Joe Sawada, Aaron Williams
A Hamilton Cycle in the k-Sided Pancake Network. CoRR (2021)
Joe Sawada, Aaron Williams
Solving the Sigma-Tau Problem. ACM Trans. Algorithms 16 (1) (2020)
Steven Rich, Andrew Tran, Aaron Williams, Jason Holt, Jeffery Sauer, Taylor Oshan
arcos and arcospy: R and Python packages for accessing the DEA ARCOS database from 2006 - 2014. J. Open Source Softw. 5 (53) (2020)
Elizabeth Hartung, Hung Phuc Hoang, Torsten Mütze, Aaron Williams
Combinatorial generation via permutation languages. SODA (2020)
Abhijeet Krishnan, Aaron Williams, Chris Martens
Towards Action Model Learning for Player Modeling. AIIDE (2020)
Daniel Gabric, Joe Sawada, Aaron Williams, Dennis Wong
A Successor Rule Framework for Constructing k-Ary de Bruijn Sequences and Universal Cycles. IEEE Trans. Inf. Theory 66 (1) (2020)
Elizabeth Hartung, Hung Phuc Hoang, Torsten Mütze, Aaron Williams
Combinatorial generation via permutation languages. I. Fundamentals. CoRR (2019)
Jonathan Gabor, Aaron Williams
Switches are PSPACE-Complete. CCCG (2018)
Joe Sawada, Aaron Williams
A Hamilton Path for the Sigma-Tau Problem. SODA (2018)
Patrick Baxter Dragon, Oscar I. Hernandez, Joe Sawada, Aaron Williams, Dennis Wong
Constructing de Bruijn sequences with co-lexicographic order: The k-ary Grandmama sequence. Eur. J. Comb. 72 (2018)
Daniel Packer, Sophia White, Aaron Williams
A Paper on Pencils: A Pencil and Paper Puzzle - Pencils is NP-Complete. CCCG (2018)
Chris Martens, Aaron Williams, Ryan S. Alexander, Chinmaya Dabral
Generating Puzzle Progressions to Study Mental Model Matching. AIIDE Workshops (2018)
Daniel Gabric, Joe Sawada, Aaron Williams, Dennis Wong
A framework for constructing de Bruijn sequences via simple successor rules. Discret. Math. 341 (11) (2018)
Addison Allen, Aaron Williams
Sto-Stone is NP-Complete. CCCG (2018)
Joe Sawada, Aaron Williams, Dennis Wong
Necklaces and Lyndon words in colexicographic and binary reflected Gray code order. J. Discrete Algorithms (2017)
Joe Sawada, Aaron Williams
Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences. J. Discrete Algorithms 43 (2017)
Joe Sawada, Aaron Williams, Dennis Wong
A simple shift rule for k-ary de Bruijn sequences. Discret. Math. 340 (3) (2017)
Joe Sawada, Aaron Williams
Greedy flipping of pancakes and burnt pancakes. Discret. Appl. Math. 210 (2016)
Joe Sawada, Aaron Williams, Dennis Wong
A surprisingly simple de Bruijn sequence construction. Discret. Math. 339 (1) (2016)
Patrick Baxter Dragon, Oscar I. Hernandez, Aaron Williams
The Grandmama de Bruijn Sequence for Binary Strings. LATIN (2016)
Joe Sawada, Aaron Williams, Dennis Wong
Generalizing the Classic Greedy and Necklace Constructions of de Bruijn Sequences and Universal Cycles. Electron. J. Comb. 23 (1) (2016)
Joe Sawada, Aaron Williams
Successor rules for flipping pancakes and burnt pancakes. Theor. Comput. Sci. 609 (2016)
Erik D. Demaine, Giovanni Viglietta, Aaron Williams
Super Mario Bros. is Harder/Easier Than We Thought. FUN (2016)
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
Single-Player and Two-Player Buttons & Scissors Games. CoRR (2016)
Harrison Gregg, Jody Leonard, Aaron Santiago, Aaron Williams
Buttons & Scissors is NP-Complete. CCCG (2015)
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
Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). JCDCGG (2015)
Brett Stevens, Aaron Williams
The Coolest Way to Generate Binary Strings. Theory Comput. Syst. 54 (4) (2014)
Joe Sawada, Aaron Williams, Dennis Wong
The lexicographically smallest universal cycle for binary strings with minimum specified weight. J. Discrete Algorithms 28 (2014)
Aaron Williams
The Greedy Gray Code Algorithm. WADS (2013)
Joe Sawada, Aaron Williams
A Gray code for fixed-density necklaces and Lyndon words in constant amortized time. Theor. Comput. Sci. 502 (2013)
Xi Sisi Shen, Aaron Williams
A 'Hot Potato' Gray Code for Permutations. Electron. Notes Discret. Math. 44 (2013)
Aaron Williams, Joe Sawada
Greedy Pancake Flipping. Electron. Notes Discret. Math. 44 (2013)
Joe Sawada, Aaron Williams, Dennis Chi-Him Wong
Universal Cycles for Weight-Range Binary Strings. IWOCA (2013)
Frank Ruskey, Joe Sawada, Aaron Williams
De Bruijn Sequences for Fixed-Weight Binary Strings. SIAM J. Discret. Math. 26 (2) (2012)
Stephane Durocher, Pak Ching Li, Debajyoti Mondal, Frank Ruskey, Aaron Williams
Cool-lex order and k-ary Catalan structures. J. Discrete Algorithms 16 (2012)
Alexander E. Holroyd, Frank Ruskey, Aaron Williams
Shorthand Universal Cycles for Permutations. Algorithmica 64 (2) (2012)
Joe Sawada, Aaron Williams
Efficient Oracles for Generating Binary Bubble Languages. Electron. J. Comb. 19 (1) (2012)
Frank Ruskey, Joe Sawada, Aaron Williams
Binary bubble languages and cool-lex order. J. Comb. Theory, Ser. A 119 (1) (2012)
Brett Stevens, Aaron Williams
Hamilton Cycles in Restricted and Incomplete Rotator Graphs. J. Graph Algorithms Appl. 16 (4) (2012)
Brett Stevens, Aaron Williams
The Coolest Order of Binary Strings. FUN (2012)
Frank Ruskey, Aaron Williams
The Feline Josephus Problem. Theory Comput. Syst. 50 (1) (2012)
Joe Sawada, Brett Stevens, Aaron Williams
De Bruijn Sequences for the Binary Strings with Maximum Density. WALCOM (2011)
Stephane Durocher, Pak Ching Li, Debajyoti Mondal, Aaron Williams
Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order. IWOCA (2011)
Brett Stevens, Aaron Williams
Hamilton Cycles in Restricted Rotator Graphs. IWOCA (2011)
Aaron Williams
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List. FUN (2010)
Frank Ruskey, Aaron Williams
-set. ACM Trans. Algorithms 6 (3) (2010)
Alexander E. Holroyd, Frank Ruskey, Aaron Williams
Faster Generation of Shorthand Universal Cycles for Permutations. COCOON (2010)
Frank Ruskey, Aaron Williams
The Feline Josephus Problem. FUN (2010)
Frank Ruskey, Aaron Williams
The coolest way to generate combinations. Discret. Math. 309 (17) (2009)
Aaron Williams
Loopless generation of multiset permutations using a constant number of variables by prefix shifts. SODA (2009)
Frank Ruskey, Aaron Williams
Generating Balanced Parentheses and Binary Trees by Prefix Shifts. CATS (2008)
Frank Ruskey, Aaron Williams
An explicit universal cycle for the (n-1)-permutations of an n-set CoRR (2007)
Orlando Lee, Aaron Williams
Minor. LATIN (2006)
Frank Ruskey, Aaron Williams
Generating Combinations by Prefix Shifts. COCOON (2005)