default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMax A. Deppert
Person information
- affiliation: Hamburg University of Technology, Germany
- affiliation (PhD 2022): Kiel University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c8]Mario Günzel, Marion Sudvarg, Max A. Deppert, Ao Li, Ning Zhang, Jian-Jia Chen:
Optimal Priority Assignment for Synchronous Harmonic Tasks with Dynamic Self-Suspension. RTAS 2025: 40-53- [i8]Max A. Deppert, David Fischer, Klaus Jansen:
A (4/3+ϵ)-Approximation for Preemptive Scheduling with Batch Setup Times. CoRR abs/2508.14528 (2025) - 2024
- [c7]Max A. Deppert
, Klaus Jansen:
The Power of Duality: Response Time Analysis meets Integer Programming. RTNS 2024: 37-47 - 2023
- [j1]Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, Malte Tutas:
Peak Demand Minimization via Sliced Strip Packing. Algorithmica 85(12): 3649-3679 (2023) - [c6]Max A. Deppert, Matthias Kaul, Matthias Mnich:
A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots. ESA 2023: 39:1-39:15 - [c5]Max A. Deppert, Klaus Jansen, Marten Maack, Simon Pukrop, Malin Rau:
Scheduling with Many Shared Resources. IPDPS 2023: 413-423 - [i7]Max A. Deppert, Matthias Kaul, Matthias Mnich:
A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots. CoRR abs/2307.07180 (2023) - 2022
- [b1]Max A. Deppert:
Algorithms for Scheduling Problems and Integer Programming. Kiel University, Germany, 2022 - [c4]Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder:
Load Balancing: The Long Road from Theory to Practice. ALENEX 2022: 104-116 - [i6]Max A. Deppert, Klaus Jansen, Marten Maack, Simon Pukrop, Malin Rau:
Scheduling with Many Shared Resources. CoRR abs/2210.01523 (2022) - [i5]Max A. Deppert, Klaus Jansen:
The Power of Duality: Response Time Analysis meets Integer Programming. CoRR abs/2210.02361 (2022) - 2021
- [c3]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 - [c2]Max A. Deppert, Klaus Jansen, Kim-Manuel Klein:
Fuzzy Simultaneous Congruences. MFCS 2021: 39:1-39:16 - [i4]Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, Malte Tutas:
Peak Demand Minimization via Sliced Strip Packing. CoRR abs/2105.07219 (2021) - [i3]Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder:
Load Balancing: The Long Road from Theory to Practice. CoRR abs/2107.13638 (2021) - 2020
- [i2]Max A. Deppert, Klaus Jansen, Kim-Manuel Klein:
Fuzzy Simultaneous Congruences. CoRR abs/2002.07746 (2020)
2010 – 2019
- 2019
- [c1]Max A. Deppert, Klaus Jansen:
Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times. SPAA 2019: 155-164 - 2018
- [i1]Max A. Deppert, Klaus Jansen:
Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times. CoRR abs/1810.01223 (2018)
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 2025-09-20 00:50 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:
