| Publication | Date of Publication | Type |
|---|
| Min-max relative regret for scheduling to minimize maximum lateness | 2023-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875658 | 2023-02-03 | Paper |
| Two-Agent Scheduling with Resource Augmentation on Multiple Machines | 2022-12-09 | Paper |
| Scheduling on hybrid platforms: improved approximability window | 2022-10-13 | Paper |
| Exact algorithms for scheduling programs with shared tasks | 2022-07-18 | Paper |
| Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines | 2021-08-04 | Paper |
| Generic Algorithms for Scheduling Applications on Hybrid Multi-core Machines | 2020-02-24 | Paper |
| Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems | 2019-08-20 | Paper |
| Energy-efficient scheduling and routing via randomized rounding | 2018-11-07 | Paper |
| Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality | 2018-03-02 | Paper |
| Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem | 2017-12-06 | Paper |
| Scheduling on power-heterogeneous processors | 2017-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2963934 | 2017-02-21 | Paper |
| From Preemptive to Non-preemptive Scheduling Using Rejections | 2016-09-02 | Paper |
| Scheduling on Power-Heterogeneous Processors | 2016-05-03 | Paper |
| Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems | 2015-11-19 | Paper |
| Speed-Scaling with No Preemptions | 2015-09-11 | Paper |
| Green scheduling, flows and matchings | 2015-05-18 | Paper |
| From preemptive to non-preemptive speed-scaling scheduling | 2014-12-05 | Paper |
| On multiprocessor temperature-aware scheduling problems | 2014-08-18 | Paper |
| Bounded max-colorings of graphs | 2014-04-28 | Paper |
| From Preemptive to Non-preemptive Speed-Scaling Scheduling | 2013-06-11 | Paper |
| Exact and Approximation Algorithms for Densest k-Subgraph | 2013-04-12 | Paper |
| Improved approximation algorithms for the max edge-coloring problem | 2013-04-04 | Paper |
| Green Scheduling, Flows and Matchings | 2013-03-21 | Paper |
| Online maximum \(k\)-coverage | 2012-08-10 | Paper |
| On Multiprocessor Temperature-Aware Scheduling Problems | 2012-07-16 | Paper |
| The \textsc{max quasi-independent set} problem | 2012-07-10 | Paper |
| Online Maximum k-Coverage | 2011-08-19 | Paper |
| Improved Approximation Algorithms for the Max-Edge Coloring Problem | 2011-05-12 | Paper |
| On the max-weight edge coloring problem | 2010-12-21 | Paper |
| Bounded Max-colorings of Graphs | 2010-12-09 | Paper |
| Approximating the max-edge-coloring problem | 2010-08-11 | Paper |
| The max quasi-independent set Problem | 2010-06-22 | Paper |
| Approximating the Max Edge-Coloring Problem | 2009-12-11 | Paper |
| On the Maximum Edge Coloring Problem | 2009-02-12 | Paper |
