#### Filter Results:

- Full text PDF available (27)

#### Publication Year

1947

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Timothy Y. Chow, Fabián A. Chudak, Anthony M. Ffrench
- IEEE/ACM Transactions on Networking
- 2004

Conventional optical networks are based on SONET rings, but since rings are known to use bandwidth inefficiently, there has been much research into shared mesh protection, which promises significant… (More)

- Timothy Y. Chow, Philip J. Lin
- Networks
- 2004

The problem of minimizing the number of bidirectional SONET rings required to support a given traffic demand has been studied by several researchers. Here we study the related problem of minimizing… (More)

- Timothy Y. Chow
- 1998

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in… (More)

- Timothy Y. Chow
- 1997

Stanley has studied a symmetric function generalization XG of the chromatic polynomial of a graph G. The innocent-looking Stanley-Stembridge Poset Chain Conjecture states that the expansion of XG in… (More)

- Timothy Y. Chow
- 1997

A set S of positive integers is avoidable if there exists a partition of the positive integers into two disjoint sets such that no two distinct integers from the same set sum to an element of S. Much… (More)

- Timothy Y. Chow
- 1996

Recently, Stanley [21] has defined a symmetric function generalization of the chromatic polynomial of a graph. Independently, Chung and Graham [4] have defined a digraph polynomial called the cover… (More)

- Robin J. Chapman, Timothy Y. Chow, Amit Khetan, David Petrie Moulton, Robert J. Waters
- J. Comb. Theory, Ser. A
- 2009

Article history: Received 19 May 2007 Available online 10 June 2008

- Timothy Y. Chow
- Discrete Mathematics
- 2003

We give an independent set axiomatization of symplectic matroids, a large and important class of Coxeter matroids. As an application, we construct a new class of examples of symplectic matroids from… (More)

Say that μ is a “subpartition” of an integer partition λ if the multiset of parts of μ is a submultiset of the parts of λ, and define an integer partition λ to be “wide” if for every subpartition μ… (More)

- Timothy Y. Chow
- 1997

We investigate an apparent hodgepodge of topics: a Robinson-Schensted algorithm for (3+ 1)-free posets, Chung and Graham’s G-descent expansion of the chromatic polynomial, a quasi-symmetric expansion… (More)