No. Title Author Year
1 Double Coverage with Machine-Learned Advice Lindermayr, Alexander et al. 2022
2 Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time Eberle, Franziska et al. 2021
3 Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty Bampis, Evripidis et al. 2021
4 Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics Böhm, Martin et al. 2020
5 Energy Minimization in DAG Scheduling on MPSoCs at Run-Time: Theory and Practice Simon, Bertrand et al. 2020
6 Online Minimum Cost Matching with Recourse on the Line Megow, Nicole et al. 2020
7 Optimally Handling Commitment Issues in Online Throughput Maximization Eberle, Franziska et al. 2020
8 Scheduling (Dagstuhl Seminar 20081) Megow, Nicole et al. 2020
9 Scheduling Self-Suspending Tasks: New and Old Results Chen, Jian-Jia et al. 2019
10 Scheduling Self-Suspending Tasks: New and Old Results (Artifact) Chen, Jian-Jia et al. 2019
11 Scheduling (Dagstuhl Seminar 18101) Halldórson, Magnús M. et al. 2018
12 Scheduling with Explorable Uncertainty Dürr, Christoph et al. 2018
13 Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments Focke, Jacob et al. 2017
14 Scheduling (Dagstuhl Seminar 16081) Bansal, Nikhil et al. 2016
15 Stochastic and Robust Scheduling in the Cloud Chen, Lin et al. 2015
16 Packing a Knapsack of Unknown Capacity Disser, Yann et al. 2014
17 Models and Algorithms for Stochastic Online Scheduling Megow, Nicole et al. 2005
Current Page :
Number of result pages: 1
Number of documents: 17


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI