| Publication | Date of Publication | Type |
|---|
| Total completion time scheduling under scenarios | 2024-07-19 | Paper |
| New models of graph-bin packing | 2016-07-05 | Paper |
| Online hypergraph coloring with rejection | 2015-08-04 | Paper |
| Online file caching with rejection penalties | 2015-05-26 | Paper |
| The online \(k\)-server problem with rejection | 2015-04-09 | Paper |
| An online 2-dimensional clustering problem with variable sized clusters | 2014-08-27 | Paper |
| Online data clustering algorithms in an RTLS system | 2014-08-19 | Paper |
| Bin covering with cardinality constraints | 2014-04-22 | Paper |
| The generalization of scheduling with machine cost | 2014-01-13 | Paper |
| Online clustering with variable sized clusters | 2013-03-05 | Paper |
| THE GRAPH-BIN PACKING PROBLEM | 2012-03-13 | Paper |
| Pickup and Delivery Vehicle Routing with Multidimensional Loading Constraints | 2011-12-19 | Paper |
| Parameter learning algorithm for the online data acknowledgment problem | 2011-10-12 | Paper |
| On Variants of File Caching | 2011-07-06 | Paper |
| Online facility location with facility movements | 2011-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3077271 | 2011-02-22 | 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 |
| Class constrained bin packing revisited | 2010-08-11 | Paper |
| Online hypergraph coloring | 2010-06-09 | Paper |
| Class constrained bin covering | 2010-05-10 | Paper |
| Parameter Learning Online Algorithm for Multiprocessor Scheduling with Rejection | 2010-04-08 | Paper |
| Reduction techniques for the PNS problems: a novel technique and a review | 2009-12-02 | Paper |
| Online scheduling with general machine cost functions | 2009-06-24 | Paper |
| Heuristic algorithms for a complex parallel machine scheduling problem | 2009-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3615306 | 2009-03-19 | Paper |
| On Time Lookahead Algorithms for the Online Data Acknowledgement Problem | 2008-09-17 | Paper |
| Online scheduling with machine cost and rejection | 2007-11-30 | Paper |
| Learning lexicographic orders | 2007-07-04 | Paper |
| On-line scheduling with general machine cost functions | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3428835 | 2007-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4819887 | 2004-10-05 | Paper |
| More on weighted servers or FIFO is better than LRU. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4439451 | 2003-12-14 | Paper |
| Scheduling problems on two sets of identical machines | 2003-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708575 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796169 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4530399 | 2003-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3150792 | 2002-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535068 | 2002-06-12 | Paper |
| A new well-solvable class of PNS problems | 2002-04-09 | Paper |
| Online strip packing with modifiable boxes | 2001-12-05 | Paper |
| On a merging reduction of the process network synthesis problem | 2001-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941834 | 2000-03-19 | Paper |
