Jens Schlöter

Publication Activity (10 Years)

Years Active: 2020-2024
Publications (10 Years): 22

Top Topics

Precedence Constraints

Top Venues

Oper. Res. Lett.

Publications

Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter
Santa Claus meets Makespan and Matroids: Algorithms and Reductions. SODA (2024)
Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Jens Schlöter
Accelerating Matroid Optimization through Fast Imprecise Oracles. CoRR (2024)
Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan
Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. CoRR (2024)
Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
Sorting and Hypergraph Orientation under Uncertainty with Predictions. CoRR (2023)
Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter
Santa Claus meets Makespan and Matroids: Algorithms and Reductions. CoRR (2023)
Alexandra Anna Lassota, Alexander Lindermayr, Nicole Megow, Jens Schlöter
Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints. ICML (2023)
Nicole Megow, Jens Schlöter
Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques. IPCO (2023)
Nicole Megow, Benjamin Moseley, David B. Shmoys, Ola Svensson, Sergei Vassilvitskii, Jens Schlöter
Scheduling (Dagstuhl Seminar 23061). Dagstuhl Reports 13 (2) (2023)
Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter
Sorting and Hypergraph Orientation under Uncertainty with Predictions. IJCAI (2023)
Alexandra Lassota, Alexander Lindermayr, Nicole Megow, Jens Schlöter
Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints. CoRR (2023)
Martin Böhm, Nicole Megow, Jens Schlöter
Throughput scheduling with equal additive laxity. Oper. Res. Lett. 50 (5) (2022)
Nicole Megow, Jens Schlöter
Set Selection under Explorable Stochastic Uncertainty via Covering Techniques. CoRR (2022)
Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. ESA (2022)
Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter
Robustification of Online Graph Exploration Methods. AAAI (2022)
Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. CoRR (2022)
Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter
Robustification of Online Graph Exploration Methods. CoRR (2021)
Martin Böhm, Nicole Megow, Jens Schlöter
Throughput Scheduling with Equal Additive Laxity. CIAC (2021)
Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter
Orienting (hyper)graphs under explorable stochastic uncertainty. CoRR (2021)
Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. ESA (2021)
Martin Böhm, Franziska Eberle, Nicole Megow, Lukas Nölke, Jens Schlöter, Bertrand Simon, Andreas Wiese
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. CoRR (2020)
Alberto Marchetti-Spaccamela, Nicole Megow, Jens Schlöter, Martin Skutella, Leen Stougie
On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems. IPDPS (2020)
Thomas Erlebach, Michael Hoffmann, Murilo S. de Lima, Nicole Megow, Jens Schlöter
Untrusted Predictions Improve Trustable Query Policies. CoRR (2020)