Alexander Lindermayr

Orcid: 0000-0001-6714-5034

According to our database1, Alexander Lindermayr authored at least 13 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Elimination Distance to Bounded Degree on Planar Graphs Preprint.
Fundam. Informaticae, 2024

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

Two-Edge Connectivity via Pac-Man Gluing.
CoRR, 2024

Accelerating Matroid Optimization through Fast Imprecise Oracles.
CoRR, 2024

Santa Claus meets Makespan and Matroids: Algorithms and Reductions.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary.
Proceedings of the International Conference on Machine Learning, 2023

Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints.
Proceedings of the International Conference on Machine Learning, 2023

2022
Non-Clairvoyant Scheduling with Predictions Revisited.
CoRR, 2022

Permutation Predictions for Non-Clairvoyant Scheduling.
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.
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.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Robustification of Online Graph Exploration Methods.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2020
Elimination Distance to Bounded Degree on Planar Graphs.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020


  Loading...