Compact routing with minimum stretchCOWEN, Lenore J.Journal of algorithms (Print). 2001, Vol 38, Num 1, pp 170-183, issn 0196-6774Conference Paper

Kleitman and combinatorics: a celebrationCOWEN, Lenore J; GRIGGS, Jerrold R; WEST, Douglas B et al.Discrete mathematics. 2002, Vol 257, Num 2-3, issn 0012-365X, 440 p.Serial Issue

SMURFLite: combining simplified Markov random fields with simulated evolution improves remote homology detection for beta-structural proteins into the twilight zoneDANIELS, Noah M; HOSUR, Raghavendra; BERGER, Bonnie et al.Bioinformatics (Oxford. Print). 2012, Vol 28, Num 9, pp 1216-1222, issn 1367-4803, 7 p.Article

Covering a hypergraph of subgraphsALON, Noga.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 249-254, issn 0012-365X, 6 p.Article

A chip-firing game and Dirichlet eigenvaluesCHUNG, Fan; ELLIS, Robert B.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 341-355, issn 0012-365X, 15 p.Article

Sperner theory in a difference of Boolean latticesLOGAN, Mark J.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 501-512, issn 0012-365X, 12 p.Article

On restricted edge-colorings of bicliquesMUBAYI, Dhruv; WEST, Douglas B.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 513-529, issn 0012-365X, 17 p.Article

A random stacking processSCHULMAN, Leonard J.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 541-547, issn 0012-365X, 7 p.Article

Kleitman and combinatorics: A celebrationPECK, G. W.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 193-224, issn 0012-365X, 32 p.Article

Kleitman and combinatoricsSAKS, Michael.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 225-247, issn 0012-365X, 23 p.Article

Polyunsaturated posets and graphs and the Greene-Kleitman theoremCHAPPELL, Glenn G.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 329-340, issn 0012-365X, 12 p.Article

4-connected maximal planar graphs are 4-orderedGODDARD, Wayne.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 405-410, issn 0012-365X, 6 p.Article

Error-correcting codes from graphsTONCHEV, Vladimir D.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 549-557, issn 0012-365X, 9 p.Article

Normalized matching property of the subgroup lattice of an abelian p-groupJUN WANG.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 559-574, issn 0012-365X, 16 p.Article

The patterns of permutationsWILF, Herbert S.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 575-583, issn 0012-365X, 9 p.Article

Graphs induced by Gray codesWILMER, Elizabeth L; ERNST, Michael D.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 585-598, issn 0012-365X, 14 p.Article

On partitions of discrete boxesALON, Noga; BOHMAN, Tom; HOLZMAN, Ron et al.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 255-258, issn 0012-365X, 4 p.Article

On the average size of sets in intersecting Sperner familiesBEY, Christian; ENGEL, Konrad; KATONA, Gyula O. H et al.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 259-266, issn 0012-365X, 8 p.Article

On the maximum size of (p, Q)-free familiesFÜREDI, Zoltan; GYARFAS, Andras; RUSZINKO, Miklos et al.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 385-403, issn 0012-365X, 19 p.Article

Counting dyadic equipartitions of the unit squareLAGARIAS, Jeffrey C; SPENCER, Joel H; VINSON, Jade P et al.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 481-499, issn 0012-365X, 19 p.Article

A combinatorial approach to correlation inequalitiesBRIGHTWELL, Graham R; TROTTER, William T.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 311-327, issn 0012-365X, 17 p.Article

On connectivity of consecutive-d digraphsDU, Ding-Zhu; HSU, D. F; NGO, Hung Q et al.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 371-384, issn 0012-365X, 14 p.Article

A finite basis characterization of α-split coloringsGYARFAS, Andras; KEZDY, André E; LEHEL, Jenö et al.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 415-421, issn 0012-365X, 7 p.Article