default search action
Joe Sawada
Joseph James Sawada
Person information
- affiliation: University of Guelph, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j60]Ben Cameron, Aysu Gündogan, Joe Sawada
:
Cut-down de Bruijn sequences. Discret. Math. 348(1): 114204 (2025) - 2024
- [j59]Tala Abuadas, Ben Cameron
Vertex-critical (P3+ℓP1)-free and vertex-critical (gem, co-gem)-free graphs. Discret. Appl. Math. 344: 179-187 (2024) - [j58]Ben Cameron, Aaron Grubb
Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan. Graphs Comb. 40(4): 78 (2024) - [c21]Daniel Gabric, Joe Sawada:
Efficient Construction of Long Orientable Sequences. CPM 2024: 15:1-15:12 - [i20]Daniel Gabric
Efficient Construction of Long Orientable Sequences. CoRR abs/2401.14341 (2024) - [i19]Daniel Gabric, Joe Sawada:
Constructing k-ary Orientable Sequences with Asymptotically Optimal Length. CoRR abs/2407.07029 (2024) - 2023
- [j57]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): 717-744 (2023) - [j56]Joe Sawada
Constructing the first (and coolest) fixed-content universal cycle. Algorithmica 85(6): 1754-1785 (2023) - [i18]Joe Sawada, Jackson Sears, Andrew Trautrim, Aaron Williams:
Demystifying our Grandparent's De Bruijn Sequences with Concatenation Trees. CoRR abs/2308.12405 (2023) - 2022
- [j55]Ben Cameron
Dichotomizing k-vertex-critical H-free graphs for H of order four. Discret. Appl. Math. 312: 106-115 (2022) - [j54]Daniel Gabric
Investigating the discrepancy property of de Bruijn sequences. Discret. Math. 345(4): 112780 (2022) - [j53]Petr Gregor
Gray codes and symmetric chains. J. Comb. Theory B 153: 31-60 (2022) - [j52]Joe Sawada, Aaron Williams, Dennis Wong:
Flip-swap languages in binary reflected Gray code order. Theor. Comput. Sci. 933: 138-148 (2022) - [c20]Keisuke Kawahara
A 50 Gbps 49 mW CMOS Analog Multiplexer for a DAC Bandwidth Tripler. RWS 2022: 125-127 - [i17]Ben Cameron, Aaron Grubb, Joe Sawada:
Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan. CoRR abs/2202.01746 (2022) - [i16]Ben Cameron, Aysu Gündogan, Joe Sawada:
Cut-Down de Bruijn Sequences. CoRR abs/2205.02815 (2022) - [i15]Tala Abuadas, Ben Cameron, Chính T. Hoàng, Joe Sawada:
Vertex-critical (P3+𝓁P1)-free and vertex-critical (gem, co-gem)-free graphs. CoRR abs/2206.03422 (2022) - 2021
- [j51]Abbas Alhakim, Evan Sala, Joe Sawada:
Revisiting the Prefer-same and Prefer-opposite de Bruijn sequence constructions. Theor. Comput. Sci. 852: 73-77 (2021) - [c19]Ben Cameron, Aaron Grubb, Joe Sawada:
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph. COCOON 2021: 49-60 - [c18]Joe Sawada, Aaron Williams, Dennis Wong:
Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order. WORDS 2021: 172-184 - [c17]Yusuke Yokoi, Yusuke Takai, Joe Sawada, Takumi Kamo, Yohtaro Umeda, Kyoya Takano
DAC Bandwidth Tripler with 3: 1 Image-Rejection Analog Multiplexer. ICECS 2021: 1-6 - [c16]Ben Cameron, Joe Sawada, Aaron Williams:
A Hamilton Cycle in the k-Sided Pancake Network. IWOCA 2021: 137-151 - [c15]Joe Sawada, Aaron Williams:
A Universal Cycle for Strings with Fixed-Content (Which Are Also Known as Multiset Permutations). WADS 2021: 599-612 - [i14]Ben Cameron, Joe Sawada, Aaron Williams:
A Hamilton Cycle in the k-Sided Pancake Network. CoRR abs/2103.09256 (2021) - [i13]Joe Sawada, Aaron Williams, Dennis Wong:
Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order. CoRR abs/2105.03556 (2021) - [i12]Ben Cameron, Aaron Grubb, Joe Sawada:
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph. CoRR abs/2108.09363 (2021) - 2020
- [j50]Joe Sawada, Dennis Wong
Efficient universal cycle constructions for weak orders. Discret. Math. 343(10): 112022 (2020) - [j49]Joe Sawada
Solving the Sigma-Tau Problem. ACM Trans. Algorithms 16(1): 11:1-11:17 (2020) - [j48]Péter Burcsi, Gabriele Fici
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. Theor. Comput. Sci. 842: 86-99 (2020) - [j47]Daniel Gabric
A Successor Rule Framework for Constructing k-Ary de Bruijn Sequences and Universal Cycles. IEEE Trans. Inf. Theory 66(1): 679-687 (2020) - [i11]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 abs/2003.03222 (2020) - [i10]Daniel Gabric
Investigating the discrepancy property of de Bruijn sequences. CoRR abs/2005.01638 (2020) - [i9]Ben Cameron, Chính T. Hoàng, Joe Sawada:
Dichotomizing k-vertex-critical H-free graphs for H of order four. CoRR abs/2007.00057 (2020) - [i8]Evan Sala, Joe Sawada, Abbas Alhakim:
Efficient constructions of the Prefer-same and Prefer-opposite de Bruijn sequences. CoRR abs/2010.07960 (2020)
2010 – 2019
- 2019
- [j46]István Heckenberger, Joe Sawada:
A Pascal-like bound for the number of necklaces with fixed density. Theor. Comput. Sci. 778: 73-77 (2019) - [j45]Patrick Hartman, Joe Sawada:
Ranking and unranking fixed-density necklaces and Lyndon words. Theor. Comput. Sci. 791: 36-47 (2019) - 2018
- [j44]Daniel Gabric
A framework for constructing de Bruijn sequences via simple successor rules. Discret. Math. 341(11): 2977-2987 (2018) - [j43]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: 1-11 (2018) - [j42]Daniel Gabric
Constructing de Bruijn sequences by concatenating smaller universal cycles. Theor. Comput. Sci. 743: 12-22 (2018) - [c14]Petr Gregor
Gray Codes and Symmetric Chains. ICALP 2018: 66:1-66:14 - [c13]Joe Sawada, Aaron Williams:
A Hamilton Path for the Sigma-Tau Problem. SODA 2018: 568-575 - [i7]Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille:
Gray codes and symmetric chains. CoRR abs/1802.06021 (2018) - 2017
- [j41]Joe Sawada, Aaron Williams, Dennis Wong
A simple shift rule for k-ary de Bruijn sequences. Discret. Math. 340(3): 524-531 (2017) - [j40]Joe Sawada, Patrick Hartman:
Finding the largest fixed-density necklace and Lyndon word. Inf. Process. Lett. 125: 15-19 (2017) - [j39]Joe Sawada, Aaron Williams:
Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences. J. Discrete Algorithms 43: 95-110 (2017) - [j38]Joe Sawada, Aaron Williams, Dennis Wong:
Necklaces and Lyndon words in colexicographic and binary reflected Gray code order. J. Discrete Algorithms 46-47: 25-35 (2017) - [j37]Peter Burcsi
On prefix normal words and prefix normal forms. Theor. Comput. Sci. 659: 1-13 (2017) - [c12]Daniel Gabric
A de Bruijn Sequence Construction by Concatenating Cycles of the Complemented Cycling Register. WORDS 2017: 49-58 - 2016
- [j36]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): 1 (2016) - [j35]Joe Sawada, Aaron Williams:
Greedy flipping of pancakes and burnt pancakes. Discret. Appl. Math. 210: 61-74 (2016) - [j34]Joe Sawada, Aaron Williams, Dennis Wong
A surprisingly simple de Bruijn sequence construction. Discret. Math. 339(1): 127-131 (2016) - [j33]Joe Sawada, Aaron Williams
Successor rules for flipping pancakes and burnt pancakes. Theor. Comput. Sci. 609: 60-75 (2016) - [i6]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
On Prefix Normal Words and Prefix Normal Forms. CoRR abs/1611.09017 (2016) - 2015
- [j32]Chính T. Hoàng, Brian Moore, Daniel Recoskie, Joe Sawada, Martin Vatshelle:
Constructions of k-critical P5-free graphs. Discret. Appl. Math. 182: 91-98 (2015) - [j31]Dragomir Z. Dokovic
Charm bracelets and their application to the construction of periodic Golay pairs. Discret. Appl. Math. 188: 32-40 (2015) - [j30]Simon Hood, Daniel Recoskie, Joe Sawada, Dennis Wong:
Snakes, coils, and single-track circuit codes with spread k. J. Comb. Optim. 30(1): 42-62 (2015) - 2014
- [j29]Joe Sawada, Aaron Williams, Dennis Wong:
The lexicographically smallest universal cycle for binary strings with minimum specified weight. J. Discrete Algorithms 28: 31-40 (2014) - [c11]Peter Burcsi
On Combinatorial Generation of Prefix Normal Words. CPM 2014: 60-69 - [c10]Peter Burcsi
Normal, Abby Normal, Prefix Normal. FUN 2014: 74-88 - [i5]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
On Combinatorial Generation of Prefix Normal Words. CoRR abs/1401.6346 (2014) - [i4]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
Normal, Abby Normal, Prefix Normal. CoRR abs/1404.2824 (2014) - 2013
- [j28]Chính T. Hoàng, Marcin Kaminski, Joe Sawada, R. Sritharan:
Finding and listing induced paths and cycles. Discret. Appl. Math. 161(4-5): 633-641 (2013) - [j27]Chính T. Hoàng, Brian Moore, Daniel Recoskie, Joe Sawada:
On k-critical P5-free graphs. Electron. Notes Discret. Math. 44: 187-193 (2013) - [j26]Aaron Williams, Joe Sawada:
Greedy Pancake Flipping. Electron. Notes Discret. Math. 44: 357-362 (2013) - [j25]Saira Karim
Generating bracelets with fixed content. Theor. Comput. Sci. 475: 103-112 (2013) - [j24]Joe Sawada, Aaron Williams:
A Gray code for fixed-density necklaces and Lyndon words in constant amortized time. Theor. Comput. Sci. 502: 46-54 (2013) - [c9]Joe Sawada, Aaron Williams, Dennis Chi-Him Wong:
Universal Cycles for Weight-Range Binary Strings. IWOCA 2013: 388-401 - 2012
- [j23]Joe Sawada, Aaron Williams:
Efficient Oracles for Generating Binary Bubble Languages. Electron. J. Comb. 19(1): 42 (2012) - [j22]Joe Sawada, Roy Li:
Stamp Foldings, Semi-Meanders, and Open Meanders: Fast Generation Algorithms. Electron. J. Comb. 19(2): 43 (2012) - [j21]Frank Ruskey
Binary bubble languages and cool-lex order. J. Comb. Theory A 119(1): 155-169 (2012) - [j20]Frank Ruskey
De Bruijn Sequences for Fixed-Weight Binary Strings. SIAM J. Discret. Math. 26(2): 605-617 (2012) - 2011
- [c8]Joe Sawada, Brett Stevens, Aaron Williams:
De Bruijn Sequences for the Binary Strings with Maximum Density. WALCOM 2011: 182-190 - 2010
- [j19]Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin
Deciding k-Colorability of P5-Free Graphs in Polynomial Time. Algorithmica 57(1): 74-81 (2010) - [j18]Bruce A. Bobier, Joe Sawada:
A fast algorithm to generate open meandric systems and meanders. ACM Trans. Algorithms 6(2): 42:1-42:12 (2010)
2000 – 2009
- 2009
- [j17]Yue Li, Joe Sawada:
Gray codes for reflectable languages. Inf. Process. Lett. 109(5): 296-300 (2009) - [c7]Daniel Bruce, Chính T. Hoàng, Joe Sawada:
A Certifying Algorithm for 3-Colorability of P5-Free Graphs. ISAAC 2009: 594-604 - [i3]Daniel Bruce, Chính T. Hoàng, Joe Sawada:
A certifying algorithm for 3-colorability of P5-free graphs. CoRR abs/0907.3497 (2009) - 2008
- [c6]Andrew Baker, Joe Sawada:
Magic Labelings on Cycles and Wheels. COCOA 2008: 361-373 - [c5]Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin
A Note on k-Colorability of P5-Free Graphs. MFCS 2008: 387-394 - 2007
- [j16]Joe Sawada, Dennis Chi-Him Wong:
A fast algorithm to generate Beckett-Gray codes: Extended Abstract. Electron. Notes Discret. Math. 29: 571-577 (2007) - [j15]Joe Sawada:
A Simple Gray Code to List All Minimal Signed Binary Representations. SIAM J. Discret. Math. 21(1): 16-25 (2007) - [i2]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 abs/cs/0702043 (2007) - 2006
- [j14]Joe Sawada:
Generating rooted and free plane trees. ACM Trans. Algorithms 2(1): 1-13 (2006) - [i1]Chính T. Hoàng, Joe Sawada, Xiao Shu:
k-Colorability of P5-free graphs. CoRR abs/cs/0609083 (2006) - 2005
- [j13]Joe Sawada:
A Gray code for binary subtraction. Electron. Notes Discret. Math. 19: 125-131 (2005) - [j12]Joe Sawada:
Oracles for vertex elimination orderings. Theor. Comput. Sci. 341(1-3): 73-90 (2005) - [c4]Gurmeet Singh Manku, Joe Sawada:
A Loopless Gray Code for Minimal Signed-Binary Representations. ESA 2005: 438-447 - 2003
- [j11]Frank Ruskey
Bent Hamilton Cycles in d-Dimensional Grid Graphs. Electron. J. Comb. 10 (2003) - [j10]Joe Sawada, Jeremy P. Spinrad:
From a simple elimination ordering to a strong elimination ordering in linear time. Inf. Process. Lett. 86(6): 299-302 (2003) - [j9]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): 21-26 (2003) - [j8]John A. Ellis, Frank Ruskey
Euclidean strings. Theor. Comput. Sci. 301(1-3): 321-340 (2003) - [j7]Joe Sawada:
A fast algorithm to generate necklaces with fixed content. Theor. Comput. Sci. 301(1-3): 477-489 (2003) - [j6]L. Sunil Chandran, Louis Ibarra, Frank Ruskey
Generating and characterizing the perfect elimination orderings of a chordal graph. Theor. Comput. Sci. 307(2): 303-317 (2003) - 2002
- [j5]Joe Sawada:
A Fast Algorithm for Generating Nonisomorphic Chord Diagrams. SIAM J. Discret. Math. 15(4): 546-561 (2002) - 2001
- [j4]Joe Sawada:
Generating Bracelets in Constant Amortized Time. SIAM J. Comput. 31(1): 259-268 (2001) - [j3]Frank Ruskey
The Number of Irreducible Polynomials and Lyndon Words with Given Trace. SIAM J. Discret. Math. 14(2): 240-245 (2001) - 2000
- [b1]Joe Sawada:
Fast algorithms to generate restricted classes of strings under rotation. University of Victoria, Canada, 2000 - [j2]Kevin Cattell, Frank Ruskey
Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2). J. Algorithms 37(2): 267-282 (2000) - [c3]Frank Ruskey
Generating Necklaces and Strings with Forbidden Substrings. COCOON 2000: 330-339 - [c2]Frank Ruskey, Joe Sawada:
A fast algorithm to generate unlabeled necklaces. SODA 2000: 256-262
1990 – 1999
- 1999
- [j1]Frank Ruskey
An Efficient Algorithm for Generating Necklaces with Fixed Density. SIAM J. Comput. 29(2): 671-684 (1999) - [c1]Joe Sawada, Frank Ruskey:
An Efficient Algorithm for Generating Necklaces with Fixed Density. SODA 1999: 752-758
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: