Jens Schlöter

35 papers A* 6A 6B 1C 1Journal 20
YearRankTypeTitle / Venue / Authors
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 A conf
Optimal Verification of a Minimum-Weight Basis in an Uncertainty Matroid.
STACS
Haya Diwan, Lisa Hellerstein, Nicole Megow, Jens Schlöter
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
Non-Clairvoyant Scheduling with Progress Bars.
CoRR
Ziyad Benomar, Romain Cosson, Alexander Lindermayr, Jens Schlöter
2025 A conf
On the Complexity of Knapsack Under Explorable Uncertainty: Hardness and Algorithms.
ESA
Jens Schlöter
2025 J jnl
On the Complexity of Knapsack under Explorable Uncertainty: Hardness and Algorithms.
CoRR
Jens Schlöter
2025 J jnl
Optimal Verification of a Minimum-Weight Basis in an Uncertainty Matroid.
CoRR
Haya Diwan, Lisa Hellerstein, Nicole Megow, Jens Schlöter
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 A conf
Competitive Query Minimization for Stable Matching with One-Sided Uncertainty.
APPROX/RANDOM
Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan
2024 J jnl
Competitive Query Minimization for Stable Matching with One-Sided Uncertainty.
CoRR
Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan
2024 A* conf
Santa Claus meets Makespan and Matroids: Algorithms and Reductions.
SODA
Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter
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 — ch.
Optimierung unter Erforschbarer Unsicherheit: Jenseits des Worst-Case.
Ausgezeichnete Informatikdissertationen
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 J jnl
Scheduling (Dagstuhl Seminar 23061).
Dagstuhl Reports
Nicole Megow, Benjamin Moseley, David B. Shmoys, Ola Svensson, Sergei Vassilvitskii, Jens Schlöter
2023 B conf
Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques.
IPCO
Nicole Megow, Jens Schlöter
2023 A* conf
Sorting and Hypergraph Orientation under Uncertainty with Predictions.
IJCAI
Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter
2023 J jnl
Sorting and Hypergraph Orientation under Uncertainty with Predictions.
CoRR
Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
2022 A conf
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty.
ESA
Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
2022 J jnl
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty.
CoRR
Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
2022 A* conf
Robustification of Online Graph Exploration Methods.
AAAI
Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter
2022 J jnl
Set Selection under Explorable Stochastic Uncertainty via Covering Techniques.
CoRR
Nicole Megow, Jens Schlöter
2022 J jnl
Throughput scheduling with equal additive laxity.
Oper. Res. Lett.
Martin Böhm, Nicole Megow, Jens Schlöter
2021 A conf
Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty.
ESA
Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
2021 J jnl
Orienting (hyper)graphs under explorable stochastic uncertainty.
CoRR
Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter
2021 J jnl
Robustification of Online Graph Exploration Methods.
CoRR
Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter
2021 C conf
Throughput Scheduling with Equal Additive Laxity.
CIAC
Martin Böhm, Nicole Megow, Jens Schlöter
2020 J jnl
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.
CoRR
Martin Böhm, Franziska Eberle, Nicole Megow, Lukas Nölke, Jens Schlöter, Bertrand Simon, Andreas Wiese
2020 A conf
On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems.
IPDPS
Alberto Marchetti-Spaccamela, Nicole Megow, Jens Schlöter, Martin Skutella, Leen Stougie
2020 J jnl
Untrusted Predictions Improve Trustable Query Policies.
CoRR
Thomas Erlebach, Michael Hoffmann, Murilo S. de Lima, Nicole Megow, Jens Schlöter