Elimination Distance to Bounded Degree on Planar Graphs. - Alexander Lindermayr; Sebastian Siebertz; Alexandre Vigny (MFCS, 2020)

Robustification of Online Graph Exploration Methods. - Franziska Eberle; Alexander Lindermayr; Nicole Megow; Lukas Nölke; Jens Schlöter (AAAI, 2022)

Double Coverage with Machine-Learned Advice. - Alexander Lindermayr; Nicole Megow; Bertrand Simon 001 (ITCS, 2022)

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

Non-Clairvoyant Scheduling with Predictions Revisited. - Alexander Lindermayr; Nicole Megow (CoRR, 2022)

Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints. - Alexandra Anna Lassota; Alexander Lindermayr; Nicole Megow; Jens Schlöter (ICML, 2023)

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

Accelerating Matroid Optimization through Fast Imprecise Oracles. - 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 K. Baruah; Pontus Ekberg; Alexander Lindermayr; Alberto Marchetti-Spaccamela; Nicole Megow; Leen Stougie (RTNS, 2024)

Santa Claus meets Makespan and Matroids: Algorithms and Reductions. - Étienne Bamas; Alexander Lindermayr; Nicole Megow; Lars Rohwedder; Jens Schlöter (SODA, 2024)

Two-Edge Connectivity via Pac-Man Gluing. - Mohit Garg 003; Felix Hommelsheim; Alexander Lindermayr (CoRR, 2024)

Elimination Distance to Bounded Degree on Planar Graphs Preprint. - Alexander Lindermayr; Sebastian Siebertz; Alexandre Vigny (Fundam. Informaticae, 2024)

The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints. - Sven Jäger 001; Alexander Lindermayr; Nicole Megow (SODA, 2025)

A 5/4-Approximation for Two-Edge Connectivity. - Miguel Bosch-Calvo; Mohit Garg 003; Fabrizio Grandoni 001; Felix Hommelsheim; Afrouz Jabal Ameli; Alexander Lindermayr (STOC, 2025)

Unifying Scheduling Algorithms for Group Completion Time. - Alexander Lindermayr; Zhenwei Liu; Nicole Megow (CoRR, 2025)

Permutation Predictions for Non-Clairvoyant Scheduling. - Alexander Lindermayr; Nicole Megow (ACM Trans. Parallel Comput., 2025)