Joe Sawada

2009
23	EE	Yue Li, Joe Sawada: Gray codes for reflectable languages. Inf. Process. Lett. 109(5): 296-300 (2009)
2008
22	EE	Andrew Baker, Joe Sawada: Magic Labelings on Cycles and Wheels. COCOA 2008: 361-373
21	EE	Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu: A Note on k-Colorability of P5-Free Graphs. MFCS 2008: 387-394
2007
20	EE	Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu: Deciding k-colourability of P_5-free graphs in polynomial time CoRR abs/cs/0702043: (2007)
19	EE	Joe Sawada, Dennis Chi-Him Wong: A fast algorithm to generate Beckett-Gray codes: Extended Abstract. Electronic Notes in Discrete Mathematics 29: 571-577 (2007)
2006
18	EE	Joe Sawada: Generating rooted and free plane trees. ACM Transactions on Algorithms 2(1): 1-13 (2006)
17	EE	Chính T. Hoàng, Joe Sawada, Xiao Shu: k-Colorability of P5-free graphs CoRR abs/cs/0609083: (2006)
2005
16	EE	Gurmeet Singh Manku, Joe Sawada: A Loopless Gray Code for Minimal Signed-Binary Representations. ESA 2005: 438-447
15	EE	Joe Sawada: A Gray code for binary subtraction. Electronic Notes in Discrete Mathematics 19: 125-131 (2005)
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)

Coauthor Index

1	Andrew Baker	[22]
2	Kevin Cattell	[3]
3	L. Sunil Chandran	[9]
4	John A. Ellis	[11]
5	Chính T. Hoàng	[17] [20] [21]
6	Louis Ibarra	[9]
7	Marcin Kaminski	[20] [21]
8	Yue Li	[23]
9	Vadim V. Lozin	[20] [21]
10	Gurmeet Singh Manku	[16]
11	C. Robert Miers	[3] [6]
12	Frank Ruskey	[1] [2] [3] [4] [5] [6] [9] [11] [12] [14]
13	Micaela Serra	[3]
14	Xiao Shu	[17] [20] [21]
15	Jamie Simpson	[11]
16	Jeremy Spinrad	[13]
17	Dennis Chi-Him Wong	[19]

Colors in the list of coauthors