Journal of Parallel and Distributed Computing
Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity
Graphs and Combinatorics
A new constraint programming approach for the orthogonal packing problem
Computers and Operations Research
An optimal bound for two dimensional bin packing
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
On packing squares into a rectangle
Computational Geometry: Theory and Applications
| Hi-index | 5.23 |
We formulate a generalization of the NP-complete rectangle packing problem by parameterizing it in terms of packing density, the ratio of rectangle areas, and the aspect ratio of individual rectangles. Then we show that almost all restrictions of this problem remain NP-complete and identify some cases where the answer to the decision problem can be found in constant time.