| Publication | Date of Publication | Type |
|---|
| On minimizing total earliness and tardiness of coupled-tasks - a complexity result | 2024-09-11 | Paper |
| The board packing problem | 2023-07-10 | Paper |
| The bin covering with delivery problem, extended investigations for the online case | 2023-06-22 | Paper |
| Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty | 2022-11-09 | Paper |
| Guillotine cutting is asymptotically optimal for packing consecutive squares | 2022-11-01 | Paper |
| Lower bounds on the performance of online algorithms for relaxed packing problems | 2022-08-30 | Paper |
| Lower bounds for batched bin packing | 2022-04-13 | Paper |
| Lower bounds on the performance of online algorithms for relaxed packing problems | 2022-01-16 | Paper |
| A first fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays | 2021-12-13 | Paper |
| A new heuristic and an exact approach for a production planning problem | 2021-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009562 | 2021-08-04 | Paper |
| An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time | 2021-07-22 | Paper |
| A new lower bound for classic online bin packing | 2021-06-30 | Paper |
| Quality of equilibria for selfish bin packing with cost sharing variants | 2021-01-15 | Paper |
| A new lower bound for classic online bin packing | 2020-08-24 | Paper |
| Online Scheduling with Machine Cost and a Quadratic Objective Function | 2020-07-20 | Paper |
| Online bin packing with cardinality constraints resolved | 2020-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111695 | 2020-05-27 | Paper |
| Quality of strong equilibria for selfish bin packing with uniform cost sharing | 2020-03-06 | Paper |
| Lower bounds for several online variants of bin packing | 2019-12-19 | Paper |
| A new lower bound on the price of anarchy of selfish bin packing | 2019-09-20 | Paper |
| Tight lower bounds for semi-online scheduling on two uniform machines with known optimum | 2019-09-02 | Paper |
| Pareto optimal equilibria for selfish bin packing with uniform cost sharing | 2019-06-25 | Paper |
| Using weight decision for decreasing the price of anarchy in selfish bin packing games | 2019-06-25 | Paper |
| The optimal absolute ratio for online bin packing | 2019-05-03 | Paper |
| Improved bounds for batch scheduling with nonidentical job sizes | 2019-05-02 | Paper |
| Restricted assignment scheduling with resource constraints | 2019-01-25 | Paper |
| Bin packing games with weight decision: how to get a small value for the price of anarchy | 2019-01-15 | Paper |
| The Convergence Time for Selfish Bin Packing | 2018-09-03 | Paper |
| Lower bounds for several online variants of bin packing | 2018-06-22 | Paper |
| Tight upper bounds for semi-online scheduling on two uniform machines with known optimum | 2018-06-15 | Paper |
| The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints | 2018-06-06 | Paper |
| Lower bound for 3-batched bin packing | 2018-05-24 | Paper |
| A general bin packing game: interest taken into account | 2018-05-18 | Paper |
| The intermediate price of anarchy (IPoA) in bin packing games | 2018-04-20 | Paper |
| Colored bin packing: online algorithms and lower bounds | 2018-02-28 | Paper |
| Multiprofessor scheduling | 2017-12-20 | Paper |
| The optimal absolute ratio for online bin packing | 2017-10-05 | Paper |
| Batched bin packing revisited | 2017-08-18 | Paper |
| A new and improved algorithm for online bin packing | 2017-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957914 | 2017-01-30 | Paper |
| Bounds for online bin packing with cardinality constraints | 2016-07-07 | Paper |
| New models of graph-bin packing | 2016-07-05 | Paper |
| Bin covering with a general profit function: approximability results | 2016-06-29 | Paper |
| Bin Packing Game with an Interest Matrix | 2015-10-29 | Paper |
| Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling | 2015-08-24 | Paper |
| Offline black and white bin packing | 2015-07-24 | Paper |
| The tight absolute bound of First Fit in the parameterized case | 2015-07-24 | Paper |
| Online results for black and white bin packing | 2015-05-12 | Paper |
| Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs | 2015-04-27 | Paper |
| The Convergence Time for Selfish Bin Packing | 2015-01-14 | Paper |
| ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER | 2014-11-14 | Paper |
| Colorful Bin Packing | 2014-09-02 | Paper |
| Optimal Analysis of Best Fit Bin Packing | 2014-07-01 | Paper |
| Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\) | 2014-01-13 | Paper |
| The generalization of scheduling with machine cost | 2014-01-13 | Paper |
| 2D knapsack: packing squares | 2013-12-19 | Paper |
| Bin packing with ``largest in bottom constraint: tighter bounds and generalizations | 2013-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2859441 | 2013-11-07 | Paper |
| Black and White Bin Packing | 2013-09-13 | Paper |
| A note on a selfish bin packing problem | 2013-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4913435 | 2013-04-05 | Paper |
| Semi-online hierarchical scheduling problems with buffer or rearrangements | 2013-03-20 | Paper |
| Online scheduling with one rearrangement at the end: revisited | 2012-10-23 | Paper |
| On the absolute approximation ratio for first fit and related results | 2012-08-10 | Paper |
| Online Minimum Makespan Scheduling with a Buffer | 2012-07-16 | Paper |
| New upper and lower bounds for online scheduling with machine cost | 2012-06-20 | Paper |
| THE GRAPH-BIN PACKING PROBLEM | 2012-03-13 | Paper |
| Optimal algorithms for online scheduling with bounded rearrangement at the end | 2012-01-09 | Paper |
| Preemptive Online Scheduling with Reordering | 2011-10-27 | Paper |
| 2D Knapsack: Packing Squares | 2011-06-03 | Paper |
| Online scheduling with rearrangement on two related machines | 2011-02-21 | Paper |
| Online scheduling with a buffer on related machines | 2010-10-26 | Paper |
| Preemptive Online Scheduling with Reordering | 2009-10-29 | Paper |
| Extension of algorithm list scheduling for a semi-online scheduling problem | 2009-04-14 | Paper |
| The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9 | 2009-03-03 | Paper |
| Preemptive scheduling on a small number of hierarchical machines | 2008-05-19 | Paper |
| Scheduling with machine cost and rejection | 2007-10-12 | Paper |
| On the machine scheduling problem with job delivery coordination | 2007-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3428807 | 2007-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3428830 | 2007-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3428842 | 2007-03-29 | Paper |
| Bin packing problems with rejection penalties and their dual problems | 2006-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3373906 | 2006-03-09 | Paper |
| Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines | 2006-03-02 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Semi-online scheduling jobs with tightly-grouped processing times on three identical machines | 2005-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4672931 | 2005-04-28 | Paper |
| Better Online Algorithms for Scheduling with Machine Cost | 2005-02-21 | Paper |
| Semi-online algorithms for parallel machine scheduling problems | 2004-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4793154 | 2003-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2714178 | 2001-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953918 | 2000-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953919 | 2000-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258705 | 1999-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4382119 | 1998-03-26 | Paper |
