Jens Schlöter

According to our database, Jens Schlöter authored at least 22 papers between 2020 and 2026.

Collaborative distances:

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

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

Optimal Verification of a Minimum-Weight Basis in an Uncertainty Matroid.

Haya Diwan, Lisa Hellerstein, Nicole Megow, Jens Schlöter

Proceedings of the 43rd International Symposium on Theoretical Aspects of Computer Science, 2026

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

On the Complexity of Knapsack Under Explorable Uncertainty: Hardness and Algorithms.

Jens Schlöter

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

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

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

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty.

Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan

Proceedings of the Approximation, 2024

2023

Scheduling (Dagstuhl Seminar 23061).

Nicole Megow, Benjamin Moseley, David B. Shmoys, Ola Svensson, Sergei Vassilvitskii, Jens Schlöter

Dagstuhl Reports, February, 2023

Optimierung unter Erforschbarer Unsicherheit: Jenseits des Worst-Case.

Jens Schlöter

Proceedings of the Ausgezeichnete Informatikdissertationen 2023., 2023

Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques.

Nicole Megow, Jens Schlöter

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

Sorting and Hypergraph Orientation under Uncertainty with Predictions.

Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 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

Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty.

Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter

Proceedings of the 30th Annual European Symposium on Algorithms, 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

2021

Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty.

Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Throughput Scheduling with Equal Additive Laxity.

Martin Böhm, Nicole Megow, Jens Schlöter

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Untrusted Predictions Improve Trustable Query Policies.

Thomas Erlebach, Michael Hoffmann, Murilo S. de Lima, Nicole Megow, Jens Schlöter

CoRR, 2020

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.

Martin Böhm, Franziska Eberle, Nicole Megow, Lukas Nölke, Jens Schlöter, Bertrand Simon, Andreas Wiese

CoRR, 2020

On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems.

Alberto Marchetti-Spaccamela, Nicole Megow, Jens Schlöter, Martin Skutella, Leen Stougie

Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020