John Ginsburg

According to our database, John Ginsburg authored at least 9 papers between 1986 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2010

Linked reduction systems for permutations.

John Ginsburg

Ars Comb., 2010

2007

Determining a permutation from its set of reductions.

John Ginsburg

Ars Comb., 2007

2005

On the number of elements dominated by a subgroup.

John Ginsburg, Bill Sands

Ars Comb., 2005

2001

A space-filling complete graph.

John Ginsburg, V. Linek

Ars Comb., 2001

2000

Completely Disconnecting the Complete Graph.

John Ginsburg, Bill Sands

SIAM J. Discret. Math., 2000

An optimal algorithm for a parallel cutting problem.

John Ginsburg, Bill Sands

Ars Comb., 2000

1997

A coloring problem on chordal rings.

John Ginsburg

Ars Comb., 1997

1989

A length-width inequality for partially ordered sets with two-element cutsets.

John Ginsburg, Bill Sands, Douglas B. West

J. Comb. Theory B, 1989

1986

Extensions of ordered sets having the finite cutset property.

John Ginsburg

Discret. Math., 1986