- Home
- Best Scientists - Mathematics
- Daniel J. Kleitman

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
41
Citations
8,050
164
World Ranking
1281
National Ranking
588

Computer Science
D-index
41
Citations
7,937
155
World Ranking
5483
National Ranking
2685

1973 - Fellow of the American Academy of Arts and Sciences

- Combinatorics
- Discrete mathematics
- Algebra

His primary scientific interests are in Combinatorics, Discrete mathematics, Upper and lower bounds, Finite set and Bipartite graph. Daniel J. Kleitman studies Combinatorics, focusing on Degree in particular. As part of his studies on Discrete mathematics, Daniel J. Kleitman frequently links adjacent subjects like Lattice.

He has included themes like Extreme point, Polyhedron, Quasi-polynomial and Linear inequality in his Upper and lower bounds study. His Finite set research includes themes of Computer-assisted proof, Hereditarily finite set and Algebra. Daniel J. Kleitman interconnects Base, Planarity testing and Loop in the investigation of issues within Algorithm.

- Algorithms for Loop Matchings (522 citations)
- Families of k-independent sets (220 citations)
- The structure of sperner k-families (190 citations)

Daniel J. Kleitman mainly focuses on Combinatorics, Discrete mathematics, Conjecture, Upper and lower bounds and Finite set. His Combinatorics research is multidisciplinary, relying on both Family of sets, Plane and Order. His studies link Intersection with Family of sets.

Daniel J. Kleitman frequently studies issues relating to General position and Plane. His Discrete mathematics study incorporates themes from Algorithm, Lattice and Partition. His Graph and Vertex and Multiple edges investigations all form part of his Graph research activities.

- Combinatorics (71.84%)
- Discrete mathematics (56.90%)
- Conjecture (9.20%)

- Combinatorics (71.84%)
- Discrete mathematics (56.90%)
- Conjecture (9.20%)

Daniel J. Kleitman spends much of his time researching Combinatorics, Discrete mathematics, Conjecture, Plane and Upper and lower bounds. His work in the fields of Combinatorics, such as Chordal graph, Multiple edges and Complete graph, overlaps with other areas such as Aesthetic experience and Raising. His Discrete mathematics research is multidisciplinary, incorporating elements of Intersection, Partition and Greedy algorithm.

The Conjecture study combines topics in areas such as Fractional part, Combinatorial proof, Constructive proof and Real number. His work is dedicated to discovering how Plane, General position are connected with Spatial network, Disjoint sets, Forcing and Embedding and other disciplines. The study incorporates disciplines such as Nested triangles graph, Shuffling, Permutation and Maximal independent set in addition to Upper and lower bounds.

- MSARI: Multiple sequence alignments for statistical detection of RNA secondary structure (83 citations)
- Six Lonely Runners (34 citations)
- Convex Sets in the Plane with Three of Every Four Meeting (34 citations)

- Combinatorics
- Algebra
- Discrete mathematics

Daniel J. Kleitman mainly investigates Combinatorics, Discrete mathematics, Conjecture, Plane and General position. Combinatorics is represented through his Partition and Rado graph research. His work carried out in the field of Discrete mathematics brings together such families of science as Automated theorem proving and Greedy algorithm.

His Conjecture research incorporates elements of Fractional part, Combinatorial proof, Intersection and Real number. His research in Plane intersects with topics in Without loss of generality, Intersection, Convex hull, Finite collection and Radon's theorem. His research combines Upper and lower bounds and General position.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Algorithms for Loop Matchings

Ruth Nussinov;George Pieczenik;Jerrold R. Griggs;Daniel J. Kleitman.

Siam Journal on Applied Mathematics **(1978)**

824 Citations

Families of k-independent sets

Daniel J. Kleitman;Joel Spencer.

Discrete Mathematics **(1973)**

333 Citations

Proof techniques in the theory of finite sets

Curtis Greene;Daniel J. Kleitman.

**(1978)**

313 Citations

The structure of sperner k-families

Curtis Greene;Daniel J Kleitman.

Journal of Combinatorial Theory, Series A **(1976)**

294 Citations

Asymptotic enumeration of partial orders on a finite set

D. J. Kleitman;B. L. Rothschild.

Transactions of the American Mathematical Society **(1975)**

292 Citations

Traditional Galleries Require Fewer Watchmen

J. Kahn;M. Klawe;D. Kleitman.

Siam Journal on Algebraic and Discrete Methods **(1983)**

276 Citations

Spanning trees with many leaves

Daniel J. Kleitman;Douglas B. West.

SIAM Journal on Discrete Mathematics **(1991)**

253 Citations

Coping with errors in binary search procedures

Ronald L. Rivest;Albert R. Meyer;Daniel J. Kleitman;Karl Winklmann.

Journal of Computer and System Sciences **(1980)**

252 Citations

Algorithms for constructing graphs and digraphs with given valences and factors

D. J. Kleitman;D. L. Wang.

Discrete Mathematics **(1973)**

245 Citations

The crossing number of K5,n

Daniel J. Kleitman;Daniel J. Kleitman.

Journal of Combinatorial Theory, Series A **(1970)**

237 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Tel Aviv University

University of Illinois at Urbana-Champaign

Courant Institute of Mathematical Sciences

MIT

University of Illinois at Urbana-Champaign

Seer

Broad Institute

Hebrew University of Jerusalem

Columbia University

Institut National des Sciences Appliquées de Lyon

Apple (United States)

École Polytechnique

Federal University of São Carlos

Nagoya Institute of Technology

Zoological Society of London

University of Massachusetts Medical School

University of Wollongong

Icahn School of Medicine at Mount Sinai

University of California, San Diego

University of North Carolina at Chapel Hill

University of Kentucky

Aarhus University

McGill University

University of Pennsylvania

Something went wrong. Please try again later.