Malin Rau

Orcid: 0000-0002-5710-560X

Affiliations:
  • University of Hamburg, Germany


According to our database1, Malin Rau authored at least 18 papers between 2019 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Peak Demand Minimization via Sliced Strip Packing.
Algorithmica, December, 2023

A Tight (3/2+ε )-Approximation for Skewed Strip Packing.
Algorithmica, October, 2023

Efficient Approximate Recovery from Pooled Data Using Doubly Regular Pooling Schemes.
CoRR, 2023

Inference of a rumor's source in the independent cascade model.
Proceedings of the Uncertainty in Artificial Intelligence, 2023

Scheduling with Many Shared Resources.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2023

Dynamic Averaging Load Balancing on Arbitrary Graphs.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Empowering the configuration-IP: new PTAS results for scheduling with setup times.
Math. Program., 2022

On the Hierarchy of Distributed Majority Protocols.
Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

Asynchronous Opinion Dynamics in Social Networks.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021
Closing the Gap for Single Resource Constraint Scheduling.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing.
Theory Comput. Syst., 2020

Solving Packing Problems with Few Small Items Using Rainbow Matchings.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

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)
PhD thesis, 2019

Improved approximation for two dimensional Strip Packing with polynomial bounded width.
Theor. Comput. Sci., 2019

Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times.
ACM Trans. Algorithms, 2019

Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing.
Proceedings of the Euro-Par 2019: Parallel Processing, 2019

Closing the Gap for Pseudo-Polynomial Strip Packing.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019


  Loading...