Bubble Languages ft. de Bruijn (universal) cycles

1. Binary bubble languages and cool-lex order
       F. Ruskey, J. Sawada and A. Williams
       Journal of Combinatorial Theory, Series A 119 (2012) 155-169.
2. Efficient oracles for binary bubble languages
       J. Sawada and A. Williams
       Electronic Journal of Combinatorics, to appear.
3. Fixed density de Bruijn cycles
       F. Ruskey, J. Sawada and A. Williams
       SIAM Journal on Discrete Mathematics, to appear.
4. A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
       J. Sawada and A. Williams
       Theoretical Computer Science, to appear.
5. De Bruijn Sequences for the binary strings with maximum density
       J. Sawada, B. Stevens, and A. Williams
       5th International Workshop on Algorithms and Computation (WALCOM) 2011, India, LNCS 6552 (2011) 182-190.

1. Generating bracelets with fixed content
       S. Karim, J. Sawada, Z. Alamgirz, and S. M. Husnine
       submitted.
2. A fast algorithm to generate necklaces with fixed content
       J. Sawada
       Theoretical Computer Science, Vol. 301 No.1-3 (2003) 477-489.
3. Generating Lyndon brackets
       J. Sawada and F. Ruskey
       Journal of Algorithms, Vol. 46 No. 1 (2003) 21-26.
4. A fast algorithm for generating non-isomorphic chord diagrams
       J. Sawada
       SIAM Journal on Discrete Mathematics, Vol. 15 No. 4 (2002) 546-561.
5. Generating bracelets in constant amortized time
       J. Sawada
       SIAM Journal on Computing, Vol. 31, No. 1 (2001) 259-268.
   
   ERRATUM (reported by Kevin Eaton) The third to last line of the code in Figure 3.1 should read:
       if t=1 then GenBracelets(t+1,t,1,1,1,RS);
   
   
6. The number of irreducible polynomials and Lyndon words with given trace
       F. Ruskey, C.R. Miers, and J. Sawada
       SIAM J. Discrete Math., Vol. 14. No 2. (2001) 240-245.
7. Fast algorithms to generate necklaces, unlabeled necklaces, and irreducible polynomials over GF(2)
       K. Cattell, F. Ruskey, J. Sawada, M. Serra and C.R. Miers
       Journal of Algorithms, Vol. 37 No. 2 (2000) 267-282.
8. An efficient algorithm for generating necklaces with fixed density
       F. Ruskey and J. Sawada
       SIAM Journal on Computing, 29 (1999) 671-684.
9. Generating necklaces and strings with forbidden substrings
       F. Ruskey and J. Sawada
       6th Annual International Combinatorics and Computing Conference (COCOON), LNCS 1858 (2000) 330-339.

Signed Digit Representations

1. A simple Gray code to list all minimal signed binary representations
       J. Sawada
       SIAM Journal on Discrete Mathematics, Vol. 21 No. 1 (2007) 16-25.
2. A loopless Gray code for minimal signed-binary representations
       G. Manku, J. Sawada
       13th Annual European Symposium on Algorithms (ESA), LNCS 3669 (2005) 438-447.

Meanders, Semi-meanders and Stamp Foldings

1. Stamp foldings, semi-meanders, and open meanders: fast generation algorithms
       J. Sawada and R. Li
       submitted.
2. A fast algorithm to generate open meandric systems and meanders
       B. Bobier and J. Sawada
       Transactions on Algorithms, Vol. 6 No. 2 (2010) 12 pages.
3. Gray codes for reflectable languages
       R. Li and J. Sawada
       Information Processing Letters, Vol. 209 No. 5 (2009) 296-300.

1. Snakes, coils, and single-track circuit codes with spread k
       S. Hood, D. Recoskie, J. Sawada and C. Wong
       submitted.
2. Finding and listing induced paths
       C. Hoang, M. Kaminski, J. Sawada and R. Sritharan
       to appear Discrete Applied Mathematics.
3. A certifying algorithm for 3-colorability of P5-free graphs
       D. Bruce, C. Hoang, and J. Sawada
       The 20th International Symposium on Algorithms and Computation (ISAAC 2009), LNCS 5878 (2009) 594-604.
   The 6 minimal graphs that are both P5-free and not 3-colorable.
4. Magic labelings on cycles and wheels
       A. Baker and J. Sawada
       The 2nd Annual International Conference on Combinatorial Optimization and Applications, (COCOA '08) LNCS 5165 (2008) 361-373.
5. A note on k-colorability of P5-free graphs
       C. Hoang, M. Kaminski, V. Lozin, J. Sawada, and X. Shu
       33rd International Symposium on Mathematical Foundations of Computer Scienc (MFCS'08), LNCS 5162 (2008) 387-394.
6. Deciding k-Colorability of P5-free graphs in polynomial time
       C. Hoang, M. Kaminski, V. Lozin, J. Sawada, and X. Shu
       Algorithmica, Vol. 57, No 1 (2010) 74-81.
7. Oracles for vertex elimination orderings
       J. Sawada
       Theoretical Computer Science, Vol. 341 No. 1-3 (2005) 73-90.
8. From a simple elimination ordering to a strong elimination ordering in linear time
       J. Sawada, J.P. Spinrad
       Information Processing Letters, Vol. 86 No. 6 (2003) 299-302.
9. Generating and characterizing the perfect elimination orderings of a chordal graph
       L.S. Chandran, L. Ibarra, F. Ruskey, J. Sawada
       Theoretical Computer Science, Vol. 307 No.2 (2003) 303-317.
10. Bent Hamilton cycles in d-dimensional grid graphs
        F. Ruskey, J. Sawada
        The Electronic Journal of Combinatorics, Vol 10 No. 1 (2003) R1.

Miscellaneous

1. The taming of two alley-CATs
       D. Recoskie and J. Sawada
       submitted.
2. A fast algorithm to generate Beckett-Gray codes
       J. Sawada and D. Wong
       Electronic Notes in Discrete Mathematics (EuroComb 2007) 29 (2007) 571-577.
3. Generating rooted and free plane trees
       J. Sawada
       ACM Transactions on Algorithms, Vol. 2 No. 1 (2006) 1-13 .
4. Euclidean strings
       J. Ellis, F. Ruskey, J. Sawada, J. Simpson
       Theoretical Computer Science, Vol. 301 No. 1-3 (2003) 321-340.
5. The number of irreducible polynomials over GF(2) with given trace and subtrace
       K. Cattell, C.R. Miers, F. Ruskey, J. Sawada, M. Serra
       Jounal of Combinatorial Mathematics and Combinatorial Computing, 47 (2003) 31-64.