default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMalin Rau
Person information
- affiliation: Chalmers University of Technology, Gothenburg, Sweden
- affiliation (former): University of Hamburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c20]Debajyoti Kar, Arindam Khan, Malin Rau:
Improved Approximation Algorithms for Three-Dimensional Bin Packing. ICALP 2025: 104:1-104:20- [c19]Petra Berenbrink, Martin Hoefer, Dominik Kaaser, Marten Maack, Malin Rau, Lisa Wilhelmi:
Opinion Dynamics with Median Aggregation. AAMAS 2025: 271-279 - [c18]Franziska Eberle, Felix Hommelsheim
, Malin Rau, Stefan Walzer:
A Tight (3/2 + ∈ )-Approximation Algorithm for Demand Strip Packing. SODA 2025: 641-699 - [i17]Debajyoti Kar, Arindam Khan, Malin Rau:
Improved Approximation Algorithms for Three-Dimensional Bin Packing. CoRR abs/2503.08863 (2025) - 2024
- [j7]Petra Berenbrink, Martin Hoefer, Dominik Kaaser, Pascal Lenzner, Malin Rau, Daniel Schmand:
Asynchronous opinion dynamics in social networks. Distributed Comput. 37(3): 207-224 (2024) - [c17]Max Hahn-Klimroth, Dominik Kaaser, Malin Rau:
Distributed Pooled Data Intrusion Detection: Lessons Learned from Quantitative Group Testing. ICDCS 2024: 198-208 - [c16]Klaus Jansen, Malin Rau, Malte Tutas:
Hardness and Tight Approximations of Demand Strip Packing. SPAA 2024: 479-489 - [i16]Klaus Jansen, Malin Rau, Malte Tutas:
Hardness and Tight Approximations of Demand Strip Packing. CoRR abs/2404.15917 (2024) - [i15]Franziska Eberle, Felix Hommelsheim, Malin Rau, Stefan Walzer:
A Tight (3/2 + ε)-Approximation Algorithm for Demand Strip Packing. CoRR abs/2408.08627 (2024) - 2023
- [j6]Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, Malin Rau:
A Tight (3/2+ε )-Approximation for Skewed Strip Packing. Algorithmica 85(10): 3088-3109 (2023) - [j5]Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, Malte Tutas:
Peak Demand Minimization via Sliced Strip Packing. Algorithmica 85(12): 3649-3679 (2023) - [c15]Petra Berenbrink, Lukas Hintze, Hamed Hosseinpour, Dominik Kaaser, Malin Rau:
Dynamic Averaging Load Balancing on Arbitrary Graphs. ICALP 2023: 18:1-18:18 - [c14]Max A. Deppert, Klaus Jansen, Marten Maack, Simon Pukrop, Malin Rau:
Scheduling with Many Shared Resources. IPDPS 2023: 413-423 - [c13]Petra Berenbrink, Max Hahn-Klimroth, Dominik Kaaser, Lena Krieg, Malin Rau:
Inference of a rumor's source in the independent cascade model. UAI 2023: 152-162 - [i14]Petra Berenbrink, Lukas Hintze, Hamed Hosseinpour, Dominik Kaaser, Malin Rau:
Dynamic Averaging Load Balancing on Arbitrary Graphs. CoRR abs/2302.12201 (2023) - [i13]Max Hahn-Klimroth, Dominik Kaaser, Malin Rau:
Efficient Approximate Recovery from Pooled Data Using Doubly Regular Pooling Schemes. CoRR abs/2303.00043 (2023) - 2022
- [j4]Klaus Jansen, Kim-Manuel Klein, Marten Maack, Malin Rau:
Empowering the configuration-IP: new PTAS results for scheduling with setup times. Math. Program. 195(1): 367-401 (2022) - [c12]Petra Berenbrink, Martin Hoefer, Dominik Kaaser, Pascal Lenzner, Malin Rau, Daniel Schmand:
Asynchronous Opinion Dynamics in Social Networks. AAMAS 2022: 109-117 - [c11]Petra Berenbrink, Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Dominik Kaaser, Malin Rau:
On the Hierarchy of Distributed Majority Protocols. OPODIS 2022: 23:1-23:19 - [i12]Petra Berenbrink, Martin Hoefer, Dominik Kaaser, Pascal Lenzner, Malin Rau, Daniel Schmand:
Asynchronous Opinion Dynamics in Social Networks. CoRR abs/2201.12923 (2022) - [i11]Petra Berenbrink, Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Dominik Kaaser, Malin Rau:
On the Hierarchy of Distributed Majority Protocols. CoRR abs/2205.08203 (2022) - [i10]Petra Berenbrink, Max Hahn-Klimroth, Dominik Kaaser, Lena Krieg, Malin Rau:
Inference of a Rumor's Source in the Independent Cascade Model. CoRR abs/2205.12125 (2022) - [i9]Max A. Deppert, Klaus Jansen, Marten Maack, Simon Pukrop, Malin Rau:
Scheduling with Many Shared Resources. CoRR abs/2210.01523 (2022) - 2021
- [c10]Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, Malte Tutas:
Peak Demand Minimization via Sliced Strip Packing. APPROX-RANDOM 2021: 21:1-21:24 - [c9]Klaus Jansen, Malin Rau:
Closing the Gap for Single Resource Constraint Scheduling. ESA 2021: 53:1-53:15 - [i8]Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, Malte Tutas:
Peak Demand Minimization via Sliced Strip Packing. CoRR abs/2105.07219 (2021) - [i7]Klaus Jansen, Malin Rau:
Closing the gap for single resource constraint scheduling. CoRR abs/2107.01613 (2021) - 2020
- [j3]Sören Henning, Klaus Jansen, Malin Rau, Lars Schmarje:
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing. Theory Comput. Syst. 64(1): 120-140 (2020) - [c8]Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, Malin Rau:
A Tight (3/2+ε) Approximation for Skewed Strip Packing. APPROX-RANDOM 2020: 44:1-44:18 - [c7]Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath:
Solving Packing Problems with Few Small Items Using Rainbow Matchings. MFCS 2020: 11:1-11:14 - [i6]Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath:
Solving Packing Problems with Few Small Items Using Rainbow Matchings. CoRR abs/2007.02660 (2020)
2010 – 2019
- 2019
- [b1]Malin Rau:
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 - [j2]Klaus Jansen, Marten Maack, Malin Rau:
Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times. ACM Trans. Algorithms 15(3): 31:1-31:28 (2019) - [j1]Klaus Jansen, Malin Rau:
Improved approximation for two dimensional Strip Packing with polynomial bounded width. Theor. Comput. Sci. 789: 34-49 (2019) - [c6]Klaus Jansen, Malin Rau:
Closing the Gap for Pseudo-Polynomial Strip Packing. ESA 2019: 62:1-62:14 - [c5]Klaus Jansen, Malin Rau:
Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing. Euro-Par 2019: 103-116 - [c4]Klaus Jansen, Kim-Manuel Klein, Marten Maack, Malin Rau:
Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times. ITCS 2019: 44:1-44:19 - [i5]Klaus Jansen, Malin Rau:
Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing. CoRR abs/1902.03428 (2019) - 2018
- [c3]Sören Henning, Klaus Jansen, Malin Rau, Lars Schmarje:
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing. CSR 2018: 169-180 - [i4]Klaus Jansen, Kim-Manuel Klein, Marten Maack, Malin Rau:
Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times. CoRR abs/1801.06460 (2018) - 2017
- [c2]Klaus Jansen, Malin Rau:
Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded Width. WALCOM 2017: 409-420 - [i3]Sören Henning, Klaus Jansen, Malin Rau, Lars Schmarje:
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing. CoRR abs/1705.04587 (2017) - [i2]Klaus Jansen, Malin Rau:
Closing the gap for pseudo-polynomial strip packing. CoRR abs/1712.04922 (2017) - 2016
- [c1]Klaus Jansen, Marten Maack, Malin Rau:
Approximation schemes for machine scheduling with resource (in-)dependent processing times. SODA 2016: 1526-1542 - [i1]Klaus Jansen, Malin Rau:
Improved approximation for two dimensional strip packing with polynomial bounded width. CoRR abs/1610.04430 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-01-19 23:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
