Téléversements by Mnaom

Rolf Harren- Approximating the Orthogonal Knapsack Problem for Hypercubes

F. K. Miyazawa and Y. Wakabayashi- Two- and Three-dimensional Parametric Packing

Xin Han et al- A New Upper Bound on 2D Online Bin Packing

Giorgio Fasano- MIP-based heuristic for non-standard 3D-packing problems

Nils Schweer- Algorithms for Packing Problems

E.G. Coffman Jr, Peter J. Downey and Peter Winkler- Packing Rectangles in a Strip

Rolf Harren- Two-Dimensional Packing Problems

Sandor P. Fekete, Tom Kamphans and Nils Schweer- Online Square Packing

Xin Han, Kazuo Iwama, Deshi Ye and Guochuan Zhang- Strip Packing vs. Bin Packing

Kari J. Nurmela and Patric R.J. Ostergard- Optimal Packings of Equal Circles in a Square

Therese Biedl et al- Unfolding Some Classes of Orthogonal Polyhedra

Prosenjit Bose et al- Cutting Circles into Equal Area Pieces

Tudor Zamfirescu- On Some Questions about Convex Surfaces

Gunter Rote- Curves with Increasing Chords

Christian Icking, Rolf Klein and Elmar Langetepe- Self-Approaching Curves

Joel A. Haddley- Infinite Families of Monohedral Disk Tilings

Fan Chung and Ron Graham- Packing equal squares into a large square

Philippe Decaudin and Fabrice Neyret- Packing Square Tiles into One Texture

Thierry Gensane and Philippe Ryckelynck- On the Maximal Inflation of Two Squares

Wolfram Bentz- Optimal Packings of 13 and 46 Unit Squares in a Square

Michael J Kearney and Peter Shiu- Efficient packing of unit squares in a square

Walter Stromquist- Packing 10 or 11 Unit Squares in a Square

Hiroshi Nagamochi- Packing Unit Squares in a Rectangle

Michael D. Moffitt and Martha E. Pollack- Optimal Rectangle Packing

Florian Diedrich et al- Approximation Algorithms for 3D Orthogonal Knapsack

F.K. Miyazawa and Y.Wakabayashi- Three-dimensional packings with rotations

Miroslav Chlebik and Janka Chlebikova- Hardness of approximation for orthogonal rectangle packing and covering problems

Rolf Harren- Weighted Rectangle and Cuboid Packing

Klaus Jansen and Guochuan Zhang- On Rectangle Packing

Xin Han, Kazuo Iwama and Guochuan Zhang- New Upper Bounds on The Approximability of 3D Strip Packing

Klaus Jansen and Rob van Stee- On Strip Packing With Rotations

Steven S. Selden and Rob van Stee- New Bounds for Multi-dimensional Packing

Leah Epstein, Asaf Levin and Rob van Stee- Multi-dimensional packing with conflicts

Jose R. Correa and Claire Kenyon- Approximation Schemes for Multidimensional Packing

Matthew Hyde- A Genetic Programming Hyper-Heuristic Approach to Automated Packing

Rolf Harren and Rob van Stee- An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing

Nikhil Bansal et al- Bin Packing in Multiple Dimensions

Klaus Jansen and Guochuan Zhang- Maximizing the Total Profit of Rectangles Packed into a Rectangle

Rolf Harren and Rob van Stee- Absolute Approximation Ratios for Packing Rectangles into Bins

Chen Chuan-bo and He Da-hua- A heuristic method for solving triangle packing problem

Raphael Yuster- Disjoint Color-Avoiding Triangles

Peter Keevash and Benny Sudakov- Packing Triangles in a Graph and Its Complement

David A. Grable- On Random Greedy Triangle Packing

Tom Bohman, Alan Frieze and Eyal Lubetzky- A note on the random greedy triangle-packing algorithm

Xin Han, Kazuo Iwama and Guochuan Zhang- Online Removable Square Packing

Yoshiharu Kohayakawa et al- Multidimensional Cube Packing

Xin Han, Deshi Ye and Yong Zhou- Improved Online Hypercube Packing

Yuqin Zhang and Yonghui Fan- Packing and covering a unit equilateral triangle with equilateral triangles

P. Erdos and R.L. Graham- On Packing Squares with Equal Squares