The following pages link to Daniel J. Kleitman (Q228778):
Displayed 50 items.
- Superantichains in the Lattice of Partitions of a Set (Q3347894) (← links)
- Pair Labellings with Given Distance (Q3348926) (← links)
- Spanning Trees with Many Leaves (Q3360890) (← links)
- Computing the Bandwidth of Interval Graphs (Q3483315) (← links)
- An algorithm for covering polygons with rectangles (Q3719852) (← links)
- Subgraphs of large connectivity and chromatic number in graphs of large chromatic number (Q3791167) (← links)
- (Q3808295) (← links)
- The Asymptotic Number of Lattices (Q3890742) (← links)
- On the Partial Sums of the Rearrangements of a Complex Series (Q3909451) (← links)
- A Monotonicity Property of Partial Orders (Q3922729) (← links)
- Some Results on Systems of Finite Sets That Satisfy a Certain Intersection Condition (Q3927254) (← links)
- (Q3941435) (← links)
- (Q3944351) (← links)
- (Q3947667) (← links)
- (Q3960781) (← links)
- Ensembles and Largest Sojourns of Random Walks (Q3963815) (← links)
- Set Orderings Requiring Costliest Alphabetic Binary Trees (Q3964022) (← links)
- A Statistical Procedure for Cluster Recognition with Application to Atlanta Leukemia-Lymphoma Data (Q3965470) (← links)
- (Q3972135) (← links)
- (Q3983256) (← links)
- A quasi-polynomial bound for the diameter\\of graphs of polyhedra (Q4005821) (← links)
- On zero-trees (Q4013413) (← links)
- Piercing convex sets (Q4020142) (← links)
- (Q4028477) (← links)
- (Q4044605) (← links)
- (Q4050598) (← links)
- Counting Trees in a Certain Class of Graphs (Q4050634) (← links)
- Asymptotic Enumeration of Partial Orders on a Finite Set (Q4055647) (← links)
- Complementary Trees and Independent Matchings (Q4063168) (← links)
- Heuristic Methods for Solving Large Scale Network Routing Problems: The Telpaking Problem (Q4071032) (← links)
- (Q4074905) (← links)
- On Dedekind's Problem: The Number of Isotone Boolean Functions. II (Q4083667) (← links)
- A Note on Some Subset Identities (Q4083668) (← links)
- The Number of Semigroups of Order n (Q4087203) (← links)
- (Q4097291) (← links)
- (Q4103577) (← links)
- Cost allocation for a spanning tree (Q4105978) (← links)
- Extensions of the Erdös-Ko-Rado Theorem (Q4108336) (← links)
- Maximal Rectilinear Crossing of Cycles (Q4119225) (← links)
- (Q4133658) (← links)
- On the Existence of Simultaneous Edge Disjoint Realizations of Degree Sequences with “Few” Edges (Q4137217) (← links)
- (Q4140761) (← links)
- Some Optimization Problems with Bulk-Service Queues (Q4159278) (← links)
- On Two-Terminal Control of a Shuttle Service (Q4166532) (← links)
- (Q4193510) (← links)
- (Q4196436) (← links)
- Algorithms for Loop Matchings (Q4198373) (← links)
- A note on maximal triangle‐free graphs (Q4271620) (← links)
- (Q4284610) (← links)
- (Q4284614) (← links)