| 2006 |
|---|
| 16 | EE | Joe Sawada:
Generating rooted and free plane trees.
ACM Transactions on Algorithms 2(1): 1-13 (2006) |
| 2005 |
|---|
| 15 | EE | Gurmeet Singh Manku,
Joe Sawada:
A Loopless Gray Code for Minimal Signed-Binary Representations.
ESA 2005: 438-447 |
| 2003 |
|---|
| 14 | EE | Frank Ruskey,
Joe Sawada:
Bent Hamilton Cycles in d-Dimensional Grid Graphs.
Electr. J. Comb. 10: (2003) |
| 13 | EE | Joe Sawada,
Jeremy Spinrad:
From a simple elimination ordering to a strong elimination ordering in linear time.
Inf. Process. Lett. 86(6): 299-302 (2003) |
| 12 | EE | 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) |
| 11 | EE | John A. Ellis,
Frank Ruskey,
Joe Sawada,
Jamie Simpson:
Euclidean strings.
Theor. Comput. Sci. 1-3(301): 321-340 (2003) |
| 10 | EE | Joe Sawada:
A fast algorithm to generate necklaces with fixed content.
Theor. Comput. Sci. 1-3(301): 477-489 (2003) |
| 9 | EE | L. Sunil Chandran,
Louis Ibarra,
Frank Ruskey,
Joe Sawada:
Generating and characterizing the perfect elimination orderings of a chordal graph.
Theor. Comput. Sci. 307(2): 303-317 (2003) |
| 2002 |
|---|
| 8 | EE | Joe Sawada:
A Fast Algorithm for Generating Nonisomorphic Chord Diagrams.
SIAM J. Discrete Math. 15(4): 546-561 (2002) |
| 2001 |
|---|
| 7 | EE | Joe Sawada:
Generating Bracelets in Constant Amortized Time.
SIAM J. Comput. 31(1): 259-268 (2001) |
| 6 | EE | Frank Ruskey,
C. Robert Miers,
Joe Sawada:
The Number of Irreducible Polynomials and Lyndon Words with Given Trace.
SIAM J. Discrete Math. 14(2): 240-245 (2001) |
| 2000 |
|---|
| 5 | EE | Frank Ruskey,
Joe Sawada:
Generating Necklaces and Strings with Forbidden Substrings.
COCOON 2000: 330-339 |
| 4 | EE | Frank Ruskey,
Joe Sawada:
A fast algorithm to generate unlabeled necklaces.
SODA 2000: 256-262 |
| 3 | | Kevin Cattell,
Frank Ruskey,
Joe Sawada,
Micaela Serra,
C. Robert Miers:
Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2).
J. Algorithms 37(2): 267-282 (2000) |
| 1999 |
|---|
| 2 | EE | Joe Sawada,
Frank Ruskey:
An Efficient Algorithm for Generating Necklaces with Fixed Density.
SODA 1999: 752-758 |
| 1 | | Frank Ruskey,
Joe Sawada:
An Efficient Algorithm for Generating Necklaces with Fixed Density.
SIAM J. Comput. 29(2): 671-684 (1999) |
