Douglas G. Rogers

According to our database, Douglas G. Rogers authored at least 30 papers between 1977 and 2001.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2001

Helge Tverberg A celebration of a life in mathematics.

Douglas G. Rogers

Discret. Math., 2001

1999

Preface.

Ira M. Gessel, Louis W. Shapiro, Douglas G. Rogers

Discret. Math., 1999

Underdiagonal Lattice Paths with Unrestricted Steps.

Donatella Merlini, Douglas G. Rogers, Renzo Sprugnoli, M. Cecilia Verri

Discret. Appl. Math., 1999

1998

Regular Perfect Systems of Sets of Iterated Differences.

G. M. Hamilton, Ian T. Roberts, Douglas G. Rogers

Eur. J. Comb., 1998

1997

The problem of irregular perfect systems of sets of iterated differences.

Colin Ramsay, Douglas G. Rogers

Graphs Comb., 1997

1996

Uniform perfect systems of sets of iterated differences of size 4¹.

G. M. Hamilton, Colin Ramsay, Ian T. Roberts, Douglas G. Rogers

Discret. Math., 1996

1995

Thin Hamiltonian cycles on Archimedean graphs.

John R. Reay, Douglas G. Rogers

Eur. J. Comb., 1995

1994

A Matrix Method for Counting Hamiltonian Cycles on Grid Graphs.

Y. H. Harris Kwong, Douglas G. Rogers

Eur. J. Comb., 1994

On critical perfect systems of difference sets.

Douglas G. Rogers

Discret. Math., 1994

1993

Improved Bounds for Perfect Systems of Difference Sets.

Douglas G. Rogers

J. Comb. Theory A, 1993

On the BKT inequality and improved bounds for perfect systems of difference sets.

Douglas G. Rogers

Graphs Comb., 1993

Balanced Magic Rectangles.

Thomas Bier, Douglas G. Rogers

Eur. J. Comb., 1993

1992

Further results on irregular, critical perfect systems of difference sets II: systems without splits.

Takanori Hayasaka, Sadao Saito, Douglas G. Rogers

Discret. Math., 1992

Further results on irregular, critical perfect systems of difference sets I: split systems.

G. M. Hamilton, Douglas G. Rogers

Discret. Math., 1992

1991

On the General Erdös Conjecture for Perfect Systems of Difference Sets and Embedding Partial Complete Permutations.

Douglas G. Rogers

Eur. J. Comb., 1991

1990

A Functional Equation (David W. Wilson).

Douglas G. Rogers, Peter B. Borwein

SIAM Rev., 1990

Binary set functions and parity check matrices.

William Edwin Clark, Larry A. Dunning, Douglas G. Rogers

Discret. Math., 1990

1989

The construction of some bit and byte error control codes using partial Steiner systems.

William Edwin Clark, Larry A. Dunning, Douglas G. Rogers

IEEE Trans. Inf. Theory, 1989

1988

Irregular, extremal perfect systems of difference sets II.

Douglas G. Rogers

Graphs Comb., 1988

An arithmetic of complete permutations with constraints, I: an exposition of the general theory.

Douglas G. Rogers

Discret. Math., 1988

An arithmetic of complete permutations with constraints, II: case studies.

D. J. Crampin, Douglas G. Rogers

Discret. Math., 1988

1986

Compatible additive permutations of finite integral bases.

Peter D. Johnson Jr., Douglas G. Rogers

Graphs Comb., 1986

1981

Eplett's identity for renewal arrays.

Douglas G. Rogers

Discret. Math., 1981

Rhyming schemes: Crossings and coverings.

Douglas G. Rogers

Discret. Math., 1981

1980

Products of graceful trees.

Khee Meng Koh, Douglas G. Rogers, T. Tan

Discret. Math., 1980

1979

The enumeration of some restricted matrices.

Douglas G. Rogers

Discret. Math., 1979

Two theorems on graceful trees.

Khee Meng Koh, T. Tan, Douglas G. Rogers

Discret. Math., 1979

1978

Pascal triangles, Catalan numbers and renewal arrays.

Douglas G. Rogers

Discret. Math., 1978

Ascending sequences in permutations.

Douglas G. Rogers

Discret. Math., 1978

1977

Similarity Relations on Finite Ordered Sets.

Douglas G. Rogers

J. Comb. Theory A, 1977