Some sequences associated with combinatoral structures
Discrete Mathematics
On k-optimum dipath partitions and partial k-colourings of acyclic diagraphs
European Journal of Combinatorics
The d-step conjecture and its relatives
Mathematics of Operations Research
Art gallery theorems and algorithms
Art gallery theorems and algorithms
Collections of sets without unions and intersections
Proceedings of the third international conference on Combinatorial mathematics
On the number of databases and closure operations
Theoretical Computer Science
Partitioning a power set into union-free classes
Discrete Mathematics
A subexponential randomized simplex algorithm (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A subexponential bound for linear programming
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Discrete Mathematics
Orthogonal structures in directed graphs
Journal of Combinatorial Theory Series B
Asymptotic enumeration of full graphs
Journal of Graph Theory
Sperner theory
Finite algebras of finite complexity
Discrete Mathematics
Confirming the Kleitman-Winston conjecture on the largest coefficient in a q-Catalan number
Journal of Combinatorial Theory Series A
Asymptotic enumeration, global structure, and constrained evolution
Discrete Mathematics
On partitions of discrete boxes
Discrete Mathematics - Kleitman and combinatorics: a celebration
Proofs from THE BOOK
Entropy and enumeration of Boolean functions
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Daniel Kleitman's many research contributions are surveyed, with emphasis on extremal hypergraph theory, asymptotic enumeration, and discrete geometry.