Estimating the Makespan of the Two-Valued Restricted Assignment Problem. - Klaus Jansen; Kati Land; Marten Maack (Algorithmica, 2018)

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

Scheduling on (Un-)Related Machines with Setup Times. - Klaus Jansen; Marten Maack; Alexander Mäcker (IPDPS, 2019)

An EPTAS for Scheduling on Unrelated Machines of Few Different Types. - Klaus Jansen; Marten Maack (Algorithmica, 2019)

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

Approximation Schemes for Machine Scheduling - Marten Maack (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)

Approximation Algorithms for Scheduling with Class Constraints. - Klaus Jansen; Alexandra Lassota; Marten Maack (SPAA, 2020)

Inapproximability Results for Scheduling with Interval and Resource Restrictions. - Marten Maack; Klaus Jansen (STACS, 2020)

Structural parameters for scheduling with assignment restrictions. - Klaus Jansen; Marten Maack; Roberto Solis-Oba (Theor. Comput. Sci., 2020)

Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments. - Daniel R. Page; Roberto Solis-Oba; Marten Maack (Theor. Comput. Sci., 2020)

Total Completion Time Minimization for Scheduling with Incompatibility Cliques. - Klaus Jansen; Alexandra Lassota; Marten Maack; Tytus Pikies (ICAPS, 2021)

Approximation Schemes for Machine Scheduling. - Marten Maack (OR, 2021)

Full Version - Server Cloud Scheduling. - Marten Maack; Friedhelm Meyer auf der Heide; Simon Pukrop (CoRR, 2021)

(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. - Marten Maack; Simon Pukrop; Anna Rodriguez Rasmussen (ESA, 2022)

Cardinality Constrained Scheduling in Online Models. - Leah Epstein; Alexandra Lassota; Asaf Levin; Marten Maack; Lars Rohwedder (STACS, 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)

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

Online load balancing on uniform machines with limited migration. - Marten Maack (Oper. Res. Lett., 2023)

Online bin covering with limited migration. - Sebastian Berndt 001; Leah Epstein; Klaus Jansen; Asaf Levin; Marten Maack; Lars Rohwedder (J. Comput. Syst. Sci., 2023)

Online cardinality constrained scheduling. - Leah Epstein; Alexandra Lassota; Asaf Levin; Marten Maack; Lars Rohwedder (Oper. Res. Lett., 2023)

Server Cloud Scheduling. - Marten Maack; Friedhelm Meyer auf der Heide; Simon Pukrop (Algorithmica, 2024)

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