Author of the publication

Approximation Algorithms for Demand Strip Packing.

, , , and . APPROX-RANDOM, volume 207 of LIPIcs, page 20:1-20:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Symmetry Exploitation for Online Machine Covering with Bounded Migration., , and . ACM Trans. Algorithms, 16 (4): 43:1-43:22 (2020)Symmetry Exploitation for Online Machine Covering with Bounded Migration., , and . ESA, volume 112 of LIPIcs, page 32:1-32:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Node Connectivity Augmentation of Highly Connected Graphs., , , and . CoRR, (2023)A 3-Approximation Algorithm for Maximum Independent Set of Rectangles., , , , , and . SODA, page 894-905. SIAM, (2022)Machine Covering in the Random-Order Model., , and . ISAAC, volume 212 of LIPIcs, page 52:1-52:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More., , , , and . SoCG, volume 189 of LIPIcs, page 39:1-39:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Machine Covering in the Random-Order Model., , and . Algorithmica, 85 (6): 1560-1585 (June 2023)On the Cycle Augmentation Problem: Hardness and Approximation Algorithms., , , and . Theory Comput. Syst., 65 (6): 985-1008 (2021)Approximation Schemes for Packing Problems with ℓ p-norm Diversity Constraints., and . LATIN, volume 13568 of Lecture Notes in Computer Science, page 204-221. Springer, (2022)A Tight (3/2+ε )-Approximation for Skewed Strip Packing., , , , , and . Algorithmica, 85 (10): 3088-3109 (October 2023)