#### Filter Results:

- Full text PDF available (27)

#### Publication Year

1997

2019

- This year (6)
- Last 5 years (22)
- Last 10 years (44)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu
- Algorithmica
- 2007

The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show that for every fixed… (More)

- Joe Sawada
- SIAM J. Comput.
- 2001

A bracelet is the lexicographically smallest element in an equivalence class of strings under string rotation and reversal. We present a fast, simple, recursive algorithm for generating (i.e.,… (More)

- Kevin Cattell, Frank Ruskey, Joe Sawada, Micaela Serra, C. Robert Miers
- J. Algorithms
- 2000

Many applications call for exhaustive lists of strings subject to various constraints, such as inequivalence under group actions. A k-ary necklace is an Ž . equivalence class of k-ary strings under… (More)

- Frank Ruskey, Joe Sawada
- SODA
- 1999

A k-ary necklace is an equivalence class of t-ary strings under rotation. A necklace of fixed density is a necklace where the number of zeroes is fixed. We present a fast, simple, recursive algorithm… (More)

- Frank Ruskey, Joe Sawada, Aaron Williams
- J. Comb. Theory, Ser. A
- 2012

A bubble language is a set of binary strings with a simple closure property: The first 01 of any string can be replaced by 10 to obtain another string in the set. Natural representations of many… (More)

- Frank Ruskey, Joe Sawada, Aaron Williams
- SIAM J. Discrete Math.
- 2012

De Bruijn sequences are circular strings of length 2n whose length n substrings are the binary strings of length n. Our focus is on creating circular strings of length (

- Joe Sawada, Aaron Williams
- Electr. J. Comb.
- 2012

Given a string α = 10γ in a binary language L, the bubble lower bound is the smallest non-negative integer j such that 1s−10t−j10jγ ∈ L. We present an efficient oracle, which is a function that… (More)

- Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
- Theor. Comput. Sci.
- 2017

A 1-prefix normal word is a binary word with the property that no factor has more 1s than the prefix of the same length; a 0-prefix normal word is defined analogously. These words arise in the… (More)

- Joe Sawada, Brett Stevens, Aaron Williams
- WALCOM
- 2011

A de Bruijn sequence is a circular binary string of length 2n that contains each binary string of length n exactly once as a substring. A maximum-density de Bruijn sequence is a circular binary… (More)

- Joe Sawada, Aaron Williams
- SODA
- 2018

Nijenhuis and Wilf asked the following question in their Combinatorial Algorithms textbook from 1975: Can the permutations of {1, 2,..., n } be ordered so that each permutation is transformed into… (More)