| Publication | Date of Publication | Type |
|---|
| The variable-width strip packing problem | 2022-12-09 | Paper |
| Online scheduling with machine cost and a quadratic objective function | 2020-07-20 | Paper |
| On-line and off-line approximation algorithms for vector covering problems | 2017-12-05 | Paper |
| Shelf algorithms for on-line strip packing | 2016-05-26 | Paper |
| On the sum-of-squares algorithm for bin packing | 2014-09-26 | Paper |
| Online clustering with variable sized clusters | 2013-03-05 | Paper |
| Online clustering with variable sized clusters | 2010-09-03 | Paper |
| On the sum minimization version of the online bin covering problem | 2010-08-13 | Paper |
| On the Sum-of-Squares algorithm for bin packing | 2008-12-21 | Paper |
| Index Assignment for Two-Channel Quantization | 2008-12-21 | Paper |
| Random-order bin packing | 2008-10-17 | Paper |
| A classification scheme for bin packing theory | 2007-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5709249 | 2005-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4672836 | 2005-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473995 | 2004-08-04 | Paper |
| Private computation using a PEZ dispenser. | 2004-03-14 | Paper |
| Resource augmentation for online bounded space bin packing | 2003-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796169 | 2003-03-02 | Paper |
| A comparative study of several feature transformation and learning methods for phoneme classification | 2003-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535068 | 2002-06-12 | Paper |
| The kernel of the Eisenstein ideal | 2002-04-22 | Paper |
| Better approximation algorithms for bin covering | 2002-03-24 | Paper |
| Bounded space on-line bin packing: Best is better than first | 2002-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754152 | 2001-12-09 | Paper |
| Two simple algorithms for bin covering | 2001-04-01 | Paper |
| On the genera of X_0(N) | 2000-06-13 | Paper |
| On-line and off-line approximation algorithms for vector covering problems | 1998-10-01 | Paper |
| An improved algorithm for computing the edit distance of run-length coded strings | 1997-02-28 | Paper |
| Optimal Strategy for the First Player in the Penney Ante Game | 1994-05-05 | Paper |
| The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm | 1994-03-13 | Paper |
| Two-dimensional rectangle packing: On-line methods and results | 1994-01-09 | Paper |
| An algorithm for matching run-length coded strings | 1993-12-20 | Paper |
| An on-line algorithm for multidimensional bin packing | 1993-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138967 | 1993-10-20 | Paper |
| The exact LPT-bound for maximizing the minimum completion time | 1992-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3988807 | 1992-06-28 | Paper |
| Probabilistic analysis of algorithms for dual bin packing problems | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3212291 | 1990-01-01 | Paper |
| An on-line algorithm for variable-sized bin packing | 1989-01-01 | Paper |
| Online algorithms for a dual version of bin packing | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4728248 | 1987-01-01 | Paper |
| A probabilistic analysis of the next fit decreasing bin packing heuristic | 1986-01-01 | Paper |
| An O(n) bin-packing algorithm for uniformly distributed data | 1986-01-01 | Paper |
| Bin packing as a random walk: A note on Knödel's paper | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787466 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787789 | 1986-01-01 | Paper |
