default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSven Jäger 0001
Person information
- affiliation: RPTU, Kaiserslautern, Germany
- affiliation (2021 - 2022): Fraunhofer-Institut für Techno- und Wirtschaftsmathematik, ITWM, Kaiserslautern, Germany
- affiliation (PhD 2021): Technische Universität Berlin, Berlin, Germany
Other persons with the same name
- Sven Jäger 0002 — Technische Universität Ilmenau, Ilmenau, Germany
2020 – today
- 2025
[j7]Sven Jäger
, Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt, Philipp Warode:
Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling. Math. Program. 210(1): 457-509 (2025)- [c8]Sven Jäger, Alexander Lindermayr, Nicole Megow:
The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints. SODA 2025: 3901-3930 - 2024
- [c7]Sven Jäger, Sarah Roth, Anita Schöbel:
Periodic Timetabling: Travel Time vs. Regenerative Energy. ATMOS 2024: 10:1-10:20 - [c6]Tobias Harks, Sven Jäger, Michael Markl, Philine Schiewe:
Computing User Equilibria for Schedule-Based Transit Networks with Hard Vehicle Capacities. ATMOS 2024: 17:1-17:17 - [c5]Sven Jäger, Philipp Warode:
Simple Approximation Algorithms for Minimizing the Total Weighted Completion Time of Precedence-Constrained Jobs. SOSA 2024: 82-96 - [i9]Tobias Harks, Sven Jäger, Michael Markl, Philine Schiewe:
Computing User Equilibria for Schedule-Based Transit Networks with Hard Vehicle Capacities. CoRR abs/2406.17153 (2024) - [i8]Sven Jäger, Alexander Lindermayr, Nicole Megow:
The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints. CoRR abs/2408.14310 (2024) - 2023
- [j6]Sven Jäger:
An improved greedy algorithm for stochastic online scheduling on unrelated machines. Discret. Optim. 47: 100753 (2023) - [c4]Sven Jäger, Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt, Philipp Warode:
Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling. IPCO 2023: 246-260 - [i7]Dominik Leib, Tobias Seidel, Sven Jäger, Raoul Heese, Caitlin Isobel Jones, Abhishek Awasthi, Astrid Elisa Niederle, Michael Bortz:
A Quantum Optimization Case Study for a Transport Robot Scheduling Problem. CoRR abs/2309.09736 (2023) - [i6]Sven Jäger, Philipp Warode:
Simple Approximation Algorithms for Minimizing the Total Weighted Completion Time of Precedence-Constrained Jobs. CoRR abs/2309.12031 (2023) - 2022
- [j5]Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille:
Gray codes and symmetric chains. J. Comb. Theory B 153: 31-60 (2022) - [c3]Sven Jäger, Neele Leithäuser, Sebastian Velten, Christian Weiß:
Scheduling Unrelated Parallel Machines with Attribute-Dependent Setup Times: A Case Study. OR 2022: 581-588 - [i5]Sven Jäger:
An Improved Greedy Algorithm for Stochastic Online Scheduling on Unrelated Machines. CoRR abs/2208.06815 (2022) - [i4]Sven Jäger, Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt, Philipp Warode:
Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling. CoRR abs/2211.02044 (2022) - 2021
- [b1]Sven Joachim Jäger:
Approximation in deterministic and stochastic machine scheduling. Technical University of Berlin, Germany, 2021 - 2020
- [j4]Sven Jäger, Anita Schöbel:
The blockwise coordinate descent method for integer programs. Math. Methods Oper. Res. 91(2): 357-381 (2020)
2010 – 2019
- 2019
- [j3]Karl Däubel, Sven Jäger, Torsten Mütze, Manfred Scheucher:
On Orthogonal Symmetric Chain Decompositions. Electron. J. Comb. 26(3): 3 (2019) - 2018
- [j2]Sven Jäger:
Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates. Oper. Res. Lett. 46(5): 505-509 (2018) - [c2]Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille:
Gray Codes and Symmetric Chains. ICALP 2018: 66:1-66:14 - [c1]Sven Jäger, Martin Skutella:
Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling. STACS 2018: 43:1-43:14 - [i3]Sven Jäger, Martin Skutella:
Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling. CoRR abs/1801.01105 (2018) - [i2]Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille:
Gray codes and symmetric chains. CoRR abs/1802.06021 (2018) - [i1]Karl Däubel, Sven Jäger, Torsten Mütze, Manfred Scheucher:
On orthogonal symmetric chain decompositions. CoRR abs/1810.09847 (2018) - 2014
- [j1]Mehmet Gültas, Güncel Düzgün, Sebastian Herzog, Sven Joachim Jäger, Cornelia Meckbach, Edgar Wingender, Stephan Waack:
Quantum Coupled Mutation Finder: Predicting functionally or structurally important sites in proteins using quantum Jensen-Shannon divergence and CUDA programming. BMC Bioinform. 15: 96 (2014)
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.
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.
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.
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-04-09 22:27 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:
