Alexander Lindermayr

According to our database, Alexander Lindermayr authored at least 29 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Learning-Augmented Online Scheduling with Parsimonious Preemption.

Mugen Blue, Sungjin Im, Alexander Lindermayr

CoRR, May, 2026

The Secretary Problem with a Stochastic Precursor.

Franziska Eberle, Alexander Lindermayr

CoRR, May, 2026

A Simpler Analysis for ϵ-Clairvoyant Flow Time Scheduling.

Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlöter, Sorrachai Yingchareonthawornchai

CoRR, March, 2026

Delayed-Clairvoyant Flow Time Scheduling via a Borrow Graph Analysis.

Alexander Lindermayr, Jens Schlöter

CoRR, February, 2026

Online Flow Time Minimization with Gradually Revealed Jobs.

Alexander Lindermayr, Guido Schäfer, Jens Schlöter, Leen Stougie

CoRR, February, 2026

The Power of Proportional Fairness for Nonclairvoyant Polytope Scheduling.

Sven Jäger, Alexander Lindermayr, Nicole Megow

SIAM J. Comput., 2026

A Better-Than-5/4-Approximation for Two-Edge Connectivity.

Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

Indirect Coflow Scheduling.

Alexander Lindermayr, Kirk Pruhs, Andréa W. Richa, Tegan Wilson

Proceedings of the Structural Information and Communication Complexity, 2026

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees.

Alexander Lindermayr, Zhenwei Liu, Nicole Megow

Proceedings of the Integer Programming and Combinatorial Optimization, 2026

2025

Boosting Double Coverage for k-Server via Imperfect Predictions.

Alexander Lindermayr, Nicole Megow, Bertrand Simon

Algorithmica, November, 2025

Scheduling (Dagstuhl Seminar 25121).

Claire Mathieu, Nicole Megow, Benjamin Moseley, Frits C. R. Spieksma, Alexander Lindermayr

Dagstuhl Reports, March, 2025

Unifying Scheduling Algorithms for Group Completion Time.

Alexander Lindermayr, Zhenwei Liu, Nicole Megow

CoRR, January, 2025

A 5/4-Approximation for Two-Edge Connectivity.

Miguel Bosch-Calvo, Mohit Garg, Fabrizio Grandoni, Felix Hommelsheim, Afrouz Jabal Ameli, Alexander Lindermayr

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints.

Sven Jäger, Alexander Lindermayr, Nicole Megow

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Non-Clairvoyant Scheduling with Progress Bars.

Ziyad Benomar, Romain Cosson, Alexander Lindermayr, Jens Schlöter

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

A Little Clairvoyance Is All You Need.

Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlöter, Sorrachai Yingchareonthawornchai

Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

2024

Elimination Distance to Bounded Degree on Planar Graphs Preprint.

Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny

Fundam. Informaticae, 2024

Two-Edge Connectivity via Pac-Man Gluing.

Mohit Garg, Felix Hommelsheim, Alexander Lindermayr

CoRR, 2024

Santa Claus meets Makespan and Matroids: Algorithms and Reductions.

Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

The Safe and Effective Use of Optimistic Period Predictions.

Sanjoy K. Baruah, Pontus Ekberg, Alexander Lindermayr, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie

Proceedings of the 32nd International Conference on Real-Time Networks and Systems, 2024

Accelerating Matroid Optimization through Fast Imprecise Oracles.

Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Jens Schlöter

Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

2023

Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary.

Alexander Lindermayr, Nicole Megow, Martin Rapp

Proceedings of the International Conference on Machine Learning, 2023

Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints.

Alexandra Anna Lassota, Alexander Lindermayr, Nicole Megow, Jens Schlöter

Proceedings of the International Conference on Machine Learning, 2023

2022

Non-Clairvoyant Scheduling with Predictions Revisited.

Alexander Lindermayr, Nicole Megow

CoRR, 2022

Permutation Predictions for Non-Clairvoyant Scheduling.

Alexander Lindermayr, Nicole Megow

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

A Universal Error Measure for Input Predictions Applied to Online Graph Problems.

Giulia Bernardini, Alexander Lindermayr, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie, Michelle Sweering

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Double Coverage with Machine-Learned Advice.

Alexander Lindermayr, Nicole Megow, Bertrand Simon

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Robustification of Online Graph Exploration Methods.

Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2020

Elimination Distance to Bounded Degree on Planar Graphs.

Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020