Marten Maack

Orcid: 0000-0001-7918-6642

According to our database1, Marten Maack authored at least 23 papers between 2016 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Opinion Dynamics with Median Aggregation.
Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, 2025

2023
Online cardinality constrained scheduling.
Oper. Res. Lett., September, 2023

Online load balancing on uniform machines with limited migration.
Oper. Res. Lett., May, 2023

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

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

Cardinality Constrained Scheduling in Online Models.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Full Version - Server Cloud Scheduling.
CoRR, 2021

Server Cloud Scheduling.
Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021

Approximation Schemes for Machine Scheduling.
Proceedings of the Operations Research Proceedings 2021, Selected Papers of the International Conference of the Swiss, German and Austrian Operations Research Societies (SVOR/ASRO, GOR e.V., ÖGOR), University of Bern, Switzerland, August 31, 2021

Total Completion Time Minimization for Scheduling with Incompatibility Cliques.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

2020
Inapproximability Results for Scheduling with Interval and Resource Restrictions.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Approximation Algorithms for Scheduling with Class Constraints.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 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
Approximation Schemes for Machine Scheduling
PhD thesis, 2019

Scheduling on (Un-)Related Machines with Setup Times.
Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

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

Online Bin Covering with Limited Migration.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Makespan Minimization on Unrelated Parallel Machines with Simple Job-Intersection Structure and Bounded Job Assignments.
Proceedings of the Combinatorial Optimization and Applications, 2018

2017
An EPTAS for Scheduling on Unrelated Machines of Few Different Types.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Structural Parameters for Scheduling with Assignment Restrictions.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Estimating The Makespan of The Two-Valued Restricted Assignment Problem.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Approximation schemes for machine scheduling with resource (in-)dependent processing times.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016


  Loading...