Combinatorial proofs of identities of Calkin and HirschhornHONG FENG; ZHIZHENG ZHANG.Discrete mathematics. 2004, Vol 277, Num 1-3, pp 287-294, issn 0012-365X, 8 p.Article

Unification in free distributive latticesGERHARD, J. A; PETRICH, M.Theoretical computer science. 1994, Vol 126, Num 2, pp 237-257, issn 0304-3975Article

On some properties of base-matroidsMAFFIOLI, F; ZAGAGLIA SALVI, N.Discrete applied mathematics. 2006, Vol 154, Num 9, pp 1401-1407, issn 0166-218X, 7 p.Conference Paper

The Erdös-Ko-Rado bound for the function latticeBEY, C.Discrete applied mathematics. 1999, Vol 95, Num 1-3, pp 115-125, issn 0166-218XConference Paper

Partitioning Boolean lattices into antichainsELZOBI, Muktar; LONC, Zbigniew.Discrete mathematics. 2003, Vol 260, Num 1-3, pp 45-55, issn 0012-365X, 11 p.Article

On the orthogonal product of simplices and direct products of truncated Boolean latticesLECK, Uwe.Discrete mathematics. 2003, Vol 273, Num 1-3, pp 163-172, issn 0012-365X, 10 p.Conference Paper

The determinants of certain matrices arising from the Boolean latticeHARA, Masao; WATANABE, Junzo.Discrete mathematics. 2008, Vol 308, Num 23, pp 5815-5822, issn 0012-365X, 8 p.Article

Cover-preserving order embeddings into Boolean latticesWILD, M.Order (Dordrecht). 1992, Vol 9, Num 3, pp 209-232, issn 0167-8094Article

Pattern avoidance in compositions and multiset permutationsSAVAGE, Carla D; WILF, Herbert S.Advances in applied mathematics (Print). 2006, Vol 36, Num 2, pp 194-201, issn 0196-8858, 8 p.Article

Efficient data retrieval and manipulation using Boolean entity latticeYANG, A; CHEN, P. P.Data & knowledge engineering. 1996, Vol 20, Num 2, pp 211-226, issn 0169-023XArticle

The linear extension diameter of a posetFELSNER, S; REUTER, K.SIAM journal on discrete mathematics (Print). 1999, Vol 12, Num 3, pp 360-373, issn 0895-4801Article

An update on the middle levels problemSHIELDS, Ian; SHIELDS, Brendan J; SAVAGE, Carla D et al.Discrete mathematics. 2009, Vol 309, Num 17, pp 5271-5277, issn 0012-365X, 7 p.Conference Paper

An exact algorithm for optimal MAE stack filter designDELLAMONICA, Domingos; SILVA, Paulo J. S; HUMES, Carlos et al.IEEE transactions on image processing. 2007, Vol 16, Num 2, pp 453-462, issn 1057-7149, 10 p.Article

Packing and covering k-chain free subsets in Boolean latticesJIA SHEN.Discrete mathematics. 2009, Vol 309, Num 13, pp 4628-4634, issn 0012-365X, 7 p.Article

On the existence of symmetric chain decompositions in a quotient of the Boolean latticeZONGLIANG JIANG; SAVAGE, Carla D.Discrete mathematics. 2009, Vol 309, Num 17, pp 5278-5283, issn 0012-365X, 6 p.Conference Paper

U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problemRIS, Marcelo; BARRERA, Junior; MARTINS, David C et al.Pattern recognition. 2010, Vol 43, Num 3, pp 557-568, issn 0031-3203, 12 p.Article

Reducibility numberKHARAT, V. S; WAPHARE, B. N; THAKARE, N. K et al.Discrete applied mathematics. 2007, Vol 155, Num 16, pp 2069-2076, issn 0166-218X, 8 p.Article