13.21.5 H.5. Packing, covering, etc.

Chapter Contents (Back)

Coffman Jr., E.G., Gilbert, E.N.,
Dynamic, First-Fit Packings In Two Or More Dimensions,
IC(61), 1984, pp. 1-14. BibRef

Wijshoff, H.A.G., van Leeuwen, J.,
Arbitrary Versus Periodic Storage Schemes And Tessellations Of The Plane Using One Type Of Polyomino,
IC(62), 1984, pp. 1-25. BibRef

Franzblau, D.S., Kleitman, D.J.,
An Algorithm For Covering Polygons With Rectangles,
IC(63), 1984, pp. 164-184. BibRef

Johnson, D.S., Garey, M.R.,
A 71/60 Theorem For Bin Packing,
J. COMPLEXITY(1), 1985, pp. 65-106. BibRef

Hertel, S., Mehlhorn, K.,
Fast Triangulation Of The Plane With Respect To Simple Polygons,
IC(64), 1985, pp. 52-76. BibRef

Keil, J.M.,
Decomposing A Polygon Into Simpler Components,
SIAM JC(14), 1985, pp. 799-817. BibRef

Alon, N., Kleitman, D.J.,
Covering A Square By Small Perimeter Rectangles,
DCG(1), 1986, pp. 1-7. BibRef

Debrunner, H.E., Mani-Levitska, P.,
Can You Cover Your Shadows?,
DCG(1), 1986, pp. 45-58. BibRef

Pach, J.,
Covering The Plane With Convex Polygons,
DCG(1), 1986, pp. 73-81. BibRef

Schmeck, H.,
On The Maximum Edge Length In Vlsi Layouts Of Complete Binary Trees,
IPL (23), 1986, pp. 19-23. BibRef

Strickland, R.N.,
An Algorithm For Generating Connected Quadrilaterals Of Specified Area,
C&G(10), 1986, pp. 151-155. BibRef

Asano, T., Asano, T., Pinter, R.Y.,
Polygon Triangulation: Efficiency And Minimality,
J. ALGORITHMS(7), 1986, pp. 221-231. BibRef

Segenreich, S.A., Faria Braga, L.M.P.,
Optimal Nesting Of General Plane Figures: A Monte Carlo Heuristical Approach,
C&G(10), 1986, pp. 229-237. BibRef

Csirik, J., Galambos, G.,
An O(N) Bin-Packing Algorithm For Uniformly Distributed Data,
COMPUTING(36), 1986, pp. 313-319. BibRef

Chlebus, B.S.,
Domino-Tiling Games,
JCSS(32), 1986, pp. 374-392. BibRef

Friesen, D.K., Langston, M.A.,
Variable Sized Bin Packing,
SIAM JC(15), 1986, pp. 222-230. BibRef

Melter, R.A.,
Tessellation Graph Characterization Using Rosettas,
PRL(4), 1986, pp. 79-85. BibRef

Asano, T., Asano, T., Imai, H.,
Partitioning A Polygonal Region Into Trapezoids,
J. ACM(33), 1986, pp. 290-312. BibRef

Ahuja, N.,
Efficient Planar Embedding Of Trees For Vlsi Layouts,
CVGIP(34), 1986, pp. 189-203. BibRef

Maass, W.,
On The Complexity Of Nonconvex Covering,
SIAM JC(15), 1986, pp. 453-467. BibRef

Keil, J.M.,
Minimally Covering A Horizontally Convex Orthogonal Polygon,
CG(86), pp. 43-51. BibRef

Levopoulos, C.,
Fast Heuristics For Minimum Length Rectangular Partitions Of Polygons,
CG(86), pp. 100-108. BibRef

Vijayan, G.,
Geometry Of Planar Graphs With Angles,
CG(86), pp. 116-124. BibRef

Floyd, S., Karp, R.,
Ffd Bin Packing For Item Sizes With Distributions In [0, 1/2],
SFCS(86), pp. 322-330. BibRef

Chapter on Rosenfeld Bibliography for 1986 continues in
I. Texture .

Last update:Jun 7, 2018 at 10:14:50