Daniel J. Kleitman

107 papers A* 5B 1Journal 96Unranked 5

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