Alexander Lindermayr

38 papers A* 10A 1B 2Misc 1Journal 24
YearRankTypeTitle / Venue / Authors
2026 A* conf
A Better-Than-5/4-Approximation for Two-Edge Connectivity.
SODA
Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu
2026 J jnl
A Simpler Analysis for ϵ-Clairvoyant Flow Time Scheduling.
CoRR
Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlöter, Sorrachai Yingchareonthawornchai
2026 J jnl
Delayed-Clairvoyant Flow Time Scheduling via a Borrow Graph Analysis.
CoRR
Alexander Lindermayr, Jens Schlöter
2026 J jnl
Online Flow Time Minimization with Gradually Revealed Jobs.
CoRR
Alexander Lindermayr, Guido Schäfer, Jens Schlöter, Leen Stougie
2026 J jnl
The Power of Proportional Fairness for Nonclairvoyant Polytope Scheduling.
SIAM J. Comput.
Sven Jäger, Alexander Lindermayr, Nicole Megow
2025 A* conf
A 5/4-Approximation for Two-Edge Connectivity.
STOC
Miguel Bosch-Calvo, Mohit Garg, Fabrizio Grandoni, Felix Hommelsheim, Afrouz Jabal Ameli, Alexander Lindermayr
2025 J jnl
A Better-Than-5/4-Approximation for Two-Edge Connectivity.
CoRR
Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu
2025 A* conf
A Little Clairvoyance Is All You Need.
FOCS
Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlöter, Sorrachai Yingchareonthawornchai
2025 J jnl
A Little Clairvoyance Is All You Need.
CoRR
Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlöter, Sorrachai Yingchareonthawornchai
2025 J jnl
Boosting Double Coverage for k-Server via Imperfect Predictions.
Algorithmica
Alexander Lindermayr, Nicole Megow, Bertrand Simon
2025 J jnl
Indirect Coflow Scheduling.
CoRR
Alexander Lindermayr, Kirk Pruhs, Andréa W. Richa, Tegan Wilson
2025 J jnl
Non-Clairvoyant Scheduling with Progress Bars.
CoRR
Ziyad Benomar, Romain Cosson, Alexander Lindermayr, Jens Schlöter
2025 J jnl
Permutation Predictions for Non-Clairvoyant Scheduling.
ACM Trans. Parallel Comput.
Alexander Lindermayr, Nicole Megow
2025 J jnl
Scheduling (Dagstuhl Seminar 25121).
Dagstuhl Reports
Claire Mathieu, Nicole Megow, Benjamin Moseley, Frits C. R. Spieksma, Alexander Lindermayr
2025 A* conf
The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints.
SODA
Sven Jäger, Alexander Lindermayr, Nicole Megow
2025 J jnl
Unifying Scheduling Algorithms for Group Completion Time.
CoRR
Alexander Lindermayr, Zhenwei Liu, Nicole Megow
2024 A* conf
Accelerating Matroid Optimization through Fast Imprecise Oracles.
NeurIPS
Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Jens Schlöter
2024 J jnl
Accelerating Matroid Optimization through Fast Imprecise Oracles.
CoRR
Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Jens Schlöter
2024 J jnl
Elimination Distance to Bounded Degree on Planar Graphs Preprint.
Fundam. Informaticae
Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny
2024 A* conf
Santa Claus meets Makespan and Matroids: Algorithms and Reductions.
SODA
Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter
2024 J jnl
The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints.
CoRR
Sven Jäger, Alexander Lindermayr, Nicole Megow
2024 Misc conf
The Safe and Effective Use of Optimistic Period Predictions.
RTNS
Sanjoy K. Baruah, Pontus Ekberg, Alexander Lindermayr, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie
2024 J jnl
Two-Edge Connectivity via Pac-Man Gluing.
CoRR
Mohit Garg, Felix Hommelsheim, Alexander Lindermayr
2023 A* conf
Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints.
ICML
Alexandra Anna Lassota, Alexander Lindermayr, Nicole Megow, Jens Schlöter
2023 J jnl
Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints.
CoRR
Alexandra Lassota, Alexander Lindermayr, Nicole Megow, Jens Schlöter
2023 J jnl
Santa Claus meets Makespan and Matroids: Algorithms and Reductions.
CoRR
Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter
2023 A* conf
Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary.
ICML
Alexander Lindermayr, Nicole Megow, Martin Rapp
2023 J jnl
Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary.
CoRR
Alexander Lindermayr, Nicole Megow, Martin Rapp
2022 A* conf
A Universal Error Measure for Input Predictions Applied to Online Graph Problems.
NeurIPS
Giulia Bernardini, Alexander Lindermayr, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie, Michelle Sweering
2022 J jnl
A Universal Error Measure for Input Predictions Applied to Online Graph Problems.
CoRR
Giulia Bernardini, Alexander Lindermayr, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie, Michelle Sweering
2022 A conf
Double Coverage with Machine-Learned Advice.
ITCS
Alexander Lindermayr, Nicole Megow, Bertrand Simon
2022 J jnl
Non-Clairvoyant Scheduling with Predictions Revisited.
CoRR
Alexander Lindermayr, Nicole Megow
2022 B conf
Permutation Predictions for Non-Clairvoyant Scheduling.
SPAA
Alexander Lindermayr, Nicole Megow
2022 A* conf
Robustification of Online Graph Exploration Methods.
AAAI
Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter
2021 J jnl
Double Coverage with Machine-Learned Advice.
CoRR
Alexander Lindermayr, Nicole Megow, Bertrand Simon
2021 J jnl
Robustification of Online Graph Exploration Methods.
CoRR
Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter
2020 B conf
Elimination Distance to Bounded Degree on Planar Graphs.
MFCS
Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny
2020 J jnl
Elimination distance to bounded degree on planar graphs.
CoRR
Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny