Rolf Harren

15 papers B 2C 2Journal 7Unranked 3
YearRankTypeTitle / Venue / Authors
2015 J jnl
Improved Lower Bound for Online Strip Packing.
Theory Comput. Syst.
Rolf Harren, Walter Kern
2014 J jnl
A (5/3 + ε)-approximation for strip packing.
Comput. Geom.
Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee
2013 J jnl
Two for One: Tight Approximation of 2D Bin Packing.
Int. J. Found. Comput. Sci.
Rolf Harren, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Rob van Stee
2012 C conf
A (5/3 + eps)-Approximation for 2D Strip Packing.
CTW
Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee
2012 J jnl
Absolute approximation ratios for packing rectangles into bins.
J. Sched.
Rolf Harren, Rob van Stee
2011 B conf
A (5/3 + ε)-Approximation for Strip Packing.
WADS
Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee
2011 B conf
Improved Lower Bound for Online Strip Packing - (Extended Abstract).
WAOA
Rolf Harren, Walter Kern
2010 — —
Two-dimensional packing problems.
Rolf Harren
2009 J jnl
An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing
CoRR
Rolf Harren, Rob van Stee
2009 J jnl
Approximation algorithms for orthogonal packing problems for hypercubes.
Theor. Comput. Sci.
Rolf Harren
2009 — conf
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems.
APPROX-RANDOM
Rolf Harren, Rob van Stee
2008 J jnl
Approximation Algorithms for 3D Orthogonal Knapsack.
J. Comput. Sci. Technol.
Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas
2008 — conf
Packing Rectangles into 2OPT Bins Using Rotations.
SWAT
Rolf Harren, Rob van Stee
2007 C conf
Approximation Algorithms for 3D Orthogonal Knapsack.
TAMC
Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas
2006 — conf
Approximating the Orthogonal Knapsack Problem for Hypercubes.
ICALP (1)
Rolf Harren