According to our database
1,
Daniel J. Kleitman
authored at least 104 papers
between 1970 and 2013.
Collaborative distances:
-
Dijkstra number2 of
two.
-
Erdős number3 of
one.
2013
A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts.
Optim. Lett., 2013
Discret. Appl. Math., 2013
Discret. Appl. Math., 2013
2006
On Rado's Boundedness Conjecture.
J. Comb. Theory A, 2006
Extremal problems among subsets of a set.
Discret. Math., 2006
2005
A Note on Caterpillar-Embeddings with No Two Parallel Edges.
Discret. Comput. Geom., 2005
2004
Proc. Natl. Acad. Sci. USA, 2004
2003
On a conjecture of Brualdi and Shen on block transitive tournaments.
J. Graph Theory, 2003
2002
On partitions of discrete boxes.
Discret. Math., 2002
2001
Convex Sets in the Plane with Three of Every Four Meeting.
Comb., 2001
2000
On a Problem in Shuffling.
J. Comb. Theory A, 2000
1999
A Dictionary-Based Approach for Gene Annotation.
J. Comput. Biol., 1999
A dictionary based approach for gene annotation.
Proceedings of the Third Annual International Conference on Research in Computational Molecular Biology, 1999
1998
Finding Convex Sets Among Points in the Plane.
Discret. Comput. Geom., 1998
1997
On the Design of Reliable Boolean Circuits That Contain Partially Unreliable Gates.
J. Comput. Syst. Sci., 1997
A purely combinatorial proof of the Hadwiger Debrunner (p, q) Conjecture.
Electron. J. Comb., 1997
1996
Forcing Disjoint Segments in the Plane.
Eur. J. Comb., 1996
1995
Asymptotic enumeration of full graphs.
J. Graph Theory, 1995
1994
Even Cycles in Directed Graphs.
SIAM J. Discret. Math., 1994
Independence and the Havel-Hakimi residue.
Discret. Math., 1994
An upper bound for the Ramsey numbers r(K<sub>3</sub>, G).
Discret. Math., 1994
On the Maximum Number of Triangles in Wheel-Free Graphs.
Comb. Probab. Comput., 1994
Modification of consecutive-d digraphs.
Proceedings of the Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994
1993
A note on maximal triangle-free graphs.
J. Graph Theory, 1993
Minimally Distant Sets of Lattice Points.
Eur. J. Comb., 1993
Packing lines in a hypercube.
Discret. Math., 1993
1992
Partitioning a rectangle into small perimeter rectangles.
Discret. Math., 1992
Point Selections and Weak e-Nets for Convex Hulls.
Comb. Probab. Comput., 1992
Sign vectors and unit vectors.
Comb., 1992
Sharpening the LYM inequality.
Comb., 1992
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992
1991
On the Number of Databases and Closure Operations.
Theor. Comput. Sci., 1991
Spanning Trees with Many Leaves.
SIAM J. Discret. Math., 1991
Set systems with no union of cardinality 0 modulo<i>m</i>.
Graphs Comb., 1991
Partitioning a power set into union-free classes.
Discret. Math., 1991
Partitioning a Rectangle into Many Sub-rectangles so that a Line can Meet only a Few.
Proceedings of the Planar Graphs, 1991
1990
Computing the Bandwidth of Interval Graphs.
SIAM J. Discret. Math., 1990
An Almost Linear Time Algorithm for Generalized Matrix Searching.
SIAM J. Discret. Math., 1990
Representations of families of triples over <i>GF</i>(2).
J. Comb. Theory A, 1990
Sphere coverings of the hypercube with incomparable centers.
Discret. Math., 1990
Diameter and Radius in the Manhattan Metric.
Discret. Comput. Geom., 1990
1989
Divisors Without Unit-Congruent Ratios.
SIAM J. Discret. Math., 1989
Pair Labeelings with Given Distance.
SIAM J. Discret. Math., 1989
Spanning trees with many leaves in cubic graphs.
J. Graph Theory, 1989
A Generalized Model for Understanding Evasiveness.
Inf. Process. Lett., 1989
A minimal cutset of the boolean lattice with almost all members.
Graphs Comb., 1989
Radius and diameter in Manhattan lattices.
Discret. Math., 1989
1988
Applying the Classification Theorem for Finite Simple Groups to Minimize Pin Count in Uniform Permutation Architectures.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988
1987
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number.
J. Graph Theory, 1987
The number of linear extensions of subset ordering.
Discret. Math., 1987
The smallets n-uniform hypergraph with positive discrepancy.
Comb., 1987
1986
Longest Chains in the Lattice of Integer Partitions ordered by Majorization.
Eur. J. Comb., 1986
On a problem of Yuzvinsky on separating the n-cube.
Discret. Math., 1986
Covering a Square by Small Perimeter Rectangles.
Discret. Comput. Geom., 1986
1984
An Algorithm for Covering Polygons with Rectangles
Inf. Control., December, 1984
On a Dual Version of the One-Dimensional Bin Packing Problem.
J. Algorithms, 1984
Characterization of curve map graphs.
Discret. Appl. Math., 1984
An Algorithm for Constructing Regions with Rectangles: Independence and Minimum Generating Sets for Collections of Intervals
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984
1983
On the Asymptotic Number of Tournament Score Sequences.
J. Comb. Theory A, 1983
An Asymptotically Optimal Layout for the Shuffle-Exchange Graph.
J. Comput. Syst. Sci., 1983
An algorithm for collapsing sign alternating sequences of real numbers.
Discret. Appl. Math., 1983
The number of rounds needed to exchange information within a graph.
Discret. Appl. Math., 1983
1982
On the number of graphs without 4-cycles.
Discret. Math., 1982
1981
Inherent Complexity Trade-Offs for Range Query Problems.
Theor. Comput. Sci., 1981
Forests and score vectors.
Comb., 1981
Intersections of k-element sets.
Comb., 1981
New Layouts for the Shuffle-Exchange Graph (Extended Abstract)
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981
1980
Ensembles and Largest Sojourns of Random Walks.
SIAM J. Algebraic Discret. Methods, 1980
Further results on the Aanderaa-Rosenberg conjecture.
J. Comb. Theory B, 1980
Coping with Errors in Binary Search Procedures.
J. Comput. Syst. Sci., 1980
Helly-type theorems about sets.
Discret. Math., 1980
1979
The Number of Meets between Two Subsets of a Lattice.
J. Comb. Theory A, 1979
Skew chain orders and sets of rectangles.
Discret. Math., 1979
1978
Coping with Errors in Binary Search Procedures (Preliminary Report)
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978
1977
A three part Sperner theorem.
Discret. Math., 1977
1976
A Lower Bound on the Length of a Sequence Containing All Permutations as Subsequences.
J. Comb. Theory A, 1976
A note on the parity of the number of crossings of a graph.
J. Comb. Theory B, 1976
Extremal Properties of Collections of Subsets Containing No Two Sets and Their Union.
J. Comb. Theory A, 1976
Some New Results on the Littlewood-Offord Problem.
J. Comb. Theory A, 1976
Strong Versions of Sperner's Theorem.
J. Comb. Theory A, 1976
The Structure of Sperner k-Families.
J. Comb. Theory A, 1976
More on complementary trees.
Discret. Math., 1976
1975
Automorphisms of lexicographic products.
Discret. Math., 1975
An Optimal Bound for Two Dimensional Bin Packing
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975
1974
A Note on Perfect Elimination Digraphs.
SIAM J. Comput., 1974
Cost allocation in networks: The bulk supplier problem.
Networks, 1974
On the Number of Latent Subsets of Intersecting Collections.
J. Comb. Theory A, 1974
1973
On the existence of N-connected graphs with prescribed degrees (n ≧ 2).
Networks, 1973
Cost allocation for a spanning tree.
Networks, 1973
Algorithms for constructing graphs and digraphs with given valences and factors.
Discret. Math., 1973
Families of k-independent sets.
Discret. Math., 1973
On the average size of the sets in a Sperner family.
Discret. Math., 1973
1972
A generalization of Kaplansky's game.
Discret. Math., 1972
1971
An algorithm for certain multi-commodity flow problems.
Networks, 1971
Maximal sized antichains in partial orders.
Discret. Math., 1971
Some positive definite functions on sets and their application to the Ising model.
Discret. Math., 1971
1970
Optimal Design of Offshore Natural-Gas Pipeline Systems.
Oper. Res., 1970
