Joe Sawada
University of Guelph
H-index: 23
North America-Canada
Top articles of Joe Sawada
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Vertex-critical (P3+ ℓP1)-free and vertex-critical (gem, co-gem)-free graphs | Discrete Applied Mathematics | Tala Abuadas Ben Cameron Chính T Hoàng Joe Sawada | 2024/2/15 |
Efficient Construction of Long Orientable Sequences | arXiv preprint arXiv:2401.14341 | Daniel Gabric Joe Sawada | 2024/1/25 |
Demystifying our Grandparent's De Bruijn Sequences with Concatenation Trees | arXiv preprint arXiv:2308.12405 | Joe Sawada Jackson Sears Andrew Trautrim Aaron Williams | 2023/8/23 |
Constructing the first (and coolest) fixed-content universal cycle | Algorithmica | Joe Sawada Aaron Williams | 2023/6 |
Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality | Algorithmica | Ben Cameron Joe Sawada Wei Therese Aaron Williams | 2023/3 |
Cut-down de bruijn sequences | arXiv preprint arXiv:2205.02815 | Ben Cameron Aysu Gündoğan Joe Sawada | 2022/5/5 |
Investigating the discrepancy property of de Bruijn sequences | Discrete Mathematics | Daniel Gabric Joe Sawada | 2022/4/1 |
Gray codes and symmetric chains | Journal of Combinatorial Theory, Series B | Petr Gregor Sven Jäger Torsten Mütze Joe Sawada Kaja Wille | 2022/3/1 |
Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan | arXiv preprint arXiv:2202.01746 | Ben Cameron Aaron Grubb Joe Sawada | 2022/2/3 |
Flip-swap languages in binary reflected Gray code order | Theoretical Computer Science | Joe Sawada Aaron Williams Dennis Wong | 2022/10/14 |
Dichotomizing k-vertex-critical H-free graphs for H of order four | Discrete Applied Mathematics | Ben Cameron Chính T Hoàng Joe Sawada | 2022/5/15 |
A universal cycle for strings with fixed-content (which are also known as multiset permutations) | Joe Sawada Aaron Williams | 2021 | |
A pivot gray code listing for the spanning trees of the fan graph | Ben Cameron Aaron Grubb Joe Sawada | 2021 | |
Inside the binary reflected gray code: Flip-swap languages in 2-gray code order | Joe Sawada Aaron Williams Dennis Wong | 2021 | |
A Hamilton Cycle in the k-Sided Pancake Network | Ben Cameron Joe Sawada Aaron Williams | 2021 | |
Revisiting the prefer-same and prefer-opposite de Bruijn sequence constructions | Theoretical Computer Science | Abbas Alhakim Evan Sala Joe Sawada | 2021/1/8 |
Efficient constructions of the Prefer-same and Prefer-opposite de Bruijn sequences | arXiv preprint arXiv:2010.07960 | Evan Sala Joe Sawada Abbas Alhakim | 2020/10/15 |
Efficient universal cycle constructions for weak orders | Discrete Mathematics | Joe Sawada Dennis Wong | 2020/10/1 |
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word | Theoretical Computer Science | Péter Burcsi Gabriele Fici Zsuzsanna Lipták Rajeev Raman Joe Sawada | 2020/11/24 |
