default search action
Bill Sands
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [j20]Thao Dô, Bill Sands:
Chop vectors and the lattice of integer partitions. Discret. Math. 312(6): 1195-1200 (2012) - 2011
- [j19]Bill Sands:
Cards, permutations, and sums. Contributions Discret. Math. 6(2) (2011) - 2010
- [j18]Dwight Duffus, Bill Sands:
On the size of maximal chains and the number of pairwise disjoint maximal antichains. Discret. Math. 310(21): 2883-2889 (2010) - [j17]Bill Sands:
Posets with the Maximal Antichain Property. Order 27(1): 1-8 (2010) - [j16]Bill Sands, Jia Shen:
When Will Every Maximal F-free Subposet Contain a Maximal Element? Order 27(1): 23-40 (2010)
2000 – 2009
- 2005
- [j15]John Ginsburg, Bill Sands:
On the number of elements dominated by a subgroup. Ars Comb. 74 (2005) - [j14]Dwight Duffus, Bill Sands:
Splitting Numbers of Grids. Electron. J. Comb. 12 (2005) - 2000
- [j13]John Ginsburg, Bill Sands:
An optimal algorithm for a parallel cutting problem. Ars Comb. 57 (2000) - [j12]John Ginsburg, Bill Sands:
Completely Disconnecting the Complete Graph. SIAM J. Discret. Math. 13(1): 33-47 (2000)
1990 – 1999
- 1999
- [j11]Dwight Duffus, Bill Sands:
An inequality for the sizes of prime filters of finite distributive lattices. Discret. Math. 201(1-3): 89-99 (1999) - 1996
- [j10]V. Linek, Bill Sands:
A note on paths in edge-coloured tournaments. Ars Comb. 44 (1996) - 1993
- [j9]Bill Sands:
A Maximum Volume. SIAM Rev. 35(2): 298 (1993) - 1991
- [j8]Dwight Duffus, Bill Sands, Norbert Sauer, Robert E. Woodrow:
Two-colouring all two-element maximal antichains. J. Comb. Theory A 57(1): 109-116 (1991) - 1990
- [j7]Dwight Duffus, Bill Sands, Peter Winkler:
Maximal Chains and Antichains in Boolean Lattices. SIAM J. Discret. Math. 3(2): 197-205 (1990)
1980 – 1989
- 1989
- [j6]John Ginsburg, Bill Sands, Douglas B. West:
A length-width inequality for partially ordered sets with two-element cutsets. J. Comb. Theory B 46(2): 232-239 (1989) - 1986
- [j5]Ulrich Faigle, Bill Sands:
A size-width inequality for distributive lattices. Comb. 6(1): 29-33 (1986) - 1985
- [j4]Dwight Duffus, Bill Sands, Robert E. Woodrow:
On the chromatic number of the product of graphs. J. Graph Theory 9(4): 487-495 (1985) - 1982
- [j3]Bill Sands, Norbert Sauer, Robert E. Woodrow:
On monochromatic paths in edge-coloured digraphs. J. Comb. Theory B 33(3): 271-275 (1982) - 1981
- [j2]Bill Sands:
Counting antichains in finite partially ordered sets. Discret. Math. 35(1-3): 213-228 (1981) - 1980
- [j1]Bill Sands:
Generating sets for lattices of dimension two. Discret. Math. 29(3): 287-292 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: