Search the dblp DataBase

Publications of Author

1. John Ginsburg, Bill Sands
   An optimal algorithm for a parallel cutting problem. [Citation Graph (0, 0)][DBLP]
   Ars Comb., 2000, v:57, n:, pp:- [Journal]
   
2. John Ginsburg, Bill Sands
   On the number of elements dominated by a subgroup. [Citation Graph (0, 0)][DBLP]
   Ars Comb., 2005, v:74, n:, pp:- [Journal]
   
3. V. Linek, Bill Sands
   A note on paths in edge-coloured tournaments. [Citation Graph (0, 0)][DBLP]
   Ars Comb., 1996, v:44, n:, pp:- [Journal]
   
4. Ulrich Faigle, Bill Sands
   A size-width inequality for distributive lattices. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1986, v:6, n:1, pp:29-33 [Journal]
   
5. Dwight Duffus, Bill Sands, Norbert Sauer, Robert E. Woodrow
   Two-colouring all two-element maximal antichains. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. A, 1991, v:57, n:1, pp:109-116 [Journal]
   
6. John Ginsburg, Bill Sands, Douglas B. West
   A length-width inequality for partially ordered sets with two-element cutsets. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1989, v:46, n:2, pp:232-239 [Journal]
   
7. Bill Sands, Norbert Sauer, Robert E. Woodrow
   On monochromatic paths in edge-coloured digraphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1982, v:33, n:3, pp:271-275 [Journal]
   
8. Dwight Duffus, Bill Sands, Peter Winkler
   Maximal Chains and Antichains in Boolean Lattices. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1990, v:3, n:2, pp:197-205 [Journal]
   
9. John Ginsburg, Bill Sands
   Completely Disconnecting the Complete Graph. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2000, v:13, n:1, pp:33-47 [Journal]
   
10. Bill Sands
    Counting antichains in finite partially ordered sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:213-228 [Journal]
    
11. Dwight Duffus, Bill Sands
    An inequality for the sizes of prime filters of finite distributive lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:201, n:1-3, pp:89-99 [Journal]
    
12. 
    Splitting Numbers of Grids. [Citation Graph (, )][DBLP]
    
    
13. 
    On the size of maximal chains and the number of pairwise disjoint maximal antichains. [Citation Graph (, )][DBLP]