| |
| 2007 | ||
|---|---|---|
| 8 | John Ginsburg: Determining a permutation from its set of reductions. Ars Comb. 82: (2007) | |
| 2005 | ||
| 7 | John Ginsburg, Bill Sands: On the number of elements dominated by a subgroup. Ars Comb. 74: (2005) | |
| 2001 | ||
| 6 | John Ginsburg, V. Linek: A space-filling complete graph. Ars Comb. 58: (2001) | |
| 2000 | ||
| 5 | John Ginsburg, Bill Sands: An optimal algorithm for a parallel cutting problem. Ars Comb. 57: (2000) | |
| 4 | EE | John Ginsburg, Bill Sands: Completely Disconnecting the Complete Graph. SIAM J. Discrete Math. 13(1): 33-47 (2000) |
| 1997 | ||
| 3 | John Ginsburg: A coloring problem on chordal rings. Ars Comb. 45: (1997) | |
| 1989 | ||
| 2 | EE | John Ginsburg, Bill Sands, Douglas B. West: A length-width inequality for partially ordered sets with two-element cutsets. J. Comb. Theory, Ser. B 46(2): 232-239 (1989) |
| 1986 | ||
| 1 | EE | John Ginsburg: Extensions of ordered sets having the finite cutset property. Discrete Mathematics 58(2): 143-157 (1986) |
| 1 | V. Linek | [6] |
| 2 | Bill Sands | [2] [4] [5] [7] |
| 3 | Douglas B. West | [2] |