Joe Sawada

ORCID

Publication Activity (10 Years)

Years Active: 1999-2025
Publications (10 Years): 52

Top Venues

Publications

Ben Cameron, Aysu Gündogan, Joe Sawada
Cut-down de Bruijn sequences. Discret. Math. 348 (1) (2025)
Tala Abuadas, Ben Cameron, Chính T. Hoàng, Joe Sawada
Vertex-critical (P3+ℓP1)-free and vertex-critical (gem, co-gem)-free graphs. Discret. Appl. Math. 344 (2024)
Ben Cameron, Aaron Grubb, Joe Sawada
Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan. Graphs Comb. 40 (4) (2024)
Daniel Gabric, Joe Sawada
Constructing k-ary Orientable Sequences with Asymptotically Optimal Length. CoRR (2024)
Daniel Gabric, Joe Sawada
Efficient Construction of Long Orientable Sequences. CoRR (2024)
Daniel Gabric, Joe Sawada
Efficient Construction of Long Orientable Sequences. CPM (2024)
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)
Ben Cameron, Aysu Gündogan, Joe Sawada
Cut-Down de Bruijn Sequences. CoRR (2022)
Daniel Gabric, Joe Sawada
Investigating the discrepancy property of de Bruijn sequences. Discret. Math. 345 (4) (2022)
Ben Cameron, Chính T. Hoàng, Joe Sawada
Dichotomizing k-vertex-critical H-free graphs for H of order four. Discret. Appl. Math. 312 (2022)
Ben Cameron, Aaron Grubb, Joe Sawada
Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan. CoRR (2022)
Joe Sawada, Aaron Williams, Dennis Wong
Flip-swap languages in binary reflected Gray code order. Theor. Comput. Sci. 933 (2022)
Tala Abuadas, Ben Cameron, Chính T. Hoàng, Joe Sawada
)-free and vertex-critical (gem, co-gem)-free graphs. CoRR (2022)
Keisuke Kawahara, Joe Sawada, Takumi Kamo, Yohtaro Umeda, Kyoya Takano
A 50 Gbps 49 mW CMOS Analog Multiplexer for a DAC Bandwidth Tripler. RWS (2022)
Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille
Gray codes and symmetric chains. J. Comb. Theory, Ser. B 153 (2022)
Ben Cameron, Aaron Grubb, Joe Sawada
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph. COCOON (2021)
Joe Sawada, Aaron Williams, Dennis Wong
Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order. WORDS (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, Aaron Grubb, Joe Sawada
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph. CoRR (2021)
Ben Cameron, Joe Sawada, Aaron Williams
A Hamilton Cycle in the k-Sided Pancake Network. IWOCA (2021)
Abbas Alhakim, Evan Sala, Joe Sawada
Revisiting the Prefer-same and Prefer-opposite de Bruijn sequence constructions. Theor. Comput. Sci. 852 (2021)
Joe Sawada, A. Williams
A Universal Cycle for Strings with Fixed-Content (Which Are Also Known as Multiset Permutations). WADS (2021)
Yusuke Yokoi, Yusuke Takai, Joe Sawada, Takumi Kamo, Yohtaro Umeda, Kyoya Takano
DAC Bandwidth Tripler with 3: 1 Image-Rejection Analog Multiplexer. ICECS (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)
Evan Sala, Joe Sawada, Abbas Alhakim
Efficient constructions of the Prefer-same and Prefer-opposite de Bruijn sequences. CoRR (2020)
Joe Sawada, Dennis Wong
Efficient universal cycle constructions for weak orders. Discret. Math. 343 (10) (2020)
Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. Theor. Comput. Sci. 842 (2020)
Ben Cameron, Chính T. Hoàng, Joe Sawada
Dichotomizing k-vertex-critical H-free graphs for H of order four. CoRR (2020)
Daniel Gabric, Joe Sawada
Investigating the discrepancy property of de Bruijn sequences. CoRR (2020)
Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. CoRR (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)
István Heckenberger, Joe Sawada
A Pascal-like bound for the number of necklaces with fixed density. Theor. Comput. Sci. 778 (2019)
Patrick Hartman, Joe Sawada
Ranking and unranking fixed-density necklaces and Lyndon words. Theor. Comput. Sci. 791 (2019)
Joe Sawada, Aaron Williams
A Hamilton Path for the Sigma-Tau Problem. SODA (2018)
Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille
Gray Codes and Symmetric Chains. ICALP (2018)
Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille
Gray codes and symmetric chains. CoRR (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 Gabric, Joe Sawada
Constructing de Bruijn sequences by concatenating smaller universal cycles. Theor. Comput. Sci. 743 (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)
Daniel Gabric, Joe Sawada
A de Bruijn Sequence Construction by Concatenating Cycles of the Complemented Cycling Register. WORDS (2017)
Joe Sawada, Aaron Williams, Dennis Wong
Necklaces and Lyndon words in colexicographic and binary reflected Gray code order. J. Discrete Algorithms (2017)
Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
On prefix normal words and prefix normal forms. Theor. Comput. Sci. 659 (2017)
Joe Sawada, Aaron Williams
Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences. J. Discrete Algorithms 43 (2017)
Joe Sawada, Patrick Hartman
Finding the largest fixed-density necklace and Lyndon word. Inf. Process. Lett. 125 (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)
Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
On Prefix Normal Words and Prefix Normal Forms. CoRR (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)
Dragomir Z. Dokovic, Ilias S. Kotsireas, Daniel Recoskie, Joe Sawada
Charm bracelets and their application to the construction of periodic Golay pairs. Discret. Appl. Math. 188 (2015)
Simon Hood, Daniel Recoskie, Joe Sawada, Dennis Wong
Snakes, coils, and single-track circuit codes with spread k. J. Comb. Optim. 30 (1) (2015)
Chính T. Hoàng, Brian Moore, Daniel Recoskie, Joe Sawada, Martin Vatshelle
Constructions of k-critical P5-free graphs. Discret. Appl. Math. 182 (2015)
Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
Normal, Abby Normal, Prefix Normal. FUN (2014)
Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
On Combinatorial Generation of Prefix Normal Words. CPM (2014)
Joe Sawada, Aaron Williams, Dennis Wong
The lexicographically smallest universal cycle for binary strings with minimum specified weight. J. Discrete Algorithms 28 (2014)
Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
Normal, Abby Normal, Prefix Normal. CoRR (2014)
Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
On Combinatorial Generation of Prefix Normal Words. CoRR (2014)
Joe Sawada, Aaron Williams
A Gray code for fixed-density necklaces and Lyndon words in constant amortized time. Theor. Comput. Sci. 502 (2013)
Chính T. Hoàng, Marcin Kaminski, Joe Sawada, R. Sritharan
Finding and listing induced paths and cycles. Discret. Appl. Math. 161 (4-5) (2013)
Chính T. Hoàng, Brian Moore, Daniel Recoskie, Joe Sawada
-free graphs. 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)
Saira Karim, Joe Sawada, Zareen Alamgir, Syed Husnine
Generating bracelets with fixed content. Theor. Comput. Sci. 475 (2013)
Frank Ruskey, Joe Sawada, Aaron Williams
De Bruijn Sequences for Fixed-Weight Binary Strings. SIAM J. Discret. Math. 26 (2) (2012)
Joe Sawada, Roy Li
Stamp Foldings, Semi-Meanders, and Open Meanders: Fast Generation Algorithms. Electron. J. Comb. 19 (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)
Joe Sawada, Brett Stevens, Aaron Williams
De Bruijn Sequences for the Binary Strings with Maximum Density. WALCOM (2011)
Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu
-Free Graphs in Polynomial Time. Algorithmica 57 (1) (2010)
Bruce A. Bobier, Joe Sawada
A fast algorithm to generate open meandric systems and meanders. ACM Trans. Algorithms 6 (2) (2010)
Daniel Bruce, Chính T. Hoàng, Joe Sawada
A certifying algorithm for 3-colorability of P5-free graphs CoRR (2009)
Yue Li, Joe Sawada
Gray codes for reflectable languages. Inf. Process. Lett. 109 (5) (2009)
Daniel Bruce, Chính T. Hoàng, Joe Sawada
-Free Graphs. ISAAC (2009)
Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu
A Note on k-Colorability of P5-Free Graphs. MFCS (2008)
Andrew Baker, Joe Sawada
Magic Labelings on Cycles and Wheels. COCOA (2008)
Joe Sawada
A Simple Gray Code to List All Minimal Signed Binary Representations. SIAM J. Discret. Math. 21 (1) (2007)
Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu
Deciding k-colourability of P_5-free graphs in polynomial time CoRR (2007)
Joe Sawada, Dennis Chi-Him Wong
A fast algorithm to generate Beckett-Gray codes: Extended Abstract. Electron. Notes Discret. Math. 29 (2007)
Chính T. Hoàng, Joe Sawada, Xiao Shu
k-Colorability of P5-free graphs CoRR (2006)
Joe Sawada
Generating rooted and free plane trees. ACM Trans. Algorithms 2 (1) (2006)
Gurmeet Singh Manku, Joe Sawada
A Loopless Gray Code for Minimal Signed-Binary Representations. ESA (2005)
Joe Sawada
Oracles for vertex elimination orderings. Theor. Comput. Sci. 341 (1-3) (2005)
Joe Sawada
A Gray code for binary subtraction. Electron. Notes Discret. Math. 19 (2005)
Joe Sawada, Frank Ruskey
Generating Lyndon brackets.: An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2). J. Algorithms 46 (1) (2003)
L. Sunil Chandran, Louis Ibarra, Frank Ruskey, Joe Sawada
Generating and characterizing the perfect elimination orderings of a chordal graph. Theor. Comput. Sci. 307 (2) (2003)
John A. Ellis, Frank Ruskey, Joe Sawada, Jamie Simpson
Euclidean strings. Theor. Comput. Sci. 301 (1-3) (2003)
Joe Sawada
A fast algorithm to generate necklaces with fixed content. Theor. Comput. Sci. 301 (1-3) (2003)
Joe Sawada, Jeremy P. Spinrad
From a simple elimination ordering to a strong elimination ordering in linear time. Inf. Process. Lett. 86 (6) (2003)
Frank Ruskey, Joe Sawada
Bent Hamilton Cycles in d-Dimensional Grid Graphs. Electron. J. Comb. 10 (2003)
Joe Sawada
A Fast Algorithm for Generating Nonisomorphic Chord Diagrams. SIAM J. Discret. Math. 15 (4) (2002)
Joe Sawada
Generating Bracelets in Constant Amortized Time. SIAM J. Comput. 31 (1) (2001)
Frank Ruskey, C. Robert Miers, Joe Sawada
The Number of Irreducible Polynomials and Lyndon Words with Given Trace. SIAM J. Discret. Math. 14 (2) (2001)
Frank Ruskey, Joe Sawada
A fast algorithm to generate unlabeled necklaces. SODA (2000)
Frank Ruskey, Joe Sawada
Generating Necklaces and Strings with Forbidden Substrings. COCOON (2000)
Kevin Cattell, Frank Ruskey, Joe Sawada, Micaela Serra, C. Robert Miers
Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2). J. Algorithms 37 (2) (2000)
Joe Sawada, Frank Ruskey
An Efficient Algorithm for Generating Necklaces with Fixed Density. SODA (1999)
Frank Ruskey, Joe Sawada
An Efficient Algorithm for Generating Necklaces with Fixed Density. SIAM J. Comput. 29 (2) (1999)

Joe Sawada.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Joe Sawada