Alexander Lindermayr

Picture of Alexander Lindermayr

Universit?t Bremen
FB3: Mathematik/Informatik
Bibliothekstr. 5
28359 Bremen
Germany
Office: MZH 3320
Phone: +49 (421) 218-63587
Email: linderal@uni-bremen.de
Office hours: by appointment

About me

I am a postdoc at the University of Bremen in the group of Nicole Megow. I received my PhD in November 2024 under supervision of Nicole Megow. I am interested in various topics in combinatorial optimization. My current focus is the field of optimization under uncertainty, especially algorithms that handle uncertainty using untrusted predictions. I also like programming.
From 10/2020 to 12/2022, I was working on the project "Scheduling Invasive Multicore Programs Under Uncertainty" of the Transregional Collaborative Research Center (TCRC) 89: Invasive Computing (InvasIC).

Projects

  • ALPS: a website that semi-automatically tracks and labels papers on algorithms with predictions via arXiv and DBLP APIs!
  • Xivar: a cli app written in Rust that searches papers on arXiv and DBLP, organizes a local PDF library and fetches bib-entries to clipboard!
  • Collclean: a cli app written in Rust that removes given commands from tex-files, including brackets (e.g. collaboration colors)!

Preprints

Two-Edge Connectivity via Pac-Man Gluing  arxiv.org 
Mohit Garg, Felix Hommelsheim, Alexander Lindermayr

Publications

The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints  arxiv.org
Sven J?ger, Alexander Lindermayr, Nicole Megow
SODA 2025

Accelerating Matroid Optimization through Fast Imprecise Oracles  arxiv.org 
Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Jens Schl?ter
NeurIPS 2024

The Safe and Effective Use of Optimistic Period Predictions
Sanjoy Baruah, Pontus Ekberg, Alexander Lindermayr, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie
RTNS 2024

Santa Claus meets Makespan and Matroids: Algorithms and Reductions  arxiv.org 
?tienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schl?ter
SODA 2024

Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary  arxiv.org
Alexander Lindermayr, Nicole Megow, Martin Rapp
ICML 2023

Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints  arxiv.org
Alexandra Lassota, Alexander Lindermayr, Nicole Megow, Jens Schl?ter
ICML 2023

A Universal Error Measure for Input Predictions Applied to Online Graph Problems  arxiv.org
Giulia Bernardini, Alexander Lindermayr, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie, Michelle Sweering
NeurIPS 2022

Permutation Predictions for Non-Clairvoyant Scheduling  arxiv.org SPAA
Alexander Lindermayr and Nicole Megow
SPAA 2022

Robustification of Online Graph Exploration Methods  arxiv.org AAAI
Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas N?lke, Jens Schl?ter
AAAI 2022

Double Coverage with Machine-Learned Advice  arxiv.orgITCS
Alexander Lindermayr, Nicole Megow, Bertrand Simon
ITCS 2022

Elimination Distance to Bounded Degree on Planar Graphs  arxiv.org  Fund. Inf.
Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny
MFCS 2020, Fundamenta Informaticae 2024

Theses

Unrelated Machine Scheduling in Different Information Models  PDF
Alexander Lindermayr
PhD thesis, University of Bremen, 2024.

Learning-Augmented Online Algorithms for the 2-Server Problem on the Line and Generalizations  PDF
Alexander Lindermayr
Master thesis, University of Bremen, 2020.