Alexander Lindermayr

Alexander Lindermayr

Auto-generated profile, based on publicly available information

Alexander Lindermayr

University of Bremen, Bremen, Germany

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 June 2025
Verified
Conference Paper
Open access
MBMiguel Bosch-Calvo
Miguel Bosch-Calvo
MGMohit Garg
Mohit Garg
FGFabrizio Grandoni
Fabrizio Grandoni
FHFelix Hommelsheim
Felix Hommelsheim
AAAfrouz Jabal Ameli
Afrouz Jabal Ameli
ALAlexander Lindermayr
Alexander Lindermayr

13 May 2025 in ACM Transactions on Parallel Computing
Verified
Journal Article
Open access
ALAlexander Lindermayr
Alexander Lindermayr
NMNicole Megow
Nicole Megow
In non-clairvoyant scheduling, the task is to schedule jobs with a priori unknown processing requirements. We revisit this well-studied problem with the objective of minimizing the total (weighted) completion time in a recently popular learning-augmented setting that integrates possibly imperfect predictions into online algorithm design. While previous works used predictions on processing requirements, we propose a new prediction model that provides a relative order of jobs, which could be seen as predicting algorithmic actions rather than parts of the unknown input. We show that these succinct predictions have desired properties, admit a natural error measure, and enable algorithms with strong performance guarantees. Additionally, these predictions are learnable in both theory and practice. We generalize the algorithmic framework proposed in the seminal article by Purohit, Kumar, and Svitkina (NeurIPS 2018) and present the first learning-augmented scheduling results for weighted jobs and unrelated machines. We demonstrate in empirical experiments the practicability and superior performance compared with the previously suggested single-machine algorithms.

24 May 2026
Verified
Book Chapter
Closed access
ALAlexander Lindermayr
Alexander Lindermayr
KPKirk Pruhs
Kirk Pruhs
ARAndréa W. Richa
Andréa W. Richa
TWTegan Wilson
Tegan Wilson

6 November 2024
Verified
Conference Paper
Open access
SBSanjoy Baruah
Sanjoy Baruah
PEPontus Ekberg
Pontus Ekberg
ALAlexander Lindermayr
Alexander Lindermayr
AMAlberto Marchetti-Spaccamela
Alberto Marchetti-Spaccamela
NMNicole Megow
Nicole Megow
LSLeen Stougie
Leen Stougie

2 March 2026 in SIAM Journal on Computing
Verified
Journal Article
Closed access
SJSven Jäger
Sven Jäger
ALAlexander Lindermayr
Alexander Lindermayr
NMNicole Megow
Nicole Megow
The polytope scheduling problem (PSP) was introduced by Im, Kulkarni, and Munagala [J. ACM, 65 (2018), pp. 3:1–3:33] as a very general abstraction of resource allocation over time, where ...