| Publication | Date of Publication | Type |
|---|
| Minimizing makespan for parallelizable jobs with energy constraint | 2024-11-25 | Paper |
| An exact solution with an improved running time for the routing flow shop problem with two machines | 2024-10-16 | Paper |
| On cluster editing problem with clusters of small sizes | 2024-08-16 | Paper |
| An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements | 2024-05-06 | Paper |
| LP-based algorithms for multistage minimization problems | 2022-03-22 | Paper |
| A simple rounding scheme for multistage optimization | 2022-02-21 | Paper |
| A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes | 2021-04-19 | Paper |
| Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\) | 2019-10-07 | Paper |
| Energy-efficient scheduling and routing via randomized rounding | 2018-11-07 | Paper |
| Single-machine scheduling with supporting tasks | 2018-05-24 | Paper |
| Short Survey on Graph Correlation Clustering with Minimization Criteria | 2018-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2963934 | 2017-02-21 | Paper |
| Efficient approximation algorithms for the routing open shop problem | 2016-11-14 | Paper |
| Clustering on \(k\)-edge-colored graphs | 2016-11-02 | Paper |
| A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job | 2016-05-13 | Paper |
| Relocation scheduling subject to fixed processing sequences | 2016-05-12 | Paper |
| Min-Power Covering Problems | 2016-01-11 | Paper |
| From preemptive to non-preemptive speed-scaling scheduling | 2014-12-05 | Paper |
| Bounded max-colorings of graphs | 2014-04-28 | Paper |
| A complete 4-parametric complexity classification of short shop scheduling problems | 2014-02-05 | Paper |
| Clustering on k-Edge-Colored Graphs | 2013-09-20 | Paper |
| From Preemptive to Non-preemptive Speed-Scaling Scheduling | 2013-06-11 | Paper |
| Integer preemptive scheduling on parallel machines | 2013-03-05 | Paper |
| Graph structure analysis and computational tractability of scheduling problems | 2012-09-05 | Paper |
| Computational complexity of the graph approximation problem | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115718 | 2012-02-10 | Paper |
| Properties of optimal schedules in preemptive shop scheduling | 2011-03-10 | Paper |
| Bounded Max-colorings of Graphs | 2010-12-09 | Paper |
| The Routing Open Shop Problem: New Approximation Algorithms | 2010-05-11 | Paper |
| Minimizing the total weighted completion time in the relocation problem | 2010-04-21 | Paper |
| Integrality Property in Preemptive Parallel Machine Scheduling | 2009-08-18 | Paper |
| Complete Complexity Classification of Short Shop Scheduling | 2009-08-18 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Approximation Algorithms for Scheduling Problems with Exact Delays | 2008-02-21 | Paper |
| Customer order scheduling to minimize the number of late jobs | 2007-07-04 | Paper |
| Bicriteria approximation algorithms for scheduling problems with communications delays | 2007-05-15 | Paper |
| On relocation problems with multiple identical working crews | 2007-02-20 | Paper |
| Open block scheduling in optical communication networks | 2006-09-14 | Paper |
| Scheduling tasks with small communication delays for clusters of processors | 2004-08-10 | Paper |
| On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. | 2004-03-14 | Paper |
| A linear time approximation scheme for makespan minimization in an open shop with release dates | 2003-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796176 | 2003-03-02 | Paper |
| A polynomially solvable case of the two-stage open shop problem for three machines | 2001-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527276 | 2001-02-04 | Paper |
| When difference in machine loads leads to efficient scheduling in open shops | 2000-01-11 | Paper |
