| Publication | Date of Publication | Type |
|---|
| Santa claus meets makespan and matroids: algorithms and reductions | 2024-11-28 | Paper |
| Matching augmentation via simultaneous contractions | 2024-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126344 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187032 | 2024-02-05 | Paper |
| Solution discovery via reconfiguration for problems in P | 2023-11-22 | Paper |
| Set selection under explorable stochastic uncertainty via covering techniques | 2023-11-09 | Paper |
| Configuration balancing for stochastic requests | 2023-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6062163 | 2023-10-31 | Paper |
| Online Throughput Maximization on Unrelated Machines: Commitment is No Burden | 2023-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075894 | 2023-09-20 | Paper |
| Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments | 2023-05-23 | Paper |
| Throughput scheduling with equal additive laxity | 2023-03-22 | Paper |
| Speed-robust scheduling: sand, bricks, and rocks | 2023-03-14 | Paper |
| Optimally Handling Commitment Issues in Online Throughput Maximization | 2023-02-07 | Paper |
| Throughput scheduling with equal additive laxity | 2022-10-17 | Paper |
| Online load balancing with general reassignment cost | 2022-07-22 | Paper |
| Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics | 2022-07-18 | Paper |
| On Hop-Constrained Steiner Trees in Tree-Like Metrics | 2022-06-03 | Paper |
| Speed-robust scheduling. Sand, bricks, and rocks | 2021-12-21 | Paper |
| Optimal algorithms for scheduling under time-of-use tariffs | 2021-11-09 | Paper |
| Scheduling with explorable uncertainty | 2021-06-15 | Paper |
| An adversarial model for scheduling with testing | 2020-11-11 | Paper |
| A general framework for handling commitment in online throughput maximization | 2020-08-28 | Paper |
| Correction to: approximation and online algorithms | 2020-08-24 | Paper |
| On index policies for stochastic minsum scheduling | 2020-02-10 | Paper |
| A general framework for handling commitment in online throughput maximization | 2020-02-06 | Paper |
| A new approach to online scheduling: approximating the optimal competitive ratio | 2019-05-15 | Paper |
| An \(\mathcal O(\log m)\)-competitive algorithm for online machine minimization | 2018-12-05 | Paper |
| Scheduling maintenance jobs in networks | 2018-12-04 | Paper |
| A new approach to online scheduling: approximating the optimal competitive ratio | 2018-11-05 | Paper |
| Minimum spanning tree under explorable uncertainty in theory and experiments | 2018-08-13 | Paper |
| Dual techniques for scheduling on a machine with varying speed | 2018-07-18 | Paper |
| An \(\mathcal{O}(\log m)\)-competitive algorithm for online machine minimization | 2018-07-16 | Paper |
| Stochastic and robust scheduling in the cloud | 2017-08-31 | Paper |
| Randomization Helps Computing a Minimum Spanning Tree under Uncertainty | 2017-07-21 | Paper |
| Scheduling maintenance jobs in networks | 2017-07-21 | Paper |
| Packing a knapsack of unknown capacity | 2017-07-14 | Paper |
| Scheduling Real-Time Mixed-Criticality Jobs | 2017-07-12 | Paper |
| Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (extended abstract) | 2017-05-16 | Paper |
| Packing a knapsack of unknown capacity | 2017-03-03 | Paper |
| The power of recourse for online MST and TSP | 2016-07-04 | Paper |
| Randomization helps computing a minimum spanning tree under uncertainty | 2015-11-19 | Paper |
| Optimal algorithms and a PTAS for cost-aware scheduling | 2015-09-16 | Paper |
| A tight 2-approximation for preemptive stochastic scheduling | 2015-04-24 | Paper |
| Clique partitioning with value-monotone submodular cost | 2015-04-09 | Paper |
| Algorithms and complexity for periodic real-time scheduling | 2014-12-05 | Paper |
| Algorithms and complexity for periodic real-time scheduling | 2014-05-22 | Paper |
| Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width | 2014-02-25 | Paper |
| On Eulerian extensions and their application to no-wait flowshop scheduling | 2014-02-05 | Paper |
| The power of recourse for online MST and TSP | 2013-08-12 | Paper |
| Dual techniques for scheduling on a machine with varying speed | 2013-08-06 | Paper |
| Online graph exploration: New results on old and new algorithms | 2013-01-07 | Paper |
| Universal sequencing on an unreliable machine | 2012-09-12 | Paper |
| Decision support and optimization in shutdown and turnaround scheduling | 2012-07-28 | Paper |
| A note on sorting buffers offline | 2012-05-14 | Paper |
| Online Graph Exploration: New Results on Old and New Algorithms | 2011-07-07 | Paper |
| Coping with Incomplete Information in Scheduling — Stochastic and Online Models | 2011-04-07 | Paper |
| Scheduling real-time mixed-criticality jobs | 2010-09-03 | Paper |
| Universal sequencing on a single machine | 2010-06-22 | Paper |
| Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width | 2010-05-11 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Models and Algorithms for Stochastic Online Scheduling | 2008-05-27 | Paper |
| Optimizing the landside operation of a container terminal | 2008-04-03 | Paper |
| Approximation in Preemptive Stochastic Online Scheduling | 2008-03-11 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| How to whack moles | 2006-09-14 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| On-line scheduling to minimize average completion time revisited. | 2005-01-11 | Paper |
