default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarten Maack
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Marten Maack
, Friedhelm Meyer auf der Heide, Simon Pukrop:
Server Cloud Scheduling. Algorithmica 86(4): 1210-1245 (2024)- 2023
- [j9]Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder:
Online bin covering with limited migration. J. Comput. Syst. Sci. 134: 42-72 (2023) - [j8]Marten Maack:
Online load balancing on uniform machines with limited migration. Oper. Res. Lett. 51(3): 220-225 (2023) - [j7]Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder:
Online cardinality constrained scheduling. Oper. Res. Lett. 51(5): 533-539 (2023) - [c17]Max A. Deppert, Klaus Jansen, Marten Maack, Simon Pukrop, Malin Rau:
Scheduling with Many Shared Resources. IPDPS 2023: 413-423 - 2022
- [j6]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) - [c16]Marten Maack, Simon Pukrop, Anna Rodriguez Rasmussen:
(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. ESA 2022: 77:1-77:13 - [c15]Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder:
Cardinality Constrained Scheduling in Online Models. STACS 2022: 28:1-28:15 - [i14]Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder:
Cardinality Constrained Scheduling in Online Models. CoRR abs/2201.05113 (2022) - [i13]Marten Maack, Simon Pukrop, Anna Rodriguez Rasmussen:
(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. CoRR abs/2203.06171 (2022) - [i12]Marten Maack:
Online Load Balancing on Uniform Machines with Limited Migration. CoRR abs/2209.00565 (2022) - [i11]Max A. Deppert, Klaus Jansen, Marten Maack, Simon Pukrop, Malin Rau:
Scheduling with Many Shared Resources. CoRR abs/2210.01523 (2022) - 2021
- [c14]Klaus Jansen, Alexandra Lassota, Marten Maack, Tytus Pikies:
Total Completion Time Minimization for Scheduling with Incompatibility Cliques. ICAPS 2021: 192-200 - [c13]Marten Maack:
Approximation Schemes for Machine Scheduling. OR 2021: 21-26 - [c12]Marten Maack, Friedhelm Meyer auf der Heide, Simon Pukrop:
Server Cloud Scheduling. WAOA 2021: 144-164 - [i10]Marten Maack, Friedhelm Meyer auf der Heide, Simon Pukrop:
Full Version - Server Cloud Scheduling. CoRR abs/2108.02109 (2021) - 2020
- [j5]Daniel R. Page, Roberto Solis-Oba, Marten Maack:
Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments. Theor. Comput. Sci. 809: 204-217 (2020) - [j4]Klaus Jansen, Marten Maack, Roberto Solis-Oba:
Structural parameters for scheduling with assignment restrictions. Theor. Comput. Sci. 844: 154-170 (2020) - [c11]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 - [c10]Klaus Jansen, Alexandra Lassota, Marten Maack:
Approximation Algorithms for Scheduling with Class Constraints. SPAA 2020: 349-357 - [c9]Marten Maack, Klaus Jansen:
Inapproximability Results for Scheduling with Interval and Resource Restrictions. STACS 2020: 5:1-5:18 - [i9]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) - [i8]Klaus Jansen, Alexandra Lassota, Marten Maack, Tytus Pikies:
Total Completion Time Minimization for Scheduling with Incompatibility Cliques. CoRR abs/2011.06150 (2020)
2010 – 2019
- 2019
- [b1]Marten Maack:
Approximation Schemes for Machine Scheduling. Kiel University, Germany, 2019 - [j3]Klaus Jansen, Marten Maack:
An EPTAS for Scheduling on Unrelated Machines of Few Different Types. Algorithmica 81(10): 4134-4164 (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) - [c8]Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder:
Online Bin Covering with Limited Migration. ESA 2019: 18:1-18:14 - [c7]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 - [c6]Klaus Jansen, Marten Maack, Alexander Mäcker:
Scheduling on (Un-)Related Machines with Setup Times. IPDPS 2019: 145-154 - [i7]Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder:
Online Bin Covering with Limited Migration. CoRR abs/1904.06543 (2019) - [i6]Marten Maack, Klaus Jansen:
Inapproximability Results for Scheduling with Interval and Resource Restrictions. CoRR abs/1907.03526 (2019) - [i5]Klaus Jansen, Alexandra Lassota, Marten Maack:
Approximation Algorithms for Scheduling with Class Constraints. CoRR abs/1909.11970 (2019) - 2018
- [j1]Klaus Jansen, Kati Land, Marten Maack:
Estimating the Makespan of the Two-Valued Restricted Assignment Problem. Algorithmica 80(4): 1357-1382 (2018) - [c5]Daniel R. Page, Roberto Solis-Oba, Marten Maack:
Makespan Minimization on Unrelated Parallel Machines with Simple Job-Intersection Structure and Bounded Job Assignments. COCOA 2018: 341-356 - [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) - [i3]Klaus Jansen, Marten Maack, Alexander Mäcker:
Scheduling on (Un-)Related Machines with Setup Times. CoRR abs/1809.10428 (2018) - 2017
- [c4]Klaus Jansen, Marten Maack, Roberto Solis-Oba:
Structural Parameters for Scheduling with Assignment Restrictions. CIAC 2017: 357-368 - [c3]Klaus Jansen, Marten Maack:
An EPTAS for Scheduling on Unrelated Machines of Few Different Types. WADS 2017: 497-508 - [i2]Klaus Jansen, Marten Maack:
An EPTAS for Scheduling on Unrelated Machines of Few Different Types. CoRR abs/1701.03263 (2017) - [i1]Klaus Jansen, Marten Maack, Roberto Solis-Oba:
Structural Parameters for Scheduling with Assignment Restrictions. CoRR abs/1701.07242 (2017) - 2016
- [c2]Klaus Jansen, Marten Maack, Malin Rau:
Approximation schemes for machine scheduling with resource (in-)dependent processing times. SODA 2016: 1526-1542 - [c1]Klaus Jansen, Kati Land, Marten Maack:
Estimating The Makespan of The Two-Valued Restricted Assignment Problem. SWAT 2016: 24:1-24:13
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 2024-10-07 21:16 CEST 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:
