| Publication | Date of Publication | Type |
|---|
| On minimizing total earliness and tardiness of coupled-tasks - a complexity result | 2024-09-11 | Paper |
| Worst-case analysis for on-line data compression | 2024-07-05 | Paper |
| Joint replenishment meets scheduling | 2023-06-23 | Paper |
| Lower bounds for batched bin packing | 2022-04-13 | Paper |
| A first fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays | 2021-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009562 | 2021-08-04 | Paper |
| A new lower bound for classic online bin packing | 2021-06-30 | Paper |
| A new lower bound for classic online bin packing | 2020-08-24 | Paper |
| Online bin packing with cardinality constraints resolved | 2020-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111695 | 2020-05-27 | Paper |
| Lower bounds for several online variants of bin packing | 2019-12-19 | Paper |
| The optimal absolute ratio for online bin packing | 2019-05-03 | Paper |
| Integrated Vehicle Scheduling and Vehicle Assignment | 2018-09-03 | Paper |
| Regional Multicriteria and Multimodal Route Planning System for Public Transportation: A Case Study | 2018-09-03 | Paper |
| Lower bounds for several online variants of bin packing | 2018-06-22 | Paper |
| Lower bound for 3-batched bin packing | 2018-05-24 | Paper |
| Tight bounds for NF-based bounded-space online bin packing algorithms | 2018-03-01 | Paper |
| Driver scheduling for vehicle schedules using a set covering approach: a case study | 2017-10-19 | Paper |
| The optimal absolute ratio for online bin packing | 2017-10-05 | Paper |
| A new and improved algorithm for online bin packing | 2017-07-06 | Paper |
| Scheduling problems in the operative planning of public bus transportation | 2016-11-25 | Paper |
| Bounds for online bin packing with cardinality constraints | 2016-07-07 | Paper |
| Semi-on-line bin packing: a short overview and a new lower bound | 2016-06-29 | Paper |
| Offline black and white bin packing | 2015-07-24 | Paper |
| Online results for black and white bin packing | 2015-05-12 | Paper |
| Driver scheduling based on “driver-friendly” vehicle schedules | 2015-03-03 | Paper |
| A branch-and-bound algorithm for the coupled task problem | 2014-09-08 | Paper |
| Lower bounds for online makespan minimization on a small number of related machines | 2014-08-18 | Paper |
| On-line bin packing with restricted repacking | 2014-02-25 | Paper |
| Black and White Bin Packing | 2013-09-13 | Paper |
| On a multidimensional semi-on-line bin packing problem | 2012-08-29 | Paper |
| New lower bounds for certain classes of bin packing algorithms | 2012-08-08 | Paper |
| New Lower Bounds for Certain Classes of Bin Packing Algorithms | 2011-02-15 | Paper |
| Improved analysis of an algorithm for the coupled task problem with UET jobs | 2009-05-07 | Paper |
| Improved lower bounds for semi-online bin packing problems | 2009-04-27 | Paper |
| Lower Bound for the Online Bin Packing Problem with Restricted Repacking | 2009-03-16 | Paper |
| Matrix transpose on meshes with buses | 2007-03-29 | Paper |
| An exact algorithm for scheduling identical coupled tasks | 2005-02-11 | Paper |
| Worst-case analysis of the iterated longest fragment algorithm | 2002-07-14 | Paper |
| A 5/4 linear time bin packing algorithm | 2001-05-28 | Paper |
| Analysis of permutation routing algorithms | 2000-09-14 | Paper |
| Greedy Algorithms for On-Line Data Compression | 1998-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840319 | 1998-08-10 | Paper |
| The fractional greedy algorithm for data compression | 1996-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4836291 | 1995-07-25 | Paper |
