Optimal Design of Offshore Natural-Gas Pipeline Systems. - B. Rothfarb; H. Frank; D. M. Rosenbaum; Kenneth Steiglitz; Daniel J. Kleitman (Oper. Res., 1970)

Some positive definite functions on sets and their application to the Ising model. - Ole J. Heilmann; Daniel J. Kleitman; Elliott H. Lieb; Seymour Sherman (Discret. Math., 1971)

Maximal sized antichains in partial orders. - Daniel J. Kleitman; M. Edelberg; David Lubell (Discret. Math., 1971)

An algorithm for certain multi-commodity flow problems. - Daniel J. Kleitman (Networks, 1971)

A generalization of Kaplansky's game. - Daniel J. Kleitman; B. L. Rothschild (Discret. Math., 1972)

On the average size of the sets in a Sperner family. - Daniel J. Kleitman; E. C. Milner (Discret. Math., 1973)

Families of k-independent sets. - Daniel J. Kleitman; Joel H. Spencer (Discret. Math., 1973)

Algorithms for constructing graphs and digraphs with given valences and factors. - Daniel J. Kleitman; D. L. Wang (Discret. Math., 1973)

Cost allocation for a spanning tree. - Armin Claus; Daniel J. Kleitman (Networks, 1973)

On the existence of N-connected graphs with prescribed degrees (n ≧ 2). - D. L. Wang; Daniel J. Kleitman (Networks, 1973)

On the Number of Latent Subsets of Intersecting Collections. - Daniel J. Kleitman; Thomas L. Magnanti (J. Comb. Theory A, 1974)

Cost allocation in networks: The bulk supplier problem. - Armin Claus; Daniel J. Kleitman (Networks, 1974)

A Note on Perfect Elimination Digraphs. - Daniel J. Kleitman (SIAM J. Comput., 1974)

An Optimal Bound for Two Dimensional Bin Packing - Daniel J. Kleitman; Michael M. Krieger (FOCS, 1975)

Automorphisms of lexicographic products. - Elliot Bird; Curtis Greene; Daniel J. Kleitman (Discret. Math., 1975)

More on complementary trees. - Daniel J. Kleitman (Discret. Math., 1976)

The Structure of Sperner k-Families. - Curtis Greene; Daniel J. Kleitman (J. Comb. Theory A, 1976)

Strong Versions of Sperner's Theorem. - Curtis Greene; Daniel J. Kleitman (J. Comb. Theory A, 1976)

Some New Results on the Littlewood-Offord Problem. - Daniel J. Kleitman (J. Comb. Theory A, 1976)

Extremal Properties of Collections of Subsets Containing No Two Sets and Their Union. - Daniel J. Kleitman (J. Comb. Theory A, 1976)

A note on the parity of the number of crossings of a graph. - Daniel J. Kleitman (J. Comb. Theory B, 1976)

A Lower Bound on the Length of a Sequence Containing All Permutations as Subsequences. - Daniel J. Kleitman; David Joseph Kwiatkowski (J. Comb. Theory A, 1976)

A three part Sperner theorem. - Jerrold R. Griggs; Daniel J. Kleitman (Discret. Math., 1977)

Coping with Errors in Binary Search Procedures (Preliminary Report) - Ronald L. Rivest; Albert R. Meyer; Daniel J. Kleitman; Karl Winklmann; Joel Spencer (STOC, 1978)

Matrix Tree Theorems. - S. Chaiken; Daniel J. Kleitman (J. Comb. Theory A, 1978)

Skew chain orders and sets of rectangles. - Douglas B. West; Daniel J. Kleitman (Discret. Math., 1979)

The Number of Meets between Two Subsets of a Lattice. - David E. Daykin; Daniel J. Kleitman; Douglas B. West (J. Comb. Theory A, 1979)

Helly-type theorems about sets. - Steve Fisk; Daniel Abbw-Jackson; Daniel J. Kleitman (Discret. Math., 1980)

Further gossip problems. - Daniel J. Kleitman; James B. Shearer (Discret. Math., 1980)

Coping with Errors in Binary Search Procedures. - Ronald L. Rivest; Albert R. Meyer; Daniel J. Kleitman; Karl Winklmann; Joel Spencer (J. Comput. Syst. Sci., 1980)

Further results on the Aanderaa-Rosenberg conjecture. - Daniel J. Kleitman; David Joseph Kwiatkowski (J. Comb. Theory B, 1980)

Ensembles and Largest Sojourns of Random Walks. - Daniel J. Kleitman; Kenneth J. Winston (SIAM J. Algebraic Discret. Methods, 1980)

New Layouts for the Shuffle-Exchange Graph (Extended Abstract) - Daniel J. Kleitman; Frank Thomson Leighton; Margaret Lepley; Gary L. Miller (STOC, 1981)

Intersections of k-element sets. - Daniel J. Kleitman; James B. Shearer; Dean Sturtevant (Comb., 1981)

Forests and score vectors. - Daniel J. Kleitman; Kenneth J. Winston (Comb., 1981)

On cross-bandwidth. - Jeff Kahn 001; Daniel J. Kleitman (Discret. Math., 1981)

Inherent Complexity Trade-Offs for Range Query Problems. - Walter A. Burkhard; Michael L. Fredman; Daniel J. Kleitman (Theor. Comput. Sci., 1981)

On the number of graphs without 4-cycles. - Daniel J. Kleitman; Kenneth J. Winston (Discret. Math., 1982)

The number of rounds needed to exchange information within a graph. - Susan F. Assmann; Daniel J. Kleitman (Discret. Appl. Math., 1983)

An algorithm for collapsing sign alternating sequences of real numbers. - Daniel J. Kleitman; Robert A. Lew (Discret. Appl. Math., 1983)

An Asymptotically Optimal Layout for the Shuffle-Exchange Graph. - Daniel J. Kleitman; Frank Thomson Leighton; Margaret Lepley; Gary L. Miller (J. Comput. Syst. Sci., 1983)

On the Asymptotic Number of Tournament Score Sequences. - Kenneth J. Winston; Daniel J. Kleitman (J. Comb. Theory A, 1983)

An Algorithm for Constructing Regions with Rectangles: Independence and Minimum Generating Sets for Collections of Intervals - Deborah S. Franzblau; Daniel J. Kleitman (STOC, 1984)

Characterization of curve map graphs. - Susan F. Assmann; Daniel J. Kleitman (Discret. Appl. Math., 1984)

On a Dual Version of the One-Dimensional Bin Packing Problem. - Susan F. Assmann; David S. Johnson 001; Daniel J. Kleitman; Joseph Y.-T. Leung (J. Algorithms, 1984)

An Algorithm for Covering Polygons with Rectangles - Deborah S. Franzblau; Daniel J. Kleitman (Inf. Control., 1984)

Covering a Square by Small Perimeter Rectangles. - Noga Alon; Daniel J. Kleitman (Discret. Comput. Geom., 1986)

On a problem of Yuzvinsky on separating the n-cube. - Daniel J. Kleitman (Discret. Math., 1986)

Longest Chains in the Lattice of Integer Partitions ordered by Majorization. - Curtis Greene; Daniel J. Kleitman (Eur. J. Comb., 1986)

The smallets n-uniform hypergraph with positive discrepancy. - Noga Alon; Daniel J. Kleitman; Carl Pomerance; Michael E. Saks; Paul D. Seymour (Comb., 1987)

The number of linear extensions of subset ordering. - Jichang Sha; Daniel J. Kleitman (Discret. Math., 1987)

Subgraphs of large connectivity and chromatic number in graphs of large chromatic number. - Noga Alon; Daniel J. Kleitman; Carsten Thomassen; Michael E. Saks; Paul D. Seymour (J. Graph Theory, 1987)

Applying the Classification Theorem for Finite Simple Groups to Minimize Pin Count in Uniform Permutation Architectures. - Larry Finkelstein; Daniel J. Kleitman; Frank Thomson Leighton (AWOC, 1988)

Radius and diameter in Manhattan lattices. - Daniel J. Kleitman; Michael R. Fellows (Discret. Math., 1989)

A minimal cutset of the boolean lattice with almost all members. - Zoltán Füredi; Jerrold R. Griggs; Daniel J. Kleitman (Graphs Comb., 1989)

A Generalized Model for Understanding Evasiveness. - Alok Aggarwal; Don Coppersmith; Daniel J. Kleitman (Inf. Process. Lett., 1989)

Spanning trees with many leaves in cubic graphs. - Jerrold R. Griggs; Daniel J. Kleitman; Aditya Shastri (J. Graph Theory, 1989)

Pair Labeelings with Given Distance. - Zoltán Füredi; Jerrold R. Griggs; Daniel J. Kleitman (SIAM J. Discret. Math., 1989)

Divisors Without Unit-Congruent Ratios. - Daniel J. Kleitman (SIAM J. Discret. Math., 1989)

Diameter and Radius in the Manhattan Metric. - Ding-Zhu Du; Daniel J. Kleitman (Discret. Comput. Geom., 1990)

Sphere coverings of the hypercube with incomparable centers. - Zoltán Füredi; Jeff Kahn 001; Daniel J. Kleitman (Discret. Math., 1990)

Representations of families of triples over GF(2). - Zoltán Füredi; Jerrold R. Griggs; Ron Holzman; Daniel J. Kleitman (J. Comb. Theory A, 1990)

An Almost Linear Time Algorithm for Generalized Matrix Searching. - Maria M. Klawe; Daniel J. Kleitman (SIAM J. Discret. Math., 1990)

Computing the Bandwidth of Interval Graphs. - Daniel J. Kleitman; Rakesh Vohra (SIAM J. Discret. Math., 1990)

Crossing Families. - Boris Aronov; Paul Erdös; Wayne Goddard; Daniel J. Kleitman; Michael Klugerman; János Pach; Leonard J. Schulman (SCG, 1991)

Partitioning a Rectangle into Many Sub-rectangles so that a Line can Meet only a Few. - Daniel J. Kleitman (Planar Graphs, 1991)

Partitioning a power set into union-free classes. - Martin Aigner 001; Dwight Duffus; Daniel J. Kleitman (Discret. Math., 1991)

Set systems with no union of cardinality 0 modulom. - Noga Alon; Daniel J. Kleitman; Richard J. Lipton; Roy Meshulam; Michael O. Rabin; Joel H. Spencer (Graphs Comb., 1991)

Spanning Trees with Many Leaves. - Daniel J. Kleitman; Douglas B. West (SIAM J. Discret. Math., 1991)

On the Number of Databases and Closure Operations. - Gustav Burosch; János Demetrovics; Gyula O. H. Katona; Daniel J. Kleitman; Alexander A. Sapozhenko (Theor. Comput. Sci., 1991)

Piercing Convex Sets. - Noga Alon; Daniel J. Kleitman (SCG, 1992)

Sharpening the LYM inequality. - Péter L. Erdös; Peter Frankl; Daniel J. Kleitman; Michael E. Saks; László A. Székely (Comb., 1992)

Sign vectors and unit vectors. - Ron Holzman; Daniel J. Kleitman (Comb., 1992)

Point Selections and Weak e-Nets for Convex Hulls. - Noga Alon; Imre Bárány; Zoltán Füredi; Daniel J. Kleitman (Comb. Probab. Comput., 1992)

Partitioning a rectangle into small perimeter rectangles. - Noga Alon; Daniel J. Kleitman (Discret. Math., 1992)

On zero-trees. - Zoltán Füredi; Daniel J. Kleitman (J. Graph Theory, 1992)

Packing lines in a hypercube. - Alexander Felzenbaum; Ron Holzman; Daniel J. Kleitman (Discret. Math., 1993)

Minimally Distant Sets of Lattice Points. - Daniel J. Kleitman; Leonard J. Schulman (Eur. J. Comb., 1993)

A note on maximal triangle-free graphs. - Wayne Goddard; Daniel J. Kleitman (J. Graph Theory, 1993)

Modification of consecutive-d digraphs. - Ding-Zhu Du; D. Frank Hsu; Daniel J. Kleitman (Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994)

On the Design of Reliable Boolean Circuits that Contain Partially Unreliable Gates - Daniel J. Kleitman; Frank Thomson Leighton; Yuan Ma (FOCS, 1994)

The Prison Yard Problem. - Zoltán Füredi; Daniel J. Kleitman (Comb., 1994)

On the Maximum Number of Triangles in Wheel-Free Graphs. - Zoltán Füredi; Michel X. Goemans; Daniel J. Kleitman (Comb. Probab. Comput., 1994)

An upper bound for the Ramsey numbers r(K3, G). - Wayne Goddard; Daniel J. Kleitman (Discret. Math., 1994)

Independence and the Havel-Hakimi residue. - Jerrold R. Griggs; Daniel J. Kleitman (Discret. Math., 1994)

Even Cycles in Directed Graphs. - Fan R. K. Chung; Wayne Goddard; Daniel J. Kleitman (SIAM J. Discret. Math., 1994)

Asymptotic enumeration of full graphs. - Daniel J. Kleitman; Fernando R. Lasaga; Lenore J. Cowen (J. Graph Theory, 1995)

Forcing Disjoint Segments in the Plane. - Wayne Goddard; Meir Katchalski; Daniel J. Kleitman (Eur. J. Comb., 1996)

A purely combinatorial proof of the Hadwiger Debrunner (p, q) Conjecture. - Noga Alon; Daniel J. Kleitman (Electron. J. Comb., 1997)

Finding Convex Sets Among Points in the Plane. - Daniel J. Kleitman; Lior Pachter (Discret. Comput. Geom., 1998)

A dictionary based approach for gene annotation. - Lior Pachter; Serafim Batzoglou; Valentin I. Spitkovsky; William S. Beebee; Eric S. Lander; Bonnie Berger; Daniel J. Kleitman (RECOMB, 1999)

A Dictionary-Based Approach for Gene Annotation. - Lior Pachter; Serafim Batzoglou; Valentin I. Spitkovsky; Eric Banks; Eric S. Lander; Daniel J. Kleitman; Bonnie Berger (J. Comput. Biol., 1999)

On a Problem in Shuffling. - Noga Alon; Kenneth A. Berman; Daniel J. Kleitman (J. Comb. Theory A, 2000)

Convex Sets in the Plane with Three of Every Four Meeting. - Daniel J. Kleitman; András Gyárfás; Géza Tóth 001 (Comb., 2001)

Six Lonely Runners. - Tom Bohman; Ron Holzman; Daniel J. Kleitman (Electron. J. Comb., 2001)

On partitions of discrete boxes. - Noga Alon; Tom Bohman; Ron Holzman; Daniel J. Kleitman (Discret. Math., 2002)

On a conjecture of Brualdi and Shen on block transitive tournaments. - P. Acosta; A. Bassa; A. Chaikin; A. Riehl; A. Tingstad; L. Zhao; Daniel J. Kleitman (J. Graph Theory, 2003)

msari. - Alex Coventry; Daniel J. Kleitman; Bonnie Berger (Proc. Natl. Acad. Sci. USA, 2004)

A Note on Caterpillar-Embeddings with No Two Parallel Edges. - Daniel J. Kleitman; Rom Pinchasi (Discret. Comput. Geom., 2005)

Extremal problems among subsets of a set. - Paul Erdös; Daniel J. Kleitman (Discret. Math., 2006)

On Rado's Boundedness Conjecture. - Jacob Fox; Daniel J. Kleitman (J. Comb. Theory A, 2006)

An odd kind of BCH code. - Shan-Yuan Ho; Daniel J. Kleitman (Discret. Appl. Math., 2013)

Editorial. - Daniel J. Kleitman; Aditya Shastri; Vera T. Sós (Discret. Appl. Math., 2013)

A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts. - Yupei Xiong; Damon Gulczynski; Daniel J. Kleitman; Bruce L. Golden; Edward A. Wasil (Optim. Lett., 2013)