An Efficient Algorithm for Generating Necklaces with Fixed Density. - Frank Ruskey; Joe Sawada (SIAM J. Comput., 1999)

Generating Necklaces and Strings with Forbidden Substrings. - Frank Ruskey; Joe Sawada (COCOON, 2000)

A fast algorithm to generate unlabeled necklaces. - Frank Ruskey; Joe Sawada (SODA, 2000)

Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2). - Kevin Cattell; Frank Ruskey; Joe Sawada; Micaela Serra; C. Robert Miers (J. Algorithms, 2000)

Fast algorithms to generate restricted classes of strings under rotation. - Joe Sawada (2000)

Generating Bracelets in Constant Amortized Time. - Joe Sawada (SIAM J. Comput., 2001)

The Number of Irreducible Polynomials and Lyndon Words with Given Trace. - Frank Ruskey; C. Robert Miers; Joe Sawada (SIAM J. Discret. Math., 2001)

A Fast Algorithm for Generating Nonisomorphic Chord Diagrams. - Joe Sawada (SIAM J. Discret. Math., 2002)

Bent Hamilton Cycles in d-Dimensional Grid Graphs. - Frank Ruskey; Joe Sawada (Electron. J. Comb., 2003)

From a simple elimination ordering to a strong elimination ordering in linear time. - Joe Sawada; Jeremy P. Spinrad (Inf. Process. Lett., 2003)

Generating Lyndon brackets.: An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2). - Joe Sawada; Frank Ruskey (J. Algorithms, 2003)

Generating and characterizing the perfect elimination orderings of a chordal graph. - L. Sunil Chandran; Louis Ibarra; Frank Ruskey; Joe Sawada (Theor. Comput. Sci., 2003)

Euclidean strings. - John A. Ellis; Frank Ruskey; Joe Sawada; Jamie Simpson (Theor. Comput. Sci., 2003)

A fast algorithm to generate necklaces with fixed content. - Joe Sawada (Theor. Comput. Sci., 2003)

A Loopless Gray Code for Minimal Signed-Binary Representations. - Gurmeet Singh Manku; Joe Sawada (ESA, 2005)

A Gray code for binary subtraction. - Joe Sawada (Electron. Notes Discret. Math., 2005)

Oracles for vertex elimination orderings. - Joe Sawada (Theor. Comput. Sci., 2005)

k-Colorability of P5-free graphs - Chính T. Hoàng; Joe Sawada; Xiao Shu (CoRR, 2006)

Generating rooted and free plane trees. - Joe Sawada (ACM Trans. Algorithms, 2006)

Deciding k-colourability of P_5-free graphs in polynomial time - Chính T. Hoàng; Marcin Kaminski 001; Vadim V. Lozin; Joe Sawada; Xiao Shu (CoRR, 2007)

A fast algorithm to generate Beckett-Gray codes: Extended Abstract. - Joe Sawada; Dennis Chi-Him Wong (Electron. Notes Discret. Math., 2007)

A Simple Gray Code to List All Minimal Signed Binary Representations. - Joe Sawada (SIAM J. Discret. Math., 2007)

Magic Labelings on Cycles and Wheels. - Andrew Baker; Joe Sawada (COCOA, 2008)

A Note on k-Colorability of P5-Free Graphs. - Chính T. Hoàng; Marcin Kaminski 001; Vadim V. Lozin; Joe Sawada; Xiao Shu (MFCS, 2008)

A Certifying Algorithm for 3-Colorability of P5-Free Graphs. - Daniel Bruce; Chính T. Hoàng; Joe Sawada (ISAAC, 2009)

A certifying algorithm for 3-colorability of P5-free graphs - Daniel Bruce; Chính T. Hoàng; Joe Sawada (CoRR, 2009)

Gray codes for reflectable languages. - Yue Li; Joe Sawada (Inf. Process. Lett., 2009)

Deciding k-Colorability of P5-Free Graphs in Polynomial Time. - Chính T. Hoàng; Marcin Kaminski 001; Vadim V. Lozin; Joe Sawada; Xiao Shu (Algorithmica, 2010)

A fast algorithm to generate open meandric systems and meanders. - Bruce A. Bobier; Joe Sawada (ACM Trans. Algorithms, 2010)

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

Stamp Foldings, Semi-Meanders, and Open Meanders: Fast Generation Algorithms. - Joe Sawada; Roy Li (Electron. J. Comb., 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)

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)

Finding and listing induced paths and cycles. - Chính T. Hoàng; Marcin Kaminski 001; Joe Sawada; R. Sritharan (Discret. Appl. Math., 2013)

On k-critical P5-free graphs. - Chính T. Hoàng; Brian Moore; Daniel Recoskie; Joe Sawada (Electron. Notes Discret. Math., 2013)

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

Generating bracelets with fixed content. - Saira Karim; Joe Sawada; Zareen Alamgir; Syed Husnine (Theor. Comput. Sci., 2013)

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

On Combinatorial Generation of Prefix Normal Words. - Peter Burcsi; Gabriele Fici; Zsuzsanna Lipták; Frank Ruskey; Joe Sawada (CPM, 2014)

Normal, Abby Normal, Prefix Normal. - Peter Burcsi; Gabriele Fici; Zsuzsanna Lipták; Frank Ruskey; Joe Sawada (FUN, 2014)

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

Charm bracelets and their application to the construction of periodic Golay pairs. - Dragomir Z. Dokovic; Ilias S. Kotsireas; Daniel Recoskie; Joe Sawada (Discret. Appl. Math., 2015)

Constructions of k-critical P5-free graphs. - Chính T. Hoàng; Brian Moore; Daniel Recoskie; Joe Sawada; Martin Vatshelle (Discret. Appl. Math., 2015)

Snakes, coils, and single-track circuit codes with spread k. - Simon Hood; Daniel Recoskie; Joe Sawada; Dennis Wong (J. Comb. Optim., 2015)

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)

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 de Bruijn Sequence Construction by Concatenating Cycles of the Complemented Cycling Register. - Daniel Gabric; Joe Sawada (WORDS, 2017)

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

Finding the largest fixed-density necklace and Lyndon word. - Joe Sawada; Patrick Hartman (Inf. Process. Lett., 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)

On prefix normal words and prefix normal forms. - Peter Burcsi; Gabriele Fici; Zsuzsanna Lipták; Frank Ruskey; Joe Sawada (Theor. Comput. Sci., 2017)

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)

Constructing de Bruijn sequences by concatenating smaller universal cycles. - Daniel Gabric; Joe Sawada (Theor. Comput. Sci., 2018)

Ranking and unranking fixed-density necklaces and Lyndon words. - Patrick Hartman; Joe Sawada (Theor. Comput. Sci., 2019)

A Pascal-like bound for the number of necklaces with fixed density. - István Heckenberger; Joe Sawada (Theor. Comput. Sci., 2019)

Efficient universal cycle constructions for weak orders. - Joe Sawada; Dennis Wong (Discret. Math., 2020)

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

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. - Péter Burcsi; Gabriele Fici; Zsuzsanna Lipták; Rajeev Raman; Joe Sawada (Theor. Comput. Sci., 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)

A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph. - Ben Cameron; Aaron Grubb; Joe Sawada (COCOON, 2021)

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

DAC Bandwidth Tripler with 3: 1 Image-Rejection Analog Multiplexer. - Yusuke Yokoi; Yusuke Takai; Joe Sawada; Takumi Kamo; Yohtaro Umeda; Kyoya Takano (ICECS, 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)

Revisiting the Prefer-same and Prefer-opposite de Bruijn sequence constructions. - Abbas Alhakim; Evan Sala; Joe Sawada (Theor. Comput. Sci., 2021)

A 50 Gbps 49 mW CMOS Analog Multiplexer for a DAC Bandwidth Tripler. - Keisuke Kawahara; Joe Sawada; Takumi Kamo; Yohtaro Umeda; Kyoya Takano (RWS, 2022)

Vertex-critical (P3+𝓁P1)-free and vertex-critical (gem, co-gem)-free graphs. - Tala Abuadas; Ben Cameron; Chính T. Hoàng; Joe Sawada (CoRR, 2022)

Dichotomizing k-vertex-critical H-free graphs for H of order four. - Ben Cameron; Chính T. Hoàng; Joe Sawada (Discret. Appl. Math., 2022)

Investigating the discrepancy property of de Bruijn sequences. - Daniel Gabric; Joe Sawada (Discret. Math., 2022)

Gray codes and symmetric chains. - Petr Gregor; Sven Jäger 001; Torsten Mütze; Joe Sawada; Kaja Wille (J. Comb. Theory B, 2022)

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

Demystifying our Grandparent's De Bruijn Sequences with Concatenation Trees. - Joe Sawada; Jackson Sears; Andrew Trautrim; 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)

Efficient Construction of Long Orientable Sequences. - Daniel Gabric; Joe Sawada (CPM, 2024)

Vertex-critical (P3+ℓP1)-free and vertex-critical (gem, co-gem)-free graphs. - Tala Abuadas; Ben Cameron; Chính T. Hoàng; Joe Sawada (Discret. Appl. Math., 2024)

Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan. - Ben Cameron; Aaron Grubb; Joe Sawada (Graphs Comb., 2024)

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

Cut-down de Bruijn sequences. - Ben Cameron; Aysu Gündogan; Joe Sawada (Discret. Math., 2025)

Efficient Constructions of the Prefer-Same and Prefer-Opposite de Bruijn Sequences. - Evan Sala; Joe Sawada; Abbas Alhakim (ACM Trans. Algorithms, 2025)

Constructing k-ary orientable sequences with asymptotically optimal length. - Daniel Gabric; Joe Sawada (Des. Codes Cryptogr., 2025)