dblp.uni-trier.dewww.uni-trier.de

Bill Sands Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1Dwight Duffus [5] [6] [8] [11]
2Ulrich Faigle [3]
3John Ginsburg [4] [9] [10] [12]
4V. Linek [7]
5Norbert Sauer (Norbert W. Sauer) [2] [6]
6Douglas B. West [4]
7Peter Winkler (Peter M. Winkler) [5]
8Robert E. Woodrow [2] [6]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)