☰

Daniel J. Kleitman - Publications

Affiliations: 
1960-1966 Physics Brandeis University, Waltham, MA, United States 
 1966- Mathematics Massachusetts Institute of Technology, Cambridge, MA, United States 
Area:
discrete mathematics
Website:
https://math.mit.edu/directory/profile.html?pid=135
Tree Info Similar researchers PubMed Report error

101 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2010 Bassa A, Burns J, Campbell J, Deshpande A, Farley J, Halsey M, Ho SY, Kleitman D, Michalakis S, Persson PO, Pylyavskyy P, Rademacher L, Riehl A, Rios M, Samuel J, et al. Partitioning a planar graph of girth 10 into a forest and a matching Studies in Applied Mathematics. 124: 213-228. DOI: 10.1111/J.1467-9590.2009.00468.X  0.391
2006 Erdös P, Kleitman DJ. Extremal problems among subsets of a set Discrete Mathematics. 306: 923-931. DOI: 10.1016/0012-365X(74)90140-X  0.317
2004 Coventry A, Kleitman DJ, Berger B. MSARI: multiple sequence alignments for statistical detection of RNA secondary structure. Proceedings of the National Academy of Sciences of the United States of America. 101: 12102-7. PMID 15304649 DOI: 10.1073/Pnas.0404193101  0.494
2004 Kleitman DJ, Pinchasi R. A Note on Caterpillar-Embeddings with No Two Parallel Edges Discrete & Computational Geometry. 33: 223-229. DOI: 10.1007/S00454-004-1142-2  0.361
2003 Acosta P, Bassa A, Chaikin A, Riehl A, Tingstad A, Zhao L, Kleitman DJ. On a Conjecture of Brualdi and Shen on Block Transitive Tournaments Journal of Graph Theory. 44: 215-230. DOI: 10.1002/Jgt.V44:3  0.393
2002 Alon N, Bohman T, Holzman R, Kleitman DJ. On partitions of discrete boxes Discrete Mathematics. 257: 255-258. DOI: 10.1016/S0012-365X(02)00428-4  0.381
2001 Kleitman DJ, Gyárfás A, Tóth G. Convex Sets in the Plane with Three of Every Four Meeting Combinatorica. 21: 221-232. DOI: 10.1007/S004930100020  0.327
2000 Alon N, Berman K, Kleitman D. On a Problem in Shuffling Journal of Combinatorial Theory, Series A. 91: 5-14. DOI: 10.1006/Jcta.2000.3087  0.358
1999 Pachter L, Batzoglou S, Spitkovsky VI, Banks E, Lander ES, Kleitman DJ, Berger B. A dictionary-based approach for gene annotation. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 6: 419-30. PMID 10582576 DOI: 10.1089/106652799318364  0.611
1998 Kleitman D, Pachter L. Finding Convex Sets Among Points in the Plane Discrete & Computational Geometry. 19: 405-410. DOI: 10.1007/Pl00009358  0.602
1996 Goddard W, Katchalski M, Kleitman DJ. Forcing Disjoint Segments in the Plane European Journal of Combinatorics. 17: 391-395. DOI: 10.1006/Eujc.1996.0032  0.603
1996 Alon N, Fan CK, Kleitman D, Losonczy J. Acyclic matchings Advances in Mathematics. 122: 234-236. DOI: 10.1006/Aima.1996.0060  0.34
1996 Cowen LJ, Kleitman DJ, Lasaga F, Sussman DE. Enumeration of Full Graphs: Onset of the Asymptotic Region Studies in Applied Mathematics. 96: 339-350. DOI: 10.1002/Sapm1996963339  0.464
1995 Kleitman DJ, Lasaga FR, Cowen LJ. Asymptotic enumeration of full graphs Journal of Graph Theory. 20: 59-69. DOI: 10.1002/Jgt.3190200106  0.451
1994 Chung FRK, Goddard W, Kleitman DJ. Even Cycles in Directed Graphs Siam Journal On Discrete Mathematics. 7: 474-483. DOI: 10.1137/S0895480192225433  0.668
1994 Füredi Z, Goemans MX, Kleitman DJ. On the Maximum Number of Triangles in Wheel-Free Graphs Combinatorics, Probability and Computing. 3: 63-75. DOI: 10.1017/S0963548300000985  0.424
1994 Goddard W, Kleitman DJ. An upper bound for the Ramsey numbers r(K3,G) Discrete Mathematics. 125: 177-182. DOI: 10.1016/0012-365X(94)90158-9  0.666
1994 Griggs JR, Kleitman DJ. Independence and the Havel-Hakimi residue Discrete Mathematics. 127: 209-212. DOI: 10.1016/0012-365X(92)00479-B  0.666
1994 F�redi Z, Kleitman DJ. The prison yard problem Combinatorica. 14: 287-300. DOI: 10.1007/Bf01212977  0.341
1993 Felzenbaum A, Holzman R, Kleitman DJ. Packing lines in a hypercube Discrete Mathematics. 117: 107-112. DOI: 10.1016/0012-365X(93)90327-P  0.316
1993 Kleitman DJ, Schulman LJ. Minimally Distant Sets of Lattice Points European Journal of Combinatorics. 14: 231-240. DOI: 10.1006/Eujc.1993.1026  0.413
1993 Goddard W, Kleitman DJ. A note on maximal triangle-free graphs Journal of Graph Theory. 17: 629-631. DOI: 10.1002/Jgt.3190170510  0.689
1992 Kalai G, Kleitman DJ. A quasi-polynomial bound for the diameter of graphs of polyhedra Bulletin of the American Mathematical Society. 26: 315-316. DOI: 10.1090/S0273-0979-1992-00285-9  0.398
1992 Alon N, Kleitman DJ. Partitioning a rectangle into small perimeter rectangles Discrete Mathematics. 103: 111-119. DOI: 10.1016/0012-365X(92)90261-D  0.341
1992 Holzman R, Kleitman DJ. On the product of sign vectors and unit vectors Combinatorica. 12: 303-316. DOI: 10.1007/Bf01285819  0.381
1992 Erdos PL, Frankl P, Kleitman DJ, Saks ME, Székely LA. Sharpening the LYM inequality Combinatorica. 12: 287-293. DOI: 10.1007/Bf01285817  0.61
1992 Füredi Z, Kleitman DJ. On zero-trees Journal of Graph Theory. 16: 107-120. DOI: 10.1002/Jgt.3190160202  0.355
1991 Kleitman DJ, West DB. Spanning Trees with Many Leaves Siam Journal On Discrete Mathematics. 4: 99-106. DOI: 10.1137/0404010  0.581
1991 Burosch G, Demetrovics J, Katona G, Kleitman D, Sapozhenko A. On the number of databases and closure operations Theoretical Computer Science. 78: 377-381. DOI: 10.1016/0304-3975(91)90359-A  0.321
1991 Aigner M, Duffus D, Kleitman DJ. Partitioning a power set into union-free classes Discrete Mathematics. 88: 113-119. DOI: 10.1016/0012-365X(91)90002-J  0.388
1990 Klawe MM, Kleitman DJ. An Almost Linear Time Algorithm for Generalized Matrix Searching Siam Journal On Discrete Mathematics. 3: 81-97. DOI: 10.1137/0403009  0.344
1990 Füredi Z, Griggs JR, Holzman R, Kleitman DJ. Representations of families of triples over GF(2) Journal of Combinatorial Theory, Series A. 53: 306-315. DOI: 10.1016/0097-3165(90)90062-2  0.649
1990 Du DZ, Kleitman DJ. Diameter and radius in the Manhattan metric Discrete & Computational Geometry. 5: 351-356. DOI: 10.1007/Bf02187795  0.352
1989 Furedi Z, Griggs JR, Kleitman DJ. Pair Labellings with Given Distance Siam Journal On Discrete Mathematics. 2: 491-499. DOI: 10.1137/0402044  0.672
1989 Kleitman DJ. Divisors without Unit-Congruent Ratios Siam Journal On Discrete Mathematics. 2: 344-349. DOI: 10.1137/0402030  0.35
1989 Lemke P, Kleitman D. An addition theorem on the integers modulo n Journal of Number Theory. 31: 335-345. DOI: 10.1016/0022-314X(89)90077-2  0.374
1989 Aggarwal A, Coppersmith D, Kleitman D. A generalized model for understanding evasiveness Information Processing Letters. 30: 205-208. DOI: 10.1016/0020-0190(89)90214-7  0.433
1989 Füredi Z, Griggs JR, Kleitman DJ. A minimal cutset of the boolean lattice with almost all members Graphs and Combinatorics. 5: 327-332. DOI: 10.1007/Bf01788687  0.621
1989 Griggs JR, Kleitman DJ. Minimum cutsets for an element of a boolean lattice Order. 6: 31-37. DOI: 10.1007/Bf00341634  0.668
1989 Griggs JR, Kleitman DJ, Shastri A. Spanning trees with many leaves in cubic graphs Journal of Graph Theory. 13: 669-695. DOI: 10.1002/Jgt.3190130604  0.69
1988 Kleitman D, Fellows M. Radius and diameter in Manhattan lattices Discrete Mathematics. 73: 119-125. DOI: 10.1016/0012-365X(88)90139-2  0.334
1987 Sha J, Kleitman DJ. The number of linear extensions of subset ordering Discrete Mathematics. 63: 271-278. DOI: 10.1016/0012-365X(87)90016-1  0.347
1987 Alon N, Kleitman DJ, Pomerance C, Saks M, Seymour P. The smallest n-uniform hypergraph with positive discrepancy Combinatorica. 7: 151-160. DOI: 10.1007/Bf02579446  0.376
1987 Alon N, Kleitman D, Thomassen C, Saks M, Seymour P. Subgraphs of large connectivity and chromatic number in graphs of large chromatic number Journal of Graph Theory. 11: 367-371. DOI: 10.1002/Jgt.3190110311  0.357
1986 Greene C, Kleitman DJ. Longest Chains in the Lattice of Integer Partitions ordered by Majorization European Journal of Combinatorics. 7: 1-10. DOI: 10.1016/S0195-6698(86)80013-0  0.314
1986 Kleitman D. On a problem of Yuzvinsky on separating the n-cube Discrete Mathematics. 60: 207-213. DOI: 10.1016/0012-365X(86)90013-0  0.346
1984 Franzblau D, Kleitman D. An algorithm for covering polygons with rectangles Information and Control. 63: 164-189. DOI: 10.1016/S0019-9958(84)80012-1  0.352
1984 Assmann S, Johnson D, Kleitman D, Leung J. On a dual version of the one-dimensional bin packing problem Journal of Algorithms. 5: 502-525. DOI: 10.1016/0196-6774(84)90004-X  0.334
1984 Assmann S, Kleitman D. Characterization of curve map graphs Discrete Applied Mathematics. 8: 109-124. DOI: 10.1016/0166-218X(84)90094-5  0.349
1983 Kahn J, Klawe M, Kleitman D. Traditional Galleries Require Fewer Watchmen Siam Journal On Algebraic Discrete Methods. 4: 194-206. DOI: 10.1137/0604020  0.427
1983 Kleitman DJ, Lew RA. An algorithm for collapsing sign alternating sequences of real numbers Discrete Applied Mathematics. 6: 49-53. DOI: 10.1016/0166-218X(83)90099-9  0.359
1983 Assmann SF, Kleitman DJ. The number of rounds needed to exchange information within a graph Discrete Applied Mathematics. 6: 117-125. DOI: 10.1016/0166-218X(83)90065-3  0.389
1983 Winston KJ, Kleitman DJ. On the asymptotic number of tournament score sequences Journal of Combinatorial Theory, Series A. 35: 208-230. DOI: 10.1016/0097-3165(83)90008-0  0.395
1983 Kleitman D, Thomson Leighton F, Lepley M, Miller GL. An asymptotically optimal layout for the shuffle—exchange graph Journal of Computer and System Sciences. 26: 339-361. DOI: 10.1016/0022-0000(83)90005-3  0.428
1982 Kleitman DJ, Winston KJ. On the number of graphs without 4-cycles Discrete Mathematics. 41: 167-172. DOI: 10.1016/0012-365X(82)90204-7  0.458
1981 Chaiken S, Kleitman DJ, Saks M, Shearer J. Covering Regions by Rectangles Siam Journal On Algebraic Discrete Methods. 2: 394-410. DOI: 10.1137/0602042  0.334
1981 Kahn J, Kleitman D. On cross-bandwidth Discrete Mathematics. 33: 323-325. DOI: 10.1016/0012-365X(81)90276-4  0.388
1981 Kleitman DJ, Shearer J, Sturtevant D. Intersections of k-element sets Combinatorica. 1: 381-384. DOI: 10.1007/Bf02579460  0.325
1981 Kleitman DJ, Winston KJ. Forests and score vectors Combinatorica. 1: 49-54. DOI: 10.1007/Bf02579176  0.357
1980 Kleitman DJ, Winston KJ. Ensembles and Largest Sojourns of Random Walks Siam Journal On Algebraic Discrete Methods. 1: 15-20. DOI: 10.1137/0601003  0.375
1980 Kleitman D, Kwiatkowski D. Further results on the Aanderaa-Rosenberg conjecture Journal of Combinatorial Theory, Series B. 28: 85-95. DOI: 10.1016/0095-8956(80)90057-X  0.432
1980 Rivest R, Meyer A, Kleitman D, Winklmann K, Spencer J. Coping with errors in binary search procedures Journal of Computer and System Sciences. 20: 396-404. DOI: 10.1016/0022-0000(80)90014-8  0.329
1980 Kleitman DJ, Shearer JB. Further gossip problems Discrete Mathematics. 30: 151-156. DOI: 10.1016/0012-365X(80)90116-8  0.358
1980 Fisk S, Abbw-Jackson D, Kleitman D. Helly-type theorems about sets Discrete Mathematics. 32: 19-25. DOI: 10.1016/0012-365X(80)90095-3  0.454
1979 Hu TC, Kleitman DJ, Tamaki JK. Binary Trees Optimum Under Various Criteria Siam Journal On Applied Mathematics. 37: 246-256. DOI: 10.1137/0137015  0.321
1979 Daykin DE, Kleitman DJ, West DB. The number of meets between two subsets of a lattice Journal of Combinatorial Theory, Series A. 26: 135-156. DOI: 10.1016/0097-3165(79)90063-3  0.503
1979 West DB, Kleitman DJ. Skew chain orders and sets of rectangles Discrete Mathematics. 27: 99-102. DOI: 10.1016/0012-365X(79)90073-6  0.512
1978 Nussinov R, Pieczenik G, Griggs JR, Kleitman DJ. Algorithms for Loop Matchings Siam Journal On Applied Mathematics. 35: 68-82. DOI: 10.1137/0135006  0.649
1978 Chaiken S, Kleitman DJ. Matrix Tree Theorems Journal of Combinatorial Theory, Series A. 24: 377-381. DOI: 10.1016/0097-3165(78)90067-5  0.695
1977 Griggs JR, Kleitman DJ. A three part Sperner theorem Discrete Mathematics. 17: 281-289. DOI: 10.1016/0012-365X(77)90161-3  0.628
1976 Kleitman D. Some new results on the Littlewood-Offord problem Journal of Combinatorial Theory, Series A. 20: 89-113. DOI: 10.1016/0097-3165(76)90080-7  0.394
1976 Greene C, Kleitman DJ. Strong versions of Sperner's theorem Journal of Combinatorial Theory, Series A. 20: 80-88. DOI: 10.1016/0097-3165(76)90079-0  0.348
1976 Greene C, Kleitman DJ. The structure of sperner k-families Journal of Combinatorial Theory, Series A. 20: 41-68. DOI: 10.1016/0097-3165(76)90077-7  0.326
1976 Kleitman D, Kwiatkowski D. A lower bound on the length of a sequence containing all permutations as subsequences Journal of Combinatorial Theory, Series A. 21: 129-136. DOI: 10.1016/0097-3165(76)90057-1  0.382
1976 Kleitman DJ. Extremal properties of collections of subsets containing no two sets and their union Journal of Combinatorial Theory, Series A. 20: 390-392. DOI: 10.1016/0097-3165(76)90037-6  0.388
1976 Clapham C, Kleitman D. The degree sequences of self-complementary graphs Journal of Combinatorial Theory, Series B. 20: 67-74. DOI: 10.1016/0095-8956(76)90068-X  0.379
1976 Kleitman D. A note on the parity of the number of crossings of a graph Journal of Combinatorial Theory, Series B. 21: 88-89. DOI: 10.1016/0095-8956(76)90032-0  0.371
1976 Kleitman DJ. More on complementary trees Discrete Mathematics. 15: 373-378. DOI: 10.1016/0012-365X(76)90050-9  0.433
1976 Greene C, Katona GOH, Kleitman DJ. Extensions of the Erdös-Ko-Rado Theorem Studies in Applied Mathematics. 55: 1-8. DOI: 10.1002/Sapm19765511  0.305
1975 Kleitman D, Markowsky G. On Dedekind’s problem: the number of isotone Boolean functions. II Transactions of the American Mathematical Society. 213: 373-373. DOI: 10.1090/S0002-9947-1975-0382107-0  0.383
1975 Kleitman DJ, Rothschild BL. Asymptotic enumeration of partial orders on a finite set Transactions of the American Mathematical Society. 205: 205-205. DOI: 10.1090/S0002-9947-1975-0369090-9  0.424
1975 Kleitman DJ, Golden B. Counting Trees in a Certain Class of Graphs The American Mathematical Monthly. 82: 40-44. DOI: 10.1080/00029890.1975.11993767  0.432
1974 Kleitman D, Magnanti T. On the number of latent subsets of intersecting collections Journal of Combinatorial Theory, Series A. 16: 215-220. DOI: 10.1016/0097-3165(74)90046-6  0.325
1974 Halász S, Kleitman DJ. A Note on Random Triangles Studies in Applied Mathematics. 53: 225-237. DOI: 10.1002/Sapm1974533225  0.32
1973 Kleitman DJ, Spencer J. Families of k-independent sets Discrete Mathematics. 6: 255-262. DOI: 10.1016/0012-365X(73)90098-8  0.301
1973 Kleitman D, Milner E. On the average size of the sets in a Sperner family Discrete Mathematics. 6: 141-147. DOI: 10.1016/0012-365X(73)90043-5  0.355
1973 Kleitman D, Wang D. Algorithms for constructing graphs and digraphs with given valences and factors Discrete Mathematics. 6: 79-88. DOI: 10.1016/0012-365X(73)90037-X  0.409
1973 Wang DL, Kleitman DJ. On the existence of N-connected graphs with prescribed degrees (n ≧ 2) Networks. 3: 225-239. DOI: 10.1002/Net.3230030303  0.469
1972 Kleitman D, Rothschild B. A generalization of Kaplansky's game Discrete Mathematics. 2: 173-178. DOI: 10.1016/0012-365X(72)90082-9  0.304
1971 Kleitman D, Edelberg M, Lubell D. Maximal sized antichains in partial orders Discrete Mathematics. 1: 47-53. DOI: 10.1016/0012-365X(71)90006-9  0.338
1971 Kleitman DJ, Krieger MM, Rothschild BL. Configurations Maximizing the Number of Pairs of Hamming-Adjacent Lattice Points Studies in Applied Mathematics. 50: 115-119. DOI: 10.1002/Sapm1971502115  0.379
1970 Kleitman DJ. Minimal Number of Multiple Edges in Realization of an Incidence Sequence Without Loops Siam Journal On Applied Mathematics. 18: 25-28. DOI: 10.1137/0118005  0.42
1970 Kleitman DJ. The crossing number of K5,n Journal of Combinatorial Theory. 9: 315-323. DOI: 10.1016/S0021-9800(70)80087-4  0.39
1970 Kleitman D, Martin-Löf A, Rothschild B, Whinston A. A matching theorem for graphs Journal of Combinatorial Theory. 8: 104-114. DOI: 10.1016/S0021-9800(70)80013-8  0.42
1970 Kleitman DJ. On a lemma of Littlewood and Offord on the distributions of linear combinations of vectors Advances in Mathematics. 5: 427-429. DOI: 10.1007/978-0-8176-4842-8_32  0.342
1968 Kleitman D. On families of subsets of a finite set containing no two disjoint sets and their union Journal of Combinatorial Theory. 5: 235-237. DOI: 10.1016/S0021-9800(68)80069-9  0.315
1968 Erdös P, Kleitman DJ. On coloring graphs to maximize the proportion of multicolored k-edges Journal of Combinatorial Theory. 5: 164-169. DOI: 10.1016/S0021-9800(68)80051-1  0.375
1968 Kleitman DJ. Maximal number of subsets of a finite set No k of which are pairwise disjoint Journal of Combinatorial Theory. 5: 157-163. DOI: 10.1016/S0021-9800(68)80050-X  0.432
1968 Kleitman D. On a conjecture of milner on k-graphs with non-disjoint edges Journal of Combinatorial Theory. 5: 153-156. DOI: 10.1016/S0021-9800(68)80049-3  0.392
1966 Kleitman D. On subsets contained in a family of non-commensurable subsets of a finite set Journal of Combinatorial Theory, Series A. 7: 181-183. DOI: 10.1016/S0021-9800(69)80053-0  0.301
1964 Coleman S, Glashow SL, Kleitman DJ. Mass formulas and mass inequalities for reducible unitary multiplets Physical Review. 135: B779-B782. DOI: 10.1103/PhysRev.135.B779  0.404
Show low-probability matches.