| 2006 |
|---|
| 70 | EE | Paul Erdös,
Daniel J. Kleitman:
Extremal problems among subsets of a set.
Discrete Mathematics 306(10-11): 923-931 (2006) |
| 69 | EE | Jacob Fox,
Daniel J. Kleitman:
On Rado's Boundedness Conjecture.
J. Comb. Theory, Ser. A 113(1): 84-100 (2006) |
| 2005 |
|---|
| 68 | EE | Daniel J. Kleitman,
Rom Pinchasi:
A Note on Caterpillar-Embeddings with No Two Parallel Edges.
Discrete & Computational Geometry 33(2): 223-229 (2005) |
| 2002 |
|---|
| 67 | EE | Noga Alon,
Tom Bohman,
Ron Holzman,
Daniel J. Kleitman:
On partitions of discrete boxes.
Discrete Mathematics 257(2-3): 255-258 (2002) |
| 2001 |
|---|
| 66 | EE | Daniel J. Kleitman,
András Gyárfás,
Géza Tóth:
Convex Sets in the Plane with Three of Every Four Meeting.
Combinatorica 21(2): 221-232 (2001) |
| 65 | EE | Tom Bohman,
Ron Holzman,
Daniel J. Kleitman:
Six Lonely Runners.
Electr. J. Comb. 8(2): (2001) |
| 2000 |
|---|
| 64 | EE | Noga Alon,
Kenneth A. Berman,
Daniel J. Kleitman:
On a Problem in Shuffling.
J. Comb. Theory, Ser. A 91(1-2): 5-14 (2000) |
| 1999 |
|---|
| 63 | EE | 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: 285-294 |
| 62 | | Lior Pachter,
Serafim Batzoglou,
Valentin I. Spitkovsky,
E. Banks,
Eric S. Lander,
Daniel J. Kleitman,
Bonnie Berger:
A Dictionary-Based Approach for Gene Annotation.
Journal of Computational Biology 6(3/4): (1999) |
| 1998 |
|---|
| 61 | EE | Daniel J. Kleitman,
Lior Pachter:
Finding Convex Sets Among Points in the Plane.
Discrete & Computational Geometry 19(3): 405-410 (1998) |
| 1997 |
|---|
| 60 | EE | Noga Alon,
Daniel J. Kleitman:
A purely combinatorial proof of the Hadwiger Debrunner (p, q) Conjecture.
Electr. J. Comb. 4(2): (1997) |
| 59 | | 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): 385-401 (1997) |
| 1996 |
|---|
| 58 | EE | Wayne Goddard,
Meir Katchalski,
Daniel J. Kleitman:
Forcing Disjoint Segments in the Plane.
Eur. J. Comb. 17(4): 391-395 (1996) |
| 1994 |
|---|
| 57 | | Daniel J. Kleitman,
Frank Thomson Leighton,
Yuan Ma:
On the Design of Reliable Boolean Circuits that Contain Partially Unreliable Gates
FOCS 1994: 332-346 |
| 56 | | Boris Aronov,
Paul Erdös,
Wayne Goddard,
Daniel J. Kleitman,
Michael Klugerman,
János Pach,
Leonard J. Schulman:
Crossing Families.
Combinatorica 14(2): 127-134 (1994) |
| 55 | | Zoltán Füredi,
Daniel J. Kleitman:
The Prison Yard Problem.
Combinatorica 14(3): 287-300 (1994) |
| 54 | | Zoltán Füredi,
Michel X. Goemans,
Daniel J. Kleitman:
On the Maximum Number of Triangles in Wheel-Free Graphs.
Combinatorics, Probability & Computing 3: 63-75 (1994) |
| 53 | EE | Wayne Goddard,
Daniel J. Kleitman:
An upper bound for the Ramsey numbers r(K3, G).
Discrete Mathematics 125(1-3): 177-182 (1994) |
| 52 | EE | Jerrold R. Griggs,
Daniel J. Kleitman:
Independence and the Havel-Hakimi residue.
Discrete Mathematics 127(1-3): 209-212 (1994) |
| 51 | EE | Fan R. K. Chung,
Wayne Goddard,
Daniel J. Kleitman:
Even Cycles in Directed Graphs.
SIAM J. Discrete Math. 7(3): 474-483 (1994) |
| 1993 |
|---|
| 50 | EE | Alexander Felzenbaum,
Ron Holzman,
Daniel J. Kleitman:
Packing lines in a hypercube.
Discrete Mathematics 117(1-3): 107-112 (1993) |
| 49 | EE | Daniel J. Kleitman,
Leonard J. Schulman:
Minimally Distant Sets of Lattice Points.
Eur. J. Comb. 14(3): 231-240 (1993) |
| 1992 |
|---|
| 48 | EE | Noga Alon,
Daniel J. Kleitman:
Piercing Convex Sets.
Symposium on Computational Geometry 1992: 157-160 |
| 47 | | Péter L. Erdös,
Peter Frankl,
Daniel J. Kleitman,
Michael E. Saks,
László A. Székely:
Sharpening the LYM inequality.
Combinatorica 12(3): 287-293 (1992) |
| 46 | | Ron Holzman,
Daniel J. Kleitman:
Sign vectors and unit vectors.
Combinatorica 12(3): 303-316 (1992) |
| 45 | | Noga Alon,
Imre Bárány,
Zoltán Füredi,
Daniel J. Kleitman:
Point Selections and Weak e-Nets for Convex Hulls.
Combinatorics, Probability & Computing 1: 189-200 (1992) |
| 44 | EE | Noga Alon,
Daniel J. Kleitman:
Partitioning a rectangle into small perimeter rectangles.
Discrete Mathematics 103(2): 111-119 (1992) |
| 1991 |
|---|
| 43 | EE | Boris Aronov,
Paul Erdös,
Wayne Goddard,
Daniel J. Kleitman,
Michael Klugerman,
János Pach,
Leonard J. Schulman:
Crossing Families.
Symposium on Computational Geometry 1991: 351-356 |
| 42 | EE | Martin Aigner,
Dwight Duffus,
Daniel J. Kleitman:
Partitioning a power set into union-free classes.
Discrete Mathematics 88(2-3): 113-119 (1991) |
| 41 | | Daniel J. Kleitman,
Douglas B. West:
Spanning Trees with Many Leaves.
SIAM J. Discrete Math. 4(1): 99-106 (1991) |
| 40 | | G. 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): 377-381 (1991) |
| 1990 |
|---|
| 39 | | Ding-Zhu Du,
Daniel J. Kleitman:
Diameter and Radius in the Manhattan Metric.
Discrete & Computational Geometry 5: 351-356 (1990) |
| 38 | EE | Zoltán Füredi,
Jeff Kahn,
Daniel J. Kleitman:
Sphere coverings of the hypercube with incomparable centers.
Discrete Mathematics 83(1): 129-134 (1990) |
| 37 | EE | Zoltán Füredi,
Jerrold R. Griggs,
Ron Holzman,
Daniel J. Kleitman:
Representations of families of triples over GF(2).
J. Comb. Theory, Ser. A 53(2): 306-315 (1990) |
| 36 | | Maria M. Klawe,
Daniel J. Kleitman:
An Almost Linear Time Algorithm for Generalized Matrix Searching.
SIAM J. Discrete Math. 3(1): 81-97 (1990) |
| 35 | | Daniel J. Kleitman,
Rakesh Vohra:
Computing the Bandwidth of Interval Graphs.
SIAM J. Discrete Math. 3(3): 373-375 (1990) |
| 1989 |
|---|
| 34 | EE | Daniel J. Kleitman,
Michael R. Fellows:
Radius and diameter in Manhattan lattices.
Discrete Mathematics 73(1-2): 119-125 (1989) |
| 33 | | Alok Aggarwal,
Don Coppersmith,
Daniel J. Kleitman:
A Generalized Model for Understanding Evasiveness.
Inf. Process. Lett. 30(4): 205-208 (1989) |
| 32 | | Daniel J. Kleitman:
Divisors Without Unit-Congruent Ratios.
SIAM J. Discrete Math. 2(3): 344-349 (1989) |
| 31 | | Zoltán Füredi,
Jerrold R. Griggs,
Daniel J. Kleitman:
Pair Labeelings with Given Distance.
SIAM J. Discrete Math. 2(4): 491-499 (1989) |
| 1988 |
|---|
| 30 | | 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: 247-256 |
| 1987 |
|---|
| 29 | | Noga Alon,
Daniel J. Kleitman,
Carl Pomerance,
Michael E. Saks,
Paul D. Seymour:
The smallets n-uniform hypergraph with positive discrepancy.
Combinatorica 7(2): 151-160 (1987) |
| 28 | EE | Jichang Sha,
Daniel J. Kleitman:
The number of linear extensions of subset ordering.
Discrete Mathematics 63(2-3): 271-278 (1987) |
| 1986 |
|---|
| 27 | | Noga Alon,
Daniel J. Kleitman:
Covering a Square by Small Perimeter Rectangles.
Discrete & Computational Geometry 1: 1-7 (1986) |
| 26 | EE | Daniel J. Kleitman:
On a problem of Yuzvinsky on separating the n-cube.
Discrete Mathematics 60: 207-213 (1986) |
| 1984 |
|---|
| 25 | | Deborah S. Franzblau,
Daniel J. Kleitman:
An Algorithm for Constructing Regions with Rectangles: Independence and Minimum Generating Sets for Collections of Intervals
STOC 1984: 167-174 |
| 24 | | Deborah S. Franzblau,
Daniel J. Kleitman:
An Algorithm for Covering Polygons with Rectangles
Information and Control 63(3): 164-189 (1984) |
| 23 | | S. 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): 502-525 (1984) |
| 1983 |
|---|
| 22 | | Kenneth J. Winston,
Daniel J. Kleitman:
On the Asymptotic Number of Tournament Score Sequences.
J. Comb. Theory, Ser. A 35(2): 208-230 (1983) |
| 21 | | 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): 339-361 (1983) |
| 1982 |
|---|
| 20 | EE | Daniel J. Kleitman,
Kenneth J. Winston:
On the number of graphs without 4-cycles.
Discrete Mathematics 41(2): 167-172 (1982) |
| 1981 |
|---|
| 19 | | Daniel J. Kleitman,
Frank Thomson Leighton,
Margaret Lepley,
Gary L. Miller:
New Layouts for the Shuffle-Exchange Graph (Extended Abstract)
STOC 1981: 278-292 |
| 18 | | Daniel J. Kleitman,
Kenneth J. Winston:
Forests and score vectors.
Combinatorica 1(1): 49-54 (1981) |
| 17 | | Daniel J. Kleitman,
James B. Shearer,
Dean Sturtevant:
Intersections of k-element sets.
Combinatorica 1(4): 381-384 (1981) |
| 16 | EE | Jeff Kahn,
Daniel J. Kleitman:
On cross-bandwidth.
Discrete Mathematics 33(3): 323-325 (1981) |
| 15 | | Walter A. Burkhard,
Michael L. Fredman,
Daniel J. Kleitman:
Inherent Complexity Trade-Offs for Range Query Problems.
Theor. Comput. Sci. 16: 279-290 (1981) |
| 1980 |
|---|
| 14 | EE | Steve Fisk,
Daniel Abbw-Jackson,
Daniel J. Kleitman:
Helly-type theorems about sets.
Discrete Mathematics 32(1): 19-25 (1980) |
| 13 | EE | Daniel J. Kleitman,
D. J. Kwiatkowski:
Further results on the Aanderaa-Rosenberg conjecture.
J. Comb. Theory, Ser. B 28(1): 85-95 (1980) |
| 12 | | 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): 396-404 (1980) |
| 1978 |
|---|
| 11 | | Ronald L. Rivest,
Albert R. Meyer,
Daniel J. Kleitman,
Karl Winklmann,
Joel Spencer:
Coping with Errors in Binary Search Procedures (Preliminary Report)
STOC 1978: 227-232 |
| 10 | | S. Chaiken,
Daniel J. Kleitman:
Matrix Tree Theorems.
J. Comb. Theory, Ser. A 24(3): 377-381 (1978) |
| 1976 |
|---|
| 9 | | Curtis Greene,
Daniel J. Kleitman:
The Structure of Sperner k-Families.
J. Comb. Theory, Ser. A 20(1): 41-68 (1976) |
| 8 | | Curtis Greene,
Daniel J. Kleitman:
Strong Versions of Sperner's Theorem.
J. Comb. Theory, Ser. A 20(1): 80-88 (1976) |
| 7 | | Daniel J. Kleitman:
Some New Results on the Littlewood-Offord Problem.
J. Comb. Theory, Ser. A 20(1): 89-113 (1976) |
| 6 | | Daniel J. Kleitman:
Extremal Properties of Collections of Subsets Containing No Two Sets and Their Union.
J. Comb. Theory, Ser. A 20(3): 390-392 (1976) |
| 5 | | Daniel J. Kleitman,
D. J. Kwiatkowski:
A Lower Bound on the Length of a Sequence Containing All Permutations as Subsequences.
J. Comb. Theory, Ser. A 21(2): 129-136 (1976) |
| 4 | EE | Daniel J. Kleitman:
A note on the parity of the number of crossings of a graph.
J. Comb. Theory, Ser. B 21(1): 88-89 (1976) |
| 1975 |
|---|
| 3 | | Daniel J. Kleitman,
Michael M. Krieger:
An Optimal Bound for Two Dimensional Bin Packing
FOCS 1975: 163-168 |
| 1974 |
|---|
| 2 | | Daniel J. Kleitman,
T. L. Magnanti:
On the Number of Latent Subsets of Intersecting Collections.
J. Comb. Theory, Ser. A 16(2): 215-220 (1974) |
| 1 | | Daniel J. Kleitman:
A Note on Perfect Elimination Digraphs.
SIAM J. Comput. 3(4): 280-282 (1974) |
