Jens Schlöter

Orcid: 0000-0003-0555-4806

According to our database1, Jens Schlöter 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
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
Scheduling (Dagstuhl Seminar 23061).
Dagstuhl Reports, February, 2023

Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

Sorting and Hypergraph Orientation under Uncertainty with Predictions.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

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

2022
Throughput scheduling with equal additive laxity.
Oper. Res. Lett., 2022

Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

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

2021
Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020
Untrusted Predictions Improve Trustable Query Policies.
CoRR, 2020

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.
CoRR, 2020

On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems.
Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020


  Loading...