| Deciding k-Colorability of P 5-Free Graphs in Polynomial Time CT Hoàng, M Kamiński, V Lozin, J Sawada, X Shu Algorithmica 57, 74-81, 2010 | 179 | 2010 |
| Fast algorithms to generate necklaces, unlabeled necklaces, and irreducible polynomials over GF (2) K Cattell, F Ruskey, J Sawada, M Serra, CR Miers Journal of Algorithms 37 (2), 267-282, 2000 | 105 | 2000 |
| An efficient algorithm for generating necklaces with fixed density F Ruskey, J Sawada SIAM Journal on Computing 29 (2), 671-684, 1999 | 102 | 1999 |
| Generating bracelets in constant amortized time J Sawada SIAM Journal on Computing 31 (1), 259-268, 2001 | 73 | 2001 |
| A surprisingly simple de Bruijn sequence construction J Sawada, A Williams, D Wong Discrete Mathematics 339 (1), 127-131, 2016 | 69 | 2016 |
| A fast algorithm to generate necklaces with fixed content J Sawada Theoretical Computer Science 301 (1-3), 477-489, 2003 | 55 | 2003 |
| Generating and characterizing the perfect elimination orderings of a chordal graph LS Chandran, L Ibarra, F Ruskey, J Sawada Theoretical Computer Science 307 (2), 303-317, 2003 | 53 | 2003 |
| A Certifying Algorithm for 3-Colorability of P 5-Free Graphs D Bruce, CT Hoàng, J Sawada Algorithms and Computation: 20th International Symposium, ISAAC 2009 …, 2009 | 52 | 2009 |
| De Bruijn sequences for fixed-weight binary strings F Ruskey, J Sawada, A Williams SIAM Journal on Discrete Mathematics 26 (2), 605-617, 2012 | 50* | 2012 |
| Binary bubble languages and cool-lex order F Ruskey, J Sawada, A Williams Journal of Combinatorial Theory, Series A 119 (1), 155-169, 2012 | 48 | 2012 |
| A framework for constructing de Bruijn sequences via simple successor rules D Gabric, J Sawada, A Williams, D Wong Discrete Mathematics 341 (11), 2977-2987, 2018 | 40 | 2018 |
| Constructions of k-critical P5-free graphs CT Hoàng, B Moore, D Recoskie, J Sawada, M Vatshelle Discrete Applied Mathematics 182, 91-98, 2015 | 36 | 2015 |
| Generating necklaces and strings with forbidden substrings F Ruskey, J Sawada Computing and Combinatorics: 6th Annual International Conference, COCOON …, 2000 | 36 | 2000 |
| A Gray code for fixed-density necklaces and Lyndon words in constant amortized time J Sawada, A Williams Theoretical Computer Science 502, 46-54, 2013 | 33 | 2013 |
| The number of irreducible polynomials over GF (2) with given trace and subtrace K Cattell, CR Miers, F Ruskey, J Sawada, M Serra Journal of Combinatorial Mathematics and Combinatorial Computing 47, 31-64, 2003 | 33 | 2003 |
| A Successor Rule Framework for Constructing -Ary de Bruijn Sequences and Universal Cycles D Gabric, J Sawada, A Williams, D Wong IEEE Transactions on Information Theory 66 (1), 679-687, 2019 | 32 | 2019 |
| Constructing de Bruijn sequences with co-lexicographic order: The k-ary Grandmama sequence PB Dragon, OI Hernandez, J Sawada, A Williams, D Wong European Journal of Combinatorics 72, 1-11, 2018 | 30 | 2018 |
| Finding and listing induced paths and cycles CT Hoàng, M Kamiński, J Sawada, R Sritharan Discrete Applied Mathematics 161 (4-5), 633-641, 2013 | 29 | 2013 |
| The number of irreducible polynomials and Lyndon words with given trace F Ruskey, CR Miers, J Sawada SIAM Journal on Discrete Mathematics 14 (2), 240-245, 2001 | 29 | 2001 |
| A simple shift rule for k-ary de Bruijn sequences J Sawada, A Williams, D Wong Discrete Mathematics 340 (3), 524-531, 2017 | 27 | 2017 |