1. J. Sawada, A fast algorithm to generate necklaces with fixed content, to appear in Theoretical Computer Science, 2003.
   
   
2. J. Sawada, J.P. Spinrad From a simple elimination ordering to a strong elimination ordering in linear time, to appear in Information Processing Letters, 2003.
   
   
3. L.S. Chandran, L. Ibarra, F. Ruskey, J. Sawada, Fast generation of all perfect elimiation orderings of a chordal graph, to appear in Theoretical Computer Science, 2003.
   
   
4. J. Ellis, F. Ruskey, J. Sawada, J. Simpson, Euclidean strings, to appear in Theoretical Computer Science, 2003.
   
   
5. J. Sawada and F. Ruskey, Generating Lyndon brackets. An addendum to Fast algorithms to generate necklaces, unlabeled necklaces, and irreducible polynomials over GF(2), to appear in Journal of Algorithms.
   (lie.ps), (lie.pdf)
   
   
6. F. Ruskey, J. Sawada, Bent Hamilton Cycles in d-dimensional grid graphs, The Electronic Journal of Combinatorics, Vol 10 No. 1 (2003) R1.
   (bent.ps), (bent.pdf)
   
   
7. K. Cattell, C.R. Miers, F. Ruskey, M. Serra, and J. Sawada The number of irreducible polynomials over GF(2) with given trace and subtrace, to appear in the Jounal of Combinatorial Mathematics and Combinatorial Computing.
   
   
8. J. Sawada, A fast algorithm for generating non-isomorphic chord diagrams, SIAM Journal on Discrete Mathematics, Vol. 15 No. 4 (2002) 546-561.
   (chord.ps), (chord.pdf)
   
   
9. J. Sawada, Generating bracelets in constant amortized time, SIAM Journal on Computing, Vol. 31, No. 1 (2001) 259-268.
   (brace.ps), (brace.pdf)
   
   
10. F. Ruskey, C.R. Miers, and J. Sawada, The number of irreducible polynomials and Lyndon words with given trace, SIAM J. Discrete Math., Vol. 14. No 2. (2001) 240-245.
    (traceq.ps), (traceq.pdf)
    
    
11. K. Cattell, F. Ruskey, J. Sawada, M. Serra and C.R. Miers, Fast algorithms to generate necklaces, unlabeled necklaces, and irreducible polynomials over GF(2), Journal of Algorithms, Vol. 37 No. 2 (2000) 267-282.
    (un.ps), (un.pdf)
    
    
12. F. Ruskey and J. Sawada, An efficient algorithm for generating necklaces with fixed density, SIAM Journal on Computing, 29 (1999) 671-684.
    (fix.ps), (fix.pdf)
    
    
13. F. Ruskey and J. Sawada, Generating necklaces and strings with forbidden substrings, 6th Annual International Combinatorics and Computing Conference (COCOON), Lecture Notes in Computer Science, 1858 (2000) 330-339.
    (forb.ps), (forb.pdf)

Submitted Manuscripts

• J. Sawada, Generating rooted and free plane trees, submitted to Journal of Algorithms, 2002.

In progress

• J. Sawada, Applying an antimatroid result to list all simple elimination orderings of a strongly chordal graph.