Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

CPC
2000

favoriteEmaildiscussreport

58views more CPC 2000»

Packing Ferrers Shapes

13 years 4 months ago

Packing Ferrers Shapes

Download www.cs.tau.ac.il

Answering a question of Wilf, we show that if n is sufficiently large, then one cannot cover an n

Noga Alon, Miklós Bóna, Joel Spencer

Real-time Traffic

CPC 2000 | Distinct Ferrers | Rectangle | Sufficiently Large |

claim paper

Related Content

» Improving Dense Packings of Equal Disks in a Square

» Application of a ModelFree Algorithm for the Packing of Irregular Shaped Objects in Semico...

» Modelling Search Strategies in Rules2CP

» A squeaky wheel optimisation methodology for twodimensional strip packing

» Topology constrained rectilinear block packing for layout reuse

» A Novel Delaunay Simplex Technique for Detection of Crystalline Nuclei in Dense Packings o...

» Geometrical Characterization of Various Shaped 3DAggregates of Primary Spherical Particule...

» High Quality Anisotropic Tetrahedral Mesh Generation Via Ellipsoidal Bubble Packing

» Optimal Rectangle Packing Initial Results

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2000
Where	CPC
Authors	Noga Alon, Miklós Bóna, Joel Spencer

Comments (0)