Rolf Harren

According to our database, Rolf Harren authored at least 13 papers between 2006 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2015

Improved Lower Bound for Online Strip Packing.

Rolf Harren, Walter Kern

Theory Comput. Syst., 2015

2014

A (5/3 + ε)-approximation for strip packing.

Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee

Comput. Geom., 2014

2013

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

2012

Absolute approximation ratios for packing rectangles into bins.

Rolf Harren, Rob van Stee

J. Sched., 2012

A (5/3 + eps)-Approximation for 2D Strip Packing.

Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

Improved Lower Bound for Online Strip Packing - (Extended Abstract).

Rolf Harren, Walter Kern

Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

2010

Two-dimensional packing problems.

Rolf Harren

PhD thesis, 2010

2009

Approximation algorithms for orthogonal packing problems for hypercubes.

Rolf Harren

Theor. Comput. Sci., 2009

An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing

Rolf Harren, Rob van Stee

CoRR, 2009

Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems.

Rolf Harren, Rob van Stee

Proceedings of the Approximation, 2009

2008

Approximation Algorithms for 3D Orthogonal Knapsack.

Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas

J. Comput. Sci. Technol., 2008

Packing Rectangles into 2OPT Bins Using Rotations.

Rolf Harren, Rob van Stee

Proceedings of the Algorithm Theory, 2008

2006

Approximating the Orthogonal Knapsack Problem for Hypercubes.

Rolf Harren

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006