A multitype random sequential processMELLEIN, B; MOLA, E. E.Journal of mathematical physics. 1985, Vol 26, Num 3, pp 514-521, issn 0022-2488Article

The packing problem for projective geometries over GF(3) with dimension greater than fiveGAMES, R. A.Journal of combinatorial theory. Series A. 1983, Vol 35, Num 2, pp 126-144, issn 0097-3165Article

Multidimensional cube packingKOHAYAKAWA, Yoshiharu; MIYAZAWA, Flavio Keidi; RAGHAVAN, Prabhakar et al.Algorithmica. 2004, Vol 40, Num 3, pp 173-187, issn 0178-4617, 15 p.Article

Partially dynamic bin packing can be solved within 1 + ε in (amortized) polylogarithmic timeIVKOVIC, Z; LLOYD, E. L.Information processing letters. 1997, Vol 63, Num 1, pp 45-50, issn 0020-0190Article

Packings by cliques and by finite families of graphsHELL, P; KIRKPATRICK, D. G.Discrete mathematics. 1984, Vol 49, Num 1, pp 45-59, issn 0012-365XArticle

TCG-S: Orthogonal coupling of P*-admissible representations for general floorplansLIN, Jai-Ming; CHANG, Yao-Wen.Design automation conference. 2002, pp 842-847, isbn 1-58113-461-4, 6 p.Conference Paper

Bin packing problems in one dimension: heuristic solutions and confidence intervalsHALL, N. G; GHOSH, S; KANKEY, R. D et al.Computers & operations research. 1988, Vol 15, Num 2, pp 171-177, issn 0305-0548Article

A packing problem you can almost solve by sitting on your switcaseHOCHBAUM, D. S; SHMOYS, D. B.SIAM journal on algebraic and discrete methods. 1986, Vol 7, Num 2, pp 247-257, issn 0196-5212Article

Parametric lower bound for on-line bin-packingGALAMBOS, G.SIAM journal on algebraic and discrete methods. 1986, Vol 7, Num 3, pp 362-367, issn 0196-5212Article

Is a local description of stable 2D random packing possible?BURGOS, E; BONADEO, H.Journal of physics. A, mathematical and general. 1986, Vol 19, Num 15, pp L913-L915, issn 0305-4470Article

Fully dynamic algorithms for bin packing : Being (mostly) myopic helpsIVKOVIC, Z; LLOYD, E. L.SIAM journal on computing (Print). 1999, Vol 28, Num 2, pp 574-611, issn 0097-5397Article

A fundamental restriction on fully dynamic maintenance of bin packingIVKOVIC, Z; LLOYD, E. L.Information processing letters. 1996, Vol 59, Num 4, pp 229-232, issn 0020-0190Article

Determining an upper bound for a class of rectangular packing problemsDOWSLAND, K. A.Computers & operations research. 1985, Vol 12, Num 2, pp 201-205, issn 0305-0548Article

Convergence of optimal stochastic bin packingRHEE, W. T.Operations research letters. 1985, Vol 4, Num 3, pp 121-123, issn 0167-6377Article

New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientationCARLIER, Jacques; CLAUTIAUX, Francois; MOUKRIM, Aziz et al.Computers & operations research. 2007, Vol 34, Num 8, pp 2223-2250, issn 0305-0548, 28 p.Article

The three-dimensional pallet chart: and analysis of the factors affecting the set of feasible layouts for a class of two-dimensional packing problemsDOWSLAND, K. A.The Journal of the Operational Research Society. 1984, Vol 35, Num 10, pp 895-905, issn 0160-5682Article

Random sequential bisection and its associated binary treeSIBUYA, M; ITOH, Y.Annals of the Institute of Statistical Mathematics. 1987, Vol 39, Num 1, pp 69-84, issn 0020-3157Article

Bin packing as a random walk: a note on Knödel's paperCSIRIK, J.Operations research letters. 1986, Vol 5, Num 3, pp 161-163, issn 0167-6377Article

A probabilistic analysis of the Next Fit Decreasing bin packing heuristicCSIRIK, J; GALAMBOS, G; FRENK, J. B. G et al.Operations research letters. 1986, Vol 5, Num 5, pp 233-236, issn 0167-6377Article

A Robust APTAS for the Classical Bin Packing ProblemEPSTEIN, Leah; LEVIN, Asaf.Lecture notes in computer science. 2006, pp 214-225, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

Two dimensional packing: The power of rotationEPSTEIN, Leah.Lecture notes in computer science. 2003, pp 398-407, issn 0302-9743, isbn 3-540-40671-9, 10 p.Conference Paper

Dynamic and leakage power reduction in MTCMOS circuits using an automated efficient gate clustering techniqueANIS, Mohab; AREIBI, Shawki; MAHMOUD, Mohamed et al.Design automation conference. 2002, pp 480-485, isbn 1-58113-461-4, 6 p.Conference Paper

Some properties in the packing of equal circles in a squareMOLLARD, M; PAYAN, C.Discrete mathematics. 1990, Vol 84, Num 3, pp 303-307, issn 0012-365XArticle

Optimal bin packing with items of random sizesRHEE, W. T.Mathematics of operations research. 1988, Vol 13, Num 1, pp 140-151, issn 0364-765XArticle

Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problemFRENK, J. B. G; GALAMBOS, G.Computing (Wien. Print). 1987, Vol 39, Num 3, pp 201-217, issn 0010-485XArticle