Joe Sawada - RankMe

109 papers A* 4A 1B 7C 3Misc 3Journal 86Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences. CoRR Daniel Gabric, Wazed Imam, Lukas Janik Jones, Joe Sawada
2026	J	`jnl`	Universal cycle constructions for k-subsets and k-multisets. CoRR Colin Campbell, Luke Janik-Jones, Joe Sawada
2025	J	`jnl`	Constructing k-ary orientable sequences with asymptotically optimal length. Des. Codes Cryptogr. Daniel Gabric, Joe Sawada
2025	J	`jnl`	Cut-down de Bruijn sequences. Discret. Math. Ben Cameron, Aysu Gündogan, Joe Sawada
2025	J	`jnl`	Efficient Constructions of the Prefer-Same and Prefer-Opposite de Bruijn Sequences. ACM Trans. Algorithms Evan Sala, Joe Sawada, Abbas Alhakim
2025	J	`jnl`	Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random. RAIRO Theor. Informatics Appl. Joe Sawada, Daniel Gabric
2025	B	`conf`	Maximize the Rightmost Digit:Gray Codes for Restricted Growth Strings. WALCOM Yuan Qiu, Joe Sawada, Aaron Williams
2025	J	`jnl`	Random generation of universal cycles and de Bruijn sequences. CoRR Joe Sawada, Daniel Gabric
2024	J	`jnl`	Constructing k-ary Orientable Sequences with Asymptotically Optimal Length. CoRR Daniel Gabric, Joe Sawada
2024	B	`conf`	Efficient Construction of Long Orientable Sequences. CPM Daniel Gabric, Joe Sawada
2024	J	`jnl`	Efficient Construction of Long Orientable Sequences. CoRR Daniel Gabric, Joe Sawada
2024	J	`jnl`	Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan. Graphs Comb. Ben Cameron, Aaron Grubb, Joe Sawada
2024	J	`jnl`	Vertex-critical (P3+ℓP1)-free and vertex-critical (gem, co-gem)-free graphs. Discret. Appl. Math. Tala Abuadas, Ben Cameron, Chính T. Hoàng, Joe Sawada
2023	J	`jnl`	Constructing the first (and coolest) fixed-content universal cycle. Algorithmica Joe Sawada, 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`	Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality. Algorithmica Ben Cameron, Joe Sawada, Wei Therese, Aaron Williams
2022	—	`conf`	A 50 Gbps 49 mW CMOS Analog Multiplexer for a DAC Bandwidth Tripler. RWS Keisuke Kawahara, Joe Sawada, Takumi Kamo, Yohtaro Umeda, Kyoya Takano
2022	J	`jnl`	Cut-Down de Bruijn Sequences. CoRR Ben Cameron, Aysu Gündogan, Joe Sawada
2022	J	`jnl`	Dichotomizing k-vertex-critical H-free graphs for H of order four. Discret. Appl. Math. Ben Cameron, Chính T. Hoàng, Joe Sawada
2022	J	`jnl`	Flip-swap languages in binary reflected Gray code order. Theor. Comput. Sci. Joe Sawada, Aaron Williams, Dennis Wong
2022	J	`jnl`	Gray codes and symmetric chains. J. Comb. Theory B Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille
2022	J	`jnl`	Investigating the discrepancy property of de Bruijn sequences. Discret. Math. Daniel Gabric, Joe Sawada
2022	J	`jnl`	Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan. CoRR Ben Cameron, Aaron Grubb, Joe Sawada
2022	J	`jnl`	Vertex-critical (P CoRR Tala Abuadas, Ben Cameron, Chính T. Hoàng, Joe Sawada
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	Misc	`conf`	A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph. COCOON Ben Cameron, Aaron Grubb, Joe Sawada
2021	J	`jnl`	A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph. CoRR Ben Cameron, Aaron Grubb, Joe Sawada
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`	DAC Bandwidth Tripler with 3: 1 Image-Rejection Analog Multiplexer. ICECS Yusuke Yokoi, Yusuke Takai, Joe Sawada, Takumi Kamo, Yohtaro Umeda, Kyoya Takano
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	J	`jnl`	Revisiting the Prefer-same and Prefer-opposite de Bruijn sequence constructions. Theor. Comput. Sci. Abbas Alhakim, Evan Sala, Joe Sawada
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	J	`jnl`	Dichotomizing k-vertex-critical H-free graphs for H of order four. CoRR Ben Cameron, Chính T. Hoàng, Joe Sawada
2020	J	`jnl`	Efficient constructions of the Prefer-same and Prefer-opposite de Bruijn sequences. CoRR Evan Sala, Joe Sawada, Abbas Alhakim
2020	J	`jnl`	Efficient universal cycle constructions for weak orders. Discret. Math. Joe Sawada, Dennis Wong
2020	J	`jnl`	Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. CoRR Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada
2020	J	`jnl`	Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. Theor. Comput. Sci. Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada
2020	J	`jnl`	Investigating the discrepancy property of de Bruijn sequences. CoRR Daniel Gabric, Joe Sawada
2020	J	`jnl`	Solving the Sigma-Tau Problem. ACM Trans. Algorithms Joe Sawada, Aaron Williams
2019	J	`jnl`	A Pascal-like bound for the number of necklaces with fixed density. Theor. Comput. Sci. István Heckenberger, Joe Sawada
2019	J	`jnl`	Ranking and unranking fixed-density necklaces and Lyndon words. Theor. Comput. Sci. Patrick Hartman, Joe Sawada
2018	A*	`conf`	A Hamilton Path for the Sigma-Tau Problem. SODA Joe Sawada, 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 by concatenating smaller universal cycles. Theor. Comput. Sci. Daniel Gabric, Joe Sawada
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	A*	`conf`	Gray Codes and Symmetric Chains. ICALP Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille
2018	J	`jnl`	Gray codes and symmetric chains. CoRR Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille
2017	—	`conf`	A de Bruijn Sequence Construction by Concatenating Cycles of the Complemented Cycling Register. WORDS Daniel Gabric, Joe Sawada
2017	J	`jnl`	A simple shift rule for k-ary de Bruijn sequences. Discret. Math. Joe Sawada, Aaron Williams, Dennis Wong
2017	J	`jnl`	Finding the largest fixed-density necklace and Lyndon word. Inf. Process. Lett. Joe Sawada, Patrick Hartman
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`	On prefix normal words and prefix normal forms. Theor. Comput. Sci. Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
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`	On Prefix Normal Words and Prefix Normal Forms. CoRR Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
2016	J	`jnl`	Successor rules for flipping pancakes and burnt pancakes. Theor. Comput. Sci. Joe Sawada, Aaron Williams
2015	J	`jnl`	Charm bracelets and their application to the construction of periodic Golay pairs. Discret. Appl. Math. Dragomir Z. Dokovic, Ilias S. Kotsireas, Daniel Recoskie, Joe Sawada
2015	J	`jnl`	Constructions of k-critical P5-free graphs. Discret. Appl. Math. Chính T. Hoàng, Brian Moore, Daniel Recoskie, Joe Sawada, Martin Vatshelle
2015	J	`jnl`	Snakes, coils, and single-track circuit codes with spread k. J. Comb. Optim. Simon Hood, Daniel Recoskie, Joe Sawada, Dennis Wong
2014	Misc	`conf`	Normal, Abby Normal, Prefix Normal. FUN Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
2014	J	`jnl`	Normal, Abby Normal, Prefix Normal. CoRR Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
2014	B	`conf`	On Combinatorial Generation of Prefix Normal Words. CPM Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
2014	J	`jnl`	On Combinatorial Generation of Prefix Normal Words. CoRR Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
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 Gray code for fixed-density necklaces and Lyndon words in constant amortized time. Theor. Comput. Sci. Joe Sawada, Aaron Williams
2013	J	`jnl`	Finding and listing induced paths and cycles. Discret. Appl. Math. Chính T. Hoàng, Marcin Kaminski, Joe Sawada, R. Sritharan
2013	J	`jnl`	Generating bracelets with fixed content. Theor. Comput. Sci. Saira Karim, Joe Sawada, Zareen Alamgir, Syed Husnine
2013	J	`jnl`	Greedy Pancake Flipping. Electron. Notes Discret. Math. Aaron Williams, Joe Sawada
2013	J	`jnl`	On k-critical P Electron. Notes Discret. Math. Chính T. Hoàng, Brian Moore, Daniel Recoskie, 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`	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`	Stamp Foldings, Semi-Meanders, and Open Meanders: Fast Generation Algorithms. Electron. J. Comb. Joe Sawada, Roy Li
2011	B	`conf`	De Bruijn Sequences for the Binary Strings with Maximum Density. WALCOM Joe Sawada, Brett Stevens, Aaron Williams
2010	J	`jnl`	A fast algorithm to generate open meandric systems and meanders. ACM Trans. Algorithms Bruce A. Bobier, Joe Sawada
2010	J	`jnl`	Deciding Algorithmica Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu
2009	B	`conf`	A Certifying Algorithm for 3-Colorability of ISAAC Daniel Bruce, Chính T. Hoàng, Joe Sawada
2009	J	`jnl`	A certifying algorithm for 3-colorability of P5-free graphs CoRR Daniel Bruce, Chính T. Hoàng, Joe Sawada
2009	J	`jnl`	Gray codes for reflectable languages. Inf. Process. Lett. Yue Li, Joe Sawada
2008	B	`conf`	A Note on k-Colorability of P5-Free Graphs. MFCS Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu
2008	C	`conf`	Magic Labelings on Cycles and Wheels. COCOA Andrew Baker, Joe Sawada
2007	J	`jnl`	A Simple Gray Code to List All Minimal Signed Binary Representations. SIAM J. Discret. Math. Joe Sawada
2007	J	`jnl`	A fast algorithm to generate Beckett-Gray codes: Extended Abstract. Electron. Notes Discret. Math. Joe Sawada, Dennis Chi-Him Wong
2007	J	`jnl`	Deciding k-colourability of P_5-free graphs in polynomial time CoRR Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu
2006	J	`jnl`	Generating rooted and free plane trees. ACM Trans. Algorithms Joe Sawada
2006	J	`jnl`	k-Colorability of P5-free graphs CoRR Chính T. Hoàng, Joe Sawada, Xiao Shu
2005	J	`jnl`	A Gray code for binary subtraction. Electron. Notes Discret. Math. Joe Sawada
2005	A	`conf`	A Loopless Gray Code for Minimal Signed-Binary Representations. ESA Gurmeet Singh Manku, Joe Sawada
2005	J	`jnl`	Oracles for vertex elimination orderings. Theor. Comput. Sci. Joe Sawada
2003	J	`jnl`	A fast algorithm to generate necklaces with fixed content. Theor. Comput. Sci. Joe Sawada
2003	J	`jnl`	Bent Hamilton Cycles in d-Dimensional Grid Graphs. Electron. J. Comb. Frank Ruskey, Joe Sawada
2003	J	`jnl`	Euclidean strings. Theor. Comput. Sci. John A. Ellis, Frank Ruskey, Joe Sawada, Jamie Simpson
2003	J	`jnl`	From a simple elimination ordering to a strong elimination ordering in linear time. Inf. Process. Lett. Joe Sawada, Jeremy P. Spinrad
2003	J	`jnl`	Generating Lyndon brackets.: An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2). J. Algorithms Joe Sawada, Frank Ruskey
2003	J	`jnl`	Generating and characterizing the perfect elimination orderings of a chordal graph. Theor. Comput. Sci. L. Sunil Chandran, Louis Ibarra, Frank Ruskey, Joe Sawada
2002	J	`jnl`	A Fast Algorithm for Generating Nonisomorphic Chord Diagrams. SIAM J. Discret. Math. Joe Sawada
2001	J	`jnl`	Generating Bracelets in Constant Amortized Time. SIAM J. Comput. Joe Sawada
2001	J	`jnl`	The Number of Irreducible Polynomials and Lyndon Words with Given Trace. SIAM J. Discret. Math. Frank Ruskey, C. Robert Miers, Joe Sawada
2000	A*	`conf`	A fast algorithm to generate unlabeled necklaces. SODA Frank Ruskey, Joe Sawada
2000	J	`jnl`	Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2). J. Algorithms Kevin Cattell, Frank Ruskey, Joe Sawada, Micaela Serra, C. Robert Miers
2000	—	`—`	Fast algorithms to generate restricted classes of strings under rotation. Joe Sawada
2000	Misc	`conf`	Generating Necklaces and Strings with Forbidden Substrings. COCOON Frank Ruskey, Joe Sawada
1999	A*	`conf`	An Efficient Algorithm for Generating Necklaces with Fixed Density. SODA Joe Sawada, Frank Ruskey
1999	J	`jnl`	An Efficient Algorithm for Generating Necklaces with Fixed Density. SIAM J. Comput. Frank Ruskey, Joe Sawada