Øystein J. Rødseth

According to our database, Øystein J. Rødseth authored at least 8 papers between 1996 and 2009.

Collaborative distances:

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

2009

Enumeration of the degree sequences of non-separable graphs and connected graphs.

Øystein J. Rødseth, James A. Sellers, Helge Tverberg

Eur. J. Comb., 2009

Congruences modulo high powers of 2 for Sloane's box stacking function.

Øystein J. Rødseth, James A. Sellers

Australas. J Comb., 2009

2006

Improving calculations of the number of distinct alignments of two strings.

Øystein J. Rødseth, James A. Sellers

J. Quant. Linguistics, 2006

Sloane's box stacking problem.

Øystein J. Rødseth

Discret. Math., 2006

Enumeration of M-partitions.

Øystein J. Rødseth

Discret. Math., 2006

2002

Binary Partitions Revisited.

Øystein J. Rødseth, James A. Sellers

J. Comb. Theory A, 2002

2001

On the primality of 2<i>h</i>*3ⁿ+1.

Christoph Kirfel, Øystein J. Rødseth

Discret. Math., 2001

1996

Weighted multi-connected loop networks.

Øystein J. Rødseth

Discret. Math., 1996