Sawada, Joe - Department of Computing and Information Science, University of Guelph

Advanced Search

Sawada, Joe - Department of Computing and Information Science, University of Guelph

BINARY BUBBLE LANGUAGES AND COOL-LEX ORDER FRANK RUSKEY, JOE SAWADA, AND AARON WILLIAMS
Magic Labelings on Cycles and Wheels Andrew Baker and Joe Sawada
THE NUMBER OF IRREDUCIBLE POLYNOMIALS AND LYNDON WORDS WITH GIVEN TRACE
A fast algorithm to generate Beckett-Gray codes Extended Abstract
A note on k-colorability of P5-free graphs Chinh T. Ho`ang
Z .Journal of Algorithms 37, 267 282 2000 doi:10.1006rjagm.2000.1108, available online at http:rrwww.idealibrary.com on
A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
GENERATING BRACELETS IN CONSTANT AMORTIZED TIME SIAM J. COMPUT. c 2001 Society for Industrial and Applied Mathematics
Efficient Oracles for Generating Binary Bubble Languages A. Williams
De Bruijn Sequences for the Binary Strings with Maximum Density
Theoretical Computer Science 301 (2003) 477489 www.elsevier.com/locate/tcs
Journal of Algorithms 46 (2003) 2126 www.elsevier.com/locate/jalgor
AN EFFICIENT ALGORITHM FOR GENERATING NECKLACES WITH FIXED DENSITY
SIAM J. DISCRETE MATH. c 2007 Society for Industrial and Applied Mathematics Vol. 21, No. 1, pp. 1625
A Gray code for binary subtraction Joe Sawada 1
A Fast Algorithm To Generate Open Meandric Systems and Meanders
Finding and listing induced paths1 Chinh T. Ho`ang
Deciding k-colorability of P5-free graphs in polynomial time Chinh T. Ho`ang
LaTex -What is it and What is it Good For Joe Sawada -University of Guelph
A FAST ALGORITHM FOR GENERATING NONISOMORPHIC CHORD DIAGRAMS
Generalized Snakes and Coils in the Box CHI-HIM WONG
Stamp Foldings, Semi-meanders, and Open Meanders: Fast Generation By considering a permutation representation for stamp-foldings and semi-meanders we construct tree-
Information Processing Letters 86 (2003) 299302 www.elsevier.com/locate/ipl
ARTICLE IN PRESS Theoretical Computer Science ( )
Theoretical Computer Science 301 (2003) 321340 www.elsevier.com/locate/tcs
Bent Hamilton Cycles in d-Dimensional Grid Graphs Department of Computer Science
Presentation Tips Joe Sawada -University of Guelph
A certifying algorithm for 3-colorability of P5-free Daniel Bruce Chinh T. Ho`ang Joe Sawada