Author of the publication

Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded Width.

, and . WALCOM, volume 10167 of Lecture Notes in Computer Science, page 409-420. Springer, (2017)

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

Hardness and Tight Approximations of Demand Strip Packing., , and . SPAA, page 479-489. ACM, (2024)Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times., , , and . ITCS, volume 124 of LIPIcs, page 44:1-44:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Useful Structures and How to Find Them: Hardness and Approximation Results for Various Variants of the Parallel Task Scheduling Problem (Nützliche Strukturen und wie sie zu finden sind: Nicht Approximierbarkeit und Approximationen für diverse Varianten des Parallel Task Scheduling Problems). Kiel University, Germany, (2019)base-search.net (ftunivkiel:oai:macau.uni-kiel.de:macau_mods_00000126).Solving Packing Problems with Few Small Items Using Rainbow Matchings., , , , , , and . MFCS, volume 170 of LIPIcs, page 11:1-11:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Scheduling with Many Shared Resources., , , , and . IPDPS, page 413-423. IEEE, (2023)Asynchronous Opinion Dynamics in Social Networks., , , , , and . AAMAS, page 109-117. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), (2022)Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing., and . Euro-Par, volume 11725 of Lecture Notes in Computer Science, page 103-116. Springer, (2019)Inference of a rumor's source in the independent cascade model., , , , and . UAI, volume 216 of Proceedings of Machine Learning Research, page 152-162. PMLR, (2023)Closing the Gap for Single Resource Constraint Scheduling., and . ESA, volume 204 of LIPIcs, page 53:1-53:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Closing the Gap for Pseudo-Polynomial Strip Packing., and . ESA, volume 144 of LIPIcs, page 62:1-62:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)