Approximating the Orthogonal Knapsack Problem for Hypercubes. - Rolf Harren (ICALP (1), 2006)

Packing Rectangles into 2OPT Bins Using Rotations. - Rolf Harren; Rob van Stee (SWAT, 2008)

Approximation Algorithms for 3D Orthogonal Knapsack. - Florian Diedrich; Rolf Harren; Klaus Jansen; Ralf Thöle; Henning Thomas (J. Comput. Sci. Technol., 2008)

Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems. - Rolf Harren; Rob van Stee (APPROX-RANDOM, 2009)

An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing - Rolf Harren; Rob van Stee (CoRR, 2009)

Approximation algorithms for orthogonal packing problems for hypercubes. - Rolf Harren (Theor. Comput. Sci., 2009)

Two-dimensional packing problems. - Rolf Harren (2010)

Improved Lower Bound for Online Strip Packing - (Extended Abstract). - Rolf Harren; Walter Kern (WAOA, 2011)

A (5/3 + eps)-Approximation for 2D Strip Packing. - Rolf Harren; Klaus Jansen; Lars Prädel; Rob van Stee (CTW, 2012)

Absolute approximation ratios for packing rectangles into bins. - Rolf Harren; Rob van Stee (J. Sched., 2012)

Two for One: Tight Approximation of 2D Bin Packing. - Rolf Harren; Klaus Jansen; Lars Prädel; Ulrich M. Schwarz; Rob van Stee (Int. J. Found. Comput. Sci., 2013)

A (5/3 + ε)-approximation for strip packing. - Rolf Harren; Klaus Jansen; Lars Prädel; Rob van Stee (Comput. Geom., 2014)

Improved Lower Bound for Online Strip Packing. - Rolf Harren; Walter Kern (Theory Comput. Syst., 2015)