Daniel J. Kleitman

Publication Activity (10 Years)

Years Active: 1970-2013
Publications (10 Years): 0

Top Venues

Discret. Appl. Math.

Optim. Lett.

Publications

Daniel J. Kleitman, Aditya Shastri, Vera T. Sós
Editorial. Discret. Appl. Math. 161 (9) (2013)
Shan-Yuan Ho, Daniel J. Kleitman
An odd kind of BCH code. Discret. Appl. Math. 161 (9) (2013)
Yupei Xiong, Damon Gulczynski, Daniel J. Kleitman, Bruce L. Golden, Edward A. Wasil
A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts. Optim. Lett. 7 (7) (2013)
Jacob Fox, Daniel J. Kleitman
On Rado's Boundedness Conjecture. J. Comb. Theory, Ser. A 113 (1) (2006)
Paul Erdös, Daniel J. Kleitman
Extremal problems among subsets of a set. Discret. Math. 306 (10-11) (2006)
Daniel J. Kleitman, Rom Pinchasi
A Note on Caterpillar-Embeddings with No Two Parallel Edges. Discret. Comput. Geom. 33 (2) (2005)
Alex Coventry, Daniel J. Kleitman, Bonnie Berger
msari. Proc. Natl. Acad. Sci. USA 101 (33) (2004)
P. Acosta, A. Bassa, A. Chaikin, A. Riehl, A. Tingstad, L. Zhao, Daniel J. Kleitman
On a conjecture of Brualdi and Shen on block transitive tournaments. J. Graph Theory 44 (3) (2003)
Noga Alon, Tom Bohman, Ron Holzman, Daniel J. Kleitman
On partitions of discrete boxes. Discret. Math. 257 (2-3) (2002)
Daniel J. Kleitman, András Gyárfás, Géza Tóth
Convex Sets in the Plane with Three of Every Four Meeting. Comb. 21 (2) (2001)
Tom Bohman, Ron Holzman, Daniel J. Kleitman
Six Lonely Runners. Electron. J. Comb. 8 (2) (2001)
Noga Alon, Kenneth A. Berman, Daniel J. Kleitman
On a Problem in Shuffling. J. Comb. Theory, Ser. A 91 (1-2) (2000)
Lior Pachter, Serafim Batzoglou, Valentin I. Spitkovsky, Eric Banks, Eric S. Lander, Daniel J. Kleitman, Bonnie Berger
A Dictionary-Based Approach for Gene Annotation. J. Comput. Biol. 6 (3/4) (1999)
Lior Pachter, Serafim Batzoglou, Valentin I. Spitkovsky, William S. Beebee, Eric S. Lander, Bonnie Berger, Daniel J. Kleitman
A dictionary based approach for gene annotation. RECOMB (1999)
Daniel J. Kleitman, Lior Pachter
Finding Convex Sets Among Points in the Plane. Discret. Comput. Geom. 19 (3) (1998)
Daniel J. Kleitman, Frank Thomson Leighton, Yuan Ma
On the Design of Reliable Boolean Circuits That Contain Partially Unreliable Gates. J. Comput. Syst. Sci. 55 (3) (1997)
Noga Alon, Daniel J. Kleitman
A purely combinatorial proof of the Hadwiger Debrunner (p, q) Conjecture. Electron. J. Comb. 4 (2) (1997)
Wayne Goddard, Meir Katchalski, Daniel J. Kleitman
Forcing Disjoint Segments in the Plane. Eur. J. Comb. 17 (4) (1996)
Daniel J. Kleitman, Fernando R. Lasaga, Lenore J. Cowen
Asymptotic enumeration of full graphs. J. Graph Theory 20 (1) (1995)
Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
Crossing Families. Comb. 14 (2) (1994)
Daniel J. Kleitman, Frank Thomson Leighton, Yuan Ma
On the Design of Reliable Boolean Circuits that Contain Partially Unreliable Gates FOCS (1994)
Jerrold R. Griggs, Daniel J. Kleitman
Independence and the Havel-Hakimi residue. Discret. Math. 127 (1-3) (1994)
Wayne Goddard, Daniel J. Kleitman
, G). Discret. Math. 125 (1-3) (1994)
Zoltán Füredi, Daniel J. Kleitman
The Prison Yard Problem. Comb. 14 (3) (1994)
Zoltán Füredi, Michel X. Goemans, Daniel J. Kleitman
On the Maximum Number of Triangles in Wheel-Free Graphs. Comb. Probab. Comput. 3 (1994)
Ding-Zhu Du, D. Frank Hsu, Daniel J. Kleitman
Modification of consecutive-d digraphs. Interconnection Networks and Mapping and Scheduling Parallel Computations (1994)
Fan R. K. Chung, Wayne Goddard, Daniel J. Kleitman
Even Cycles in Directed Graphs. SIAM J. Discret. Math. 7 (3) (1994)
Wayne Goddard, Daniel J. Kleitman
A note on maximal triangle-free graphs. J. Graph Theory 17 (5) (1993)
Alexander Felzenbaum, Ron Holzman, Daniel J. Kleitman
Packing lines in a hypercube. Discret. Math. 117 (1-3) (1993)
Daniel J. Kleitman, Leonard J. Schulman
Minimally Distant Sets of Lattice Points. Eur. J. Comb. 14 (3) (1993)
Noga Alon, Imre Bárány, Zoltán Füredi, Daniel J. Kleitman
Point Selections and Weak e-Nets for Convex Hulls. Comb. Probab. Comput. 1 (1992)
Péter L. Erdös, Peter Frankl, Daniel J. Kleitman, Michael E. Saks, László A. Székely
Sharpening the LYM inequality. Comb. 12 (3) (1992)
Noga Alon, Daniel J. Kleitman
Piercing Convex Sets. SCG (1992)
Zoltán Füredi, Daniel J. Kleitman
On zero-trees. J. Graph Theory 16 (2) (1992)
Noga Alon, Daniel J. Kleitman
Partitioning a rectangle into small perimeter rectangles. Discret. Math. 103 (2) (1992)
Ron Holzman, Daniel J. Kleitman
Sign vectors and unit vectors. Comb. 12 (3) (1992)
Martin Aigner, Dwight Duffus, Daniel J. Kleitman
Partitioning a power set into union-free classes. Discret. Math. 88 (2-3) (1991)
Daniel J. Kleitman, Douglas B. West
Spanning Trees with Many Leaves. SIAM J. Discret. Math. 4 (1) (1991)
Daniel J. Kleitman
Partitioning a Rectangle into Many Sub-rectangles so that a Line can Meet only a Few. Planar Graphs (1991)
Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
Crossing Families. SCG (1991)
Gustav Burosch, János Demetrovics, Gyula O. H. Katona, Daniel J. Kleitman, Alexander A. Sapozhenko
On the Number of Databases and Closure Operations. Theor. Comput. Sci. 78 (2) (1991)
Noga Alon, Daniel J. Kleitman, Richard J. Lipton, Roy Meshulam, Michael O. Rabin, Joel H. Spencer
. Graphs Comb. 7 (2) (1991)
Maria M. Klawe, Daniel J. Kleitman
An Almost Linear Time Algorithm for Generalized Matrix Searching. SIAM J. Discret. Math. 3 (1) (1990)
Daniel J. Kleitman, Rakesh Vohra
Computing the Bandwidth of Interval Graphs. SIAM J. Discret. Math. 3 (3) (1990)
Zoltán Füredi, Jeff Kahn, Daniel J. Kleitman
Sphere coverings of the hypercube with incomparable centers. Discret. Math. 83 (1) (1990)
Ding-Zhu Du, Daniel J. Kleitman
Diameter and Radius in the Manhattan Metric. Discret. Comput. Geom. 5 (1990)
Zoltán Füredi, Jerrold R. Griggs, Ron Holzman, Daniel J. Kleitman
(2). J. Comb. Theory, Ser. A 53 (2) (1990)
Alok Aggarwal, Don Coppersmith, Daniel J. Kleitman
A Generalized Model for Understanding Evasiveness. Inf. Process. Lett. 30 (4) (1989)
Jerrold R. Griggs, Daniel J. Kleitman, Aditya Shastri
Spanning trees with many leaves in cubic graphs. J. Graph Theory 13 (6) (1989)
Daniel J. Kleitman, Michael R. Fellows
Radius and diameter in Manhattan lattices. Discret. Math. 73 (1-2) (1989)
Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman
Pair Labeelings with Given Distance. SIAM J. Discret. Math. 2 (4) (1989)
Daniel J. Kleitman
Divisors Without Unit-Congruent Ratios. SIAM J. Discret. Math. 2 (3) (1989)
Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman
A minimal cutset of the boolean lattice with almost all members. Graphs Comb. 5 (1) (1989)
Larry Finkelstein, Daniel J. Kleitman, Frank Thomson Leighton
Applying the Classification Theorem for Finite Simple Groups to Minimize Pin Count in Uniform Permutation Architectures. AWOC (1988)
Noga Alon, Daniel J. Kleitman, Carsten Thomassen, Michael E. Saks, Paul D. Seymour
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number. J. Graph Theory 11 (3) (1987)
Jichang Sha, Daniel J. Kleitman
The number of linear extensions of subset ordering. Discret. Math. 63 (2-3) (1987)
Noga Alon, Daniel J. Kleitman, Carl Pomerance, Michael E. Saks, Paul D. Seymour
The smallets n-uniform hypergraph with positive discrepancy. Comb. 7 (2) (1987)
Noga Alon, Daniel J. Kleitman
Covering a Square by Small Perimeter Rectangles. Discret. Comput. Geom. 1 (1986)
Daniel J. Kleitman
On a problem of Yuzvinsky on separating the n-cube. Discret. Math. 60 (1986)
Curtis Greene, Daniel J. Kleitman
Longest Chains in the Lattice of Integer Partitions ordered by Majorization. Eur. J. Comb. 7 (1) (1986)
Deborah S. Franzblau, Daniel J. Kleitman
An Algorithm for Covering Polygons with Rectangles Inf. Control. 63 (3) (1984)
Deborah S. Franzblau, Daniel J. Kleitman
An Algorithm for Constructing Regions with Rectangles: Independence and Minimum Generating Sets for Collections of Intervals STOC (1984)
Susan F. Assmann, David S. Johnson, Daniel J. Kleitman, Joseph Y.-T. Leung
On a Dual Version of the One-Dimensional Bin Packing Problem. J. Algorithms 5 (4) (1984)
Susan F. Assmann, Daniel J. Kleitman
Characterization of curve map graphs. Discret. Appl. Math. 8 (2) (1984)
Susan F. Assmann, Daniel J. Kleitman
The number of rounds needed to exchange information within a graph. Discret. Appl. Math. 6 (2) (1983)
Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller
An Asymptotically Optimal Layout for the Shuffle-Exchange Graph. J. Comput. Syst. Sci. 26 (3) (1983)
Daniel J. Kleitman, Robert A. Lew
An algorithm for collapsing sign alternating sequences of real numbers. Discret. Appl. Math. 6 (1) (1983)
Kenneth J. Winston, Daniel J. Kleitman
On the Asymptotic Number of Tournament Score Sequences. J. Comb. Theory, Ser. A 35 (2) (1983)
Daniel J. Kleitman, Kenneth J. Winston
On the number of graphs without 4-cycles. Discret. Math. 41 (2) (1982)
Daniel J. Kleitman, James B. Shearer, Dean Sturtevant
Intersections of k-element sets. Comb. 1 (4) (1981)
Walter A. Burkhard, Michael L. Fredman, Daniel J. Kleitman
Inherent Complexity Trade-Offs for Range Query Problems. Theor. Comput. Sci. 16 (1981)
Jeff Kahn, Daniel J. Kleitman
On cross-bandwidth. Discret. Math. 33 (3) (1981)
Daniel J. Kleitman, Kenneth J. Winston
Forests and score vectors. Comb. 1 (1) (1981)
Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller
New Layouts for the Shuffle-Exchange Graph (Extended Abstract) STOC (1981)
Daniel J. Kleitman, David Joseph Kwiatkowski
Further results on the Aanderaa-Rosenberg conjecture. J. Comb. Theory, Ser. B 28 (1) (1980)
Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer
Coping with Errors in Binary Search Procedures. J. Comput. Syst. Sci. 20 (3) (1980)
Daniel J. Kleitman, James B. Shearer
Further gossip problems. Discret. Math. 30 (2) (1980)
Steve Fisk, Daniel Abbw-Jackson, Daniel J. Kleitman
Helly-type theorems about sets. Discret. Math. 32 (1) (1980)
Daniel J. Kleitman, Kenneth J. Winston
Ensembles and Largest Sojourns of Random Walks. SIAM J. Algebraic Discret. Methods 1 (1) (1980)
Douglas B. West, Daniel J. Kleitman
Skew chain orders and sets of rectangles. Discret. Math. 27 (1) (1979)
David E. Daykin, Daniel J. Kleitman, Douglas B. West
The Number of Meets between Two Subsets of a Lattice. J. Comb. Theory, Ser. A 26 (2) (1979)
Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer
Coping with Errors in Binary Search Procedures (Preliminary Report) STOC (1978)
S. Chaiken, Daniel J. Kleitman
Matrix Tree Theorems. J. Comb. Theory, Ser. A 24 (3) (1978)
Jerrold R. Griggs, Daniel J. Kleitman
A three part Sperner theorem. Discret. Math. 17 (3) (1977)
Curtis Greene, Daniel J. Kleitman
Strong Versions of Sperner's Theorem. J. Comb. Theory, Ser. A 20 (1) (1976)
Daniel J. Kleitman
Extremal Properties of Collections of Subsets Containing No Two Sets and Their Union. J. Comb. Theory, Ser. A 20 (3) (1976)
Curtis Greene, Daniel J. Kleitman
The Structure of Sperner k-Families. J. Comb. Theory, Ser. A 20 (1) (1976)
Daniel J. Kleitman
More on complementary trees. Discret. Math. 15 (4) (1976)
Daniel J. Kleitman
Some New Results on the Littlewood-Offord Problem. J. Comb. Theory, Ser. A 20 (1) (1976)
Daniel J. Kleitman
A note on the parity of the number of crossings of a graph. J. Comb. Theory, Ser. B 21 (1) (1976)
Daniel J. Kleitman, David Joseph Kwiatkowski
A Lower Bound on the Length of a Sequence Containing All Permutations as Subsequences. J. Comb. Theory, Ser. A 21 (2) (1976)
Elliot Bird, Curtis Greene, Daniel J. Kleitman
Automorphisms of lexicographic products. Discret. Math. 11 (3) (1975)
Daniel J. Kleitman, Michael M. Krieger
An Optimal Bound for Two Dimensional Bin Packing FOCS (1975)
Paul Erdös, Daniel J. Kleitman
Extremal problems among subsets of a set. Discret. Math. 8 (3) (1974)
Armin Claus, Daniel J. Kleitman
Cost allocation in networks: The bulk supplier problem. Networks 4 (1) (1974)
Daniel J. Kleitman
A Note on Perfect Elimination Digraphs. SIAM J. Comput. 3 (4) (1974)
Daniel J. Kleitman, Thomas L. Magnanti
On the Number of Latent Subsets of Intersecting Collections. J. Comb. Theory, Ser. A 16 (2) (1974)
D. L. Wang, Daniel J. Kleitman
On the existence of N-connected graphs with prescribed degrees (n ≧ 2). Networks 3 (3) (1973)
Armin Claus, Daniel J. Kleitman
Cost allocation for a spanning tree. Networks 3 (4) (1973)
Daniel J. Kleitman, E. C. Milner
On the average size of the sets in a Sperner family. Discret. Math. 6 (2) (1973)

Daniel J. Kleitman.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Daniel J. Kleitman