Deppert, Max A.; Jansen, Klaus; Khan, Arindam; Rau, Malin; Tutas, Malte Peak demand minimization via sliced strip packing. (English) Zbl 07777567 Algorithmica 85, No. 12, 3649-3679 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{M. A. Deppert} et al., Algorithmica 85, No. 12, 3649--3679 (2023; Zbl 07777567) Full Text: DOI OA License
Gálvez, Waldo; Grandoni, Fabrizio; Ameli, Afrouz Jabal; Jansen, Klaus; Khan, Arindam; Rau, Malin A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing. (English) Zbl 07746794 Algorithmica 85, No. 10, 3088-3109 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{W. Gálvez} et al., Algorithmica 85, No. 10, 3088--3109 (2023; Zbl 07746794) Full Text: DOI
Gálvez, Waldo; Grandoni, Fabrizio; Ameli, Afrouz Jabal; Jansen, Klaus; Khan, Arindam; Rau, Malin A tight \((3/2+\varepsilon)\) approximation for skewed strip packing. (English) Zbl 07758346 Byrka, Jarosław (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 23rd international conference, APPROX 2020, and 24th international conference, RANDOM 2020, August 17–19, 2020, Virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 176, Article 44, 18 p. (2020). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{W. Gálvez} et al., LIPIcs -- Leibniz Int. Proc. Inform. 176, Article 44, 18 p. (2020; Zbl 07758346) Full Text: DOI
Jansen, Klaus; Lassota, Alexandra; Rohwedder, Lars Near-linear time algorithm for \(n\)-fold ILPs via color coding. (English) Zbl 1462.68232 SIAM J. Discrete Math. 34, No. 4, 2282-2299 (2020). MSC: 68W05 68W40 90C10 PDFBibTeX XMLCite \textit{K. Jansen} et al., SIAM J. Discrete Math. 34, No. 4, 2282--2299 (2020; Zbl 1462.68232) Full Text: DOI arXiv
Henning, Sören; Jansen, Klaus; Rau, Malin; Schmarje, Lars Complexity and inapproximability results for parallel task scheduling and strip packing. (English) Zbl 1477.68119 Theory Comput. Syst. 64, No. 1, 120-140 (2020). Reviewer: Roberto Solis-Oba (London) MSC: 68Q17 68W25 90B35 90C27 PDFBibTeX XMLCite \textit{S. Henning} et al., Theory Comput. Syst. 64, No. 1, 120--140 (2020; Zbl 1477.68119) Full Text: DOI arXiv
Jansen, Klaus; Rau, Malin Closing the gap for pseudo-polynomial strip packing. (English) Zbl 07525499 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 62, 14 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{K. Jansen} and \textit{M. Rau}, LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 62, 14 p. (2019; Zbl 07525499) Full Text: DOI arXiv
Jansen, Klaus; Rau, Malin Improved approximation for two dimensional strip packing with polynomial bounded width. (English) Zbl 1430.68449 Theor. Comput. Sci. 789, 34-49 (2019). MSC: 68W25 90C27 PDFBibTeX XMLCite \textit{K. Jansen} and \textit{M. Rau}, Theor. Comput. Sci. 789, 34--49 (2019; Zbl 1430.68449) Full Text: DOI arXiv
Jansen, Klaus; Klein, Kim-Manuel; Kosche, Maria; Ladewig, Leon Online strip packing with polynomial migration. (English) Zbl 1467.68223 Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 20th international workshop, APPROX 2017 and 21st international workshop, RANDOM 2017, Berkeley, CA, USA, August 16–18, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 81, Article 13, 18 p. (2017). MSC: 68W27 68W25 90C27 PDFBibTeX XMLCite \textit{K. Jansen} et al., LIPIcs -- Leibniz Int. Proc. Inform. 81, Article 13, 18 p. (2017; Zbl 1467.68223) Full Text: DOI arXiv
Jansen, Klaus; Rau, Malin Improved approximation for two dimensional strip packing with polynomial bounded width. (English) Zbl 1427.68368 Poon, Sheung-Hung (ed.) et al., WALCOM: algorithms and computation. 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10167, 409-420 (2017). MSC: 68W25 90C27 PDFBibTeX XMLCite \textit{K. Jansen} and \textit{M. Rau}, Lect. Notes Comput. Sci. 10167, 409--420 (2017; Zbl 1427.68368) Full Text: DOI arXiv
Harren, Rolf; Jansen, Klaus; Prädel, Lars; van Stee, Rob A \((5/3+\varepsilon)\)-approximation for strip packing. (English) Zbl 1283.52024 Comput. Geom. 47, No. 2, Part B, 248-267 (2014). MSC: 52C15 68W25 PDFBibTeX XMLCite \textit{R. Harren} et al., Comput. Geom. 47, No. 2, Part B, 248--267 (2014; Zbl 1283.52024) Full Text: DOI
Harren, Rolf; Jansen, Klaus; Prädel, Lars; Schwarz, Ulrich M.; Van Stee, Rob Two for one: tight approximation of 2D bin packing. (English) Zbl 1291.68431 Int. J. Found. Comput. Sci. 24, No. 8, 1299-1327 (2013). MSC: 68W25 90C27 PDFBibTeX XMLCite \textit{R. Harren} et al., Int. J. Found. Comput. Sci. 24, No. 8, 1299--1327 (2013; Zbl 1291.68431) Full Text: DOI
Jansen, Klaus; Prädel, Lars; Schwarz, Ulrich M. Two for one: tight approximation of 2D bin packing. (English) Zbl 1253.68361 Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 399-410 (2009). MSC: 68W25 90C27 90C59 PDFBibTeX XMLCite \textit{K. Jansen} et al., Lect. Notes Comput. Sci. 5664, 399--410 (2009; Zbl 1253.68361) Full Text: DOI