Homepage
- Approximation Algorithms
- Cutting and Packing
- Combinatorial Optimization
You can find my publications in the list below or in the MPII publications database.
The copyright for my publications is reserved by the respective copyright holder. Where a pre-print, author-prepared or revised version of a paper is provided, this is done with permission of the publisher as a means of timely communication among scholars, without permission for further distribution. The definitive version of a paper is the published version.
Journal Papers:
- Rolf Harren and Rob van Stee (2009):
Absolute Approximation Ratios for Packing Rectangles into Bins [pdf (author-generated version)]
JoS: Journal of Scheduling
© Springer-Verlag 2009, JoS: Journal of Scheduling, 15(1), pp. 63-75
(A preliminary version was published in SWAT 2008, see Conference Papers)
- Rolf Harren (2009):
Approximation Algorithms for Orthogonal Packing Problems for Hypercubes [pdf (author-generated version)]
TCS: Theoretical Computer Science
© Elsivier B.V. 2009, TCS: Theoretical Computer Science, 410(44), pp. 4504-4532
(A preliminary version was published in ICALP 2006, see Conference Papers)
- Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle and Henning Thomas (2008):
Approximation Algorithms for 3D Orthogonal Knapsack [pdf (author-generated version)]
JCST: Journal of Computer Science and Technology
© Springer-Verlag 2008, JCST: Journal of Computer Science and Technology, 23(5), pp. 749-762
(A preliminary version was published in TAMC 2007, see Conference Papers)
Conference Papers:
- Rolf Harren and Walter Kern (2011):
Improved Lower Bound for Online Strip Packing - (Extended Abstract) [pdf (author-generated version)]
WAOA 2011: Proceedings of the 9th International Workshop on Algorithms and Online Algorithms
© Springer-Verlag 2011, LNCS 7164, pp. 211-218
- Rolf Harren, Klaus Jansen, Lars Prädel, and Rob van Stee (2011):
A (5/3 + Epsilon)-Approximation for Strip Packing [pdf (author-generated version)]
WADS 2011: Proceedings of the 12th International Symposium on Algorithms and Data Structures
© Springer-Verlag 2011, LNCS 6844, pp. 475-487
- Rolf Harren and Rob van Stee (2009):
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems [pdf (author-generated version), Errata]
APPROX 2009: Proceedings of the 12th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
© Springer-Verlag 2009, LNCS 5687, pp. 177-189
(A preliminary version containing the full bin packing result can be found here: arXiv:0903.2265v1)
- Rolf Harren and Rob van Stee (2008):
Packing Rectangles into 2 OPT Bins using Rotations [pdf (author-generated version)]
SWAT 2008: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory
© Springer-Verlag 2008, LNCS 5124, pp. 306-318
- Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle and Henning Thomas (2007):
Approximation Algorithms for 3D Orthogonal Knapsack [pdf (author-generated version)]
TAMC 2007: Proceedings of the 4th International Conference on Theory and Applications of Models of Computation
© Springer-Verlag 2007, LNCS 4484, pp. 34-45
- Rolf Harren (2006):
Approximating the Orthogonal Knapsack Problem for Hypercubes [revised pdf (with Appendix)]
ICALP 2006: Proceedings of the 33rd International Colloquium on Automata, Languages and Programming
© Springer-Verlag 2006, LNCS 4052, pp. 238-249
Technical Reports:
- Rolf Harren (2005):
Constant Ratio Approximation Algorithms for Weighted Single Container Packing [revised pdf]
IPSJ SIG Technical Reports, 2005-AL-103, 49-56. Yamaguchi, Japan
- Rolf Harren (2005):
Weighted Rectangle and Cuboid Packing [revised pdf]
Student Research Paper (Studienarbeit)
Theses:
- Rolf Harren (2007):
Mehrdimensionale Packungsprobleme - Approximation geometrischer Verallgemeinerungen klassischer Packungsprobleme
Published version of my diploma thesis (comparable to master's thesis) (in German)
© VDM Verlag Dr. Müller, 2007
- Rolf Harren (2006):
Approximation mehrdimensionaler Packungsprobleme
Diploma thesis (comparable to master's thesis) (in German)
My Erdős-Bacon number of at most 6. For those people that are unfamiliar with this concept: The Erdős number counts the collaborative distance, in regard to scientific papers, between an author and Erdős. Similarly, the Bacon number counts the degree of separation from the actor Kevin Bacon, as defined in the movie Six degrees of separation. The Erdős-Bacon number is given by the sum of the Erdős number and the Bacon number.
- A scientific path is Paul Erdős - Zsolt Tuza - Klaus Jansen - me, making my Erdős number at most 3.
- A cinematic path starts with Kevin Bacon who was in Loverboy (2005) with Blair Brown who was in Strapless (1989) with Bruno Ganz with whom I acted as an uncredited extra in Baruto no Gakuen (2006) making my Bacon number at most 3 as well.
Wikipedia points out that the smallest known Erdős-Bacon number is 3, making 6 a reasonably low number on level with, i.e. Richard Feynman and beating, i.e. Stephen Hawking.
