Closing the Gap for Pseudo-Polynomial Strip Packing. - Klaus Jansen; Malin Rau (ESA, 2019)

Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing. - Klaus Jansen; Malin Rau (Euro-Par, 2019)

Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times. - Klaus Jansen; Kim-Manuel Klein; Marten Maack; Malin Rau (ITCS, 2019)

Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times. - Klaus Jansen; Marten Maack; Malin Rau (ACM Trans. Algorithms, 2019)

Improved approximation for two dimensional Strip Packing with polynomial bounded width. - Klaus Jansen; Malin Rau (Theor. Comput. Sci., 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) - Malin Rau (2019)

Solving Packing Problems with Few Small Items Using Rainbow Matchings. - Max Bannach; Sebastian Berndt 001; Marten Maack; Matthias Mnich; Alexandra Lassota; Malin Rau; Malte Skambath (MFCS, 2020)

Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing. - Sören Henning; Klaus Jansen; Malin Rau; Lars Schmarje (Theory Comput. Syst., 2020)

Closing the Gap for Single Resource Constraint Scheduling. - Klaus Jansen; Malin Rau (ESA, 2021)

On the Hierarchy of Distributed Majority Protocols. - Petra Berenbrink; Amin Coja-Oghlan; Oliver Gebhard; Max Hahn-Klimroth; Dominik Kaaser; Malin Rau (OPODIS, 2022)

Empowering the configuration-IP: new PTAS results for scheduling with setup times. - Klaus Jansen; Kim-Manuel Klein; Marten Maack; Malin Rau (Math. Program., 2022)

Dynamic Averaging Load Balancing on Arbitrary Graphs. - Petra Berenbrink; Lukas Hintze; Hamed Hosseinpour; Dominik Kaaser; Malin Rau (ICALP, 2023)

Scheduling with Many Shared Resources. - Max A. Deppert; Klaus Jansen; Marten Maack; Simon Pukrop; Malin Rau (IPDPS, 2023)

Inference of a rumor's source in the independent cascade model. - Petra Berenbrink; Max Hahn-Klimroth; Dominik Kaaser; Lena Krieg; Malin Rau (UAI, 2023)

Efficient Approximate Recovery from Pooled Data Using Doubly Regular Pooling Schemes. - Max Hahn-Klimroth; Dominik Kaaser; Malin Rau (CoRR, 2023)

A Tight (3/2+ε )-Approximation for Skewed Strip Packing. - Waldo Gálvez; Fabrizio Grandoni 001; Afrouz Jabal Ameli; Klaus Jansen; Arindam Khan 001; Malin Rau (Algorithmica, 2023)

Peak Demand Minimization via Sliced Strip Packing. - Max A. Deppert; Klaus Jansen; Arindam Khan 001; Malin Rau; Malte Tutas (Algorithmica, 2023)

Distributed Pooled Data Intrusion Detection: Lessons Learned from Quantitative Group Testing. - Max Hahn-Klimroth; Dominik Kaaser; Malin Rau (ICDCS, 2024)

Hardness and Tight Approximations of Demand Strip Packing. - Klaus Jansen; Malin Rau; Malte Tutas (SPAA, 2024)

A Tight (3/2 + ε)-Approximation Algorithm for Demand Strip Packing. - Franziska Eberle; Felix Hommelsheim; Malin Rau; Stefan Walzer (CoRR, 2024)

Asynchronous opinion dynamics in social networks. - Petra Berenbrink; Martin Hoefer 001; Dominik Kaaser; Pascal Lenzner; Malin Rau; Daniel Schmand (Distributed Comput., 2024)

Improved Approximation Algorithms for Three-Dimensional Bin Packing. - Debajyoti Kar; Arindam Khan 001; Malin Rau (ICALP, 2025)

Opinion Dynamics with Median Aggregation. - Petra Berenbrink; Martin Hoefer 001; Dominik Kaaser; Marten Maack; Malin Rau; Lisa Wilhelmi (AAMAS, 2025)

A Tight (3/2 + ∈ )-Approximation Algorithm for Demand Strip Packing. - Franziska Eberle; Felix Hommelsheim; Malin Rau; Stefan Walzer (SODA, 2025)