| Publication | Date of Publication | Type |
|---|
| A 10/7-approximation for discrete bamboo garden trimming and continuous trimming on star graphs | 2025-01-14 | Paper |
| Allocating contiguous blocks of indivisible chores fairly | 2021-11-25 | Paper |
| Buffer minimization with conflicts on a line | 2021-07-08 | Paper |
| Buffer minimization with conflicts on a line | 2021-06-23 | Paper |
| A Unified Approach to Truthful Scheduling on Related Machines | 2019-05-15 | Paper |
| The optimal absolute ratio for online bin packing | 2019-05-03 | Paper |
| Reordering buffer management with advice | 2018-04-04 | Paper |
| Online bin stretching with three bins | 2018-02-28 | Paper |
| Beating the Harmonic Lower Bound for Online Bin Packing | 2017-12-19 | Paper |
| A two-phase algorithm for bin stretching with stretching factor 1.5 | 2017-11-16 | Paper |
| The optimal absolute ratio for online bin packing | 2017-10-05 | Paper |
| A unified approach to truthful scheduling on related machines | 2016-04-15 | Paper |
| Online scheduling of jobs with fixed start times on related machines | 2016-03-23 | Paper |
| Better Algorithms for Online Bin Stretching | 2015-11-20 | Paper |
| Dividing connected chores fairly | 2015-10-08 | Paper |
| Online algorithms with advice for bin packing and scheduling problems | 2015-09-16 | Paper |
| Online scheduling of splittable tasks | 2015-09-02 | Paper |
| This side up! | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501262 | 2015-08-03 | Paper |
| On the online unit clustering problem | 2014-09-09 | Paper |
| Reordering Buffer Management with Advice | 2014-09-02 | Paper |
| Real-time integrated prefetching and caching | 2014-08-18 | Paper |
| TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING | 2014-07-04 | Paper |
| The cost of selfishness for maximizing the minimum load on uniformly related machines | 2014-06-24 | Paper |
| Absolute approximation ratios for packing rectangles into bins | 2014-02-05 | Paper |
| A \((5/3+\varepsilon)\)-approximation for strip packing | 2014-01-22 | Paper |
| Maximizing the minimum load: the cost of selfishness | 2014-01-09 | Paper |
| A truthful constant approximation for maximizing the minimum load on related machines | 2013-12-19 | Paper |
| Dividing Connected Chores Fairly | 2013-10-23 | Paper |
| Online Scheduling of Jobs with Fixed Start Times on Related Machines | 2012-11-02 | Paper |
| The price of anarchy on uniformly related machines revisited | 2012-05-24 | Paper |
| A note on sorting buffers offline | 2012-05-14 | Paper |
| An improved algorithm for online rectangle filling | 2012-05-14 | Paper |
| Approximation schemes for packing splittable items with cardinality constraints | 2012-04-26 | Paper |
| Max-min Online Allocations with a Reordering Buffer | 2012-03-15 | Paper |
| A (5/3 + ε)-Approximation for Strip Packing | 2011-08-12 | Paper |
| Improved results for a memory allocation problem | 2011-04-01 | Paper |
| An Improved Algorithm for Online Rectangle Filling | 2011-02-15 | Paper |
| Max-min Online Allocations with a Reordering Buffer | 2010-09-07 | Paper |
| On strip packing With rotations | 2010-08-16 | Paper |
| On the Price of Stability for Undirected Network Design | 2010-05-11 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Maximizing the minimum load for selfish agents | 2009-12-01 | Paper |
| Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems | 2009-10-28 | Paper |
| Paging with request sets | 2009-08-06 | Paper |
| Online Job Admission | 2009-08-05 | Paper |
| Improved Results for a Memory Allocation Problem | 2009-02-17 | Paper |
| Online unit clustering: Variations on a theme | 2008-11-18 | Paper |
| A monotone approximation algorithm for scheduling with precedence constraints | 2008-08-06 | Paper |
| Packing Rectangles into 2OPT Bins Using Rotations | 2008-07-15 | Paper |
| Two-dimensional packing with conflicts | 2008-06-17 | Paper |
| Speed scaling of tasks with precedence constraints | 2008-06-06 | Paper |
| Online bin packing with resource augmentation | 2008-05-14 | Paper |
| The Price of Anarchy on Uniformly Related Machines Revisited | 2008-05-02 | Paper |
| Preemptive Scheduling on Selfish Machines | 2008-04-15 | Paper |
| Maximizing the Minimum Load for Selfish Agents | 2008-04-15 | Paper |
| Multi-dimensional Packing with Conflicts | 2008-02-26 | Paper |
| On the Online Unit Clustering Problem | 2008-02-20 | Paper |
| Approximation Schemes for Packing Splittable Items with Cardinality Constraints | 2008-02-20 | Paper |
| Bounds for online bounded space hypercube packing | 2008-01-18 | Paper |
| Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem | 2007-12-20 | Paper |
| Calculating lower bounds for caching problems | 2007-11-19 | Paper |
| Paging with Request Sets | 2007-09-07 | Paper |
| Paging with connections: FIFO strikes again | 2007-06-06 | Paper |
| Competitive Algorithms for Cottage Rental | 2007-05-29 | Paper |
| A study of integrated document and connection caching in the WWW | 2007-04-26 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Optimal Online Algorithms for Multidimensional Packing Problems | 2006-06-01 | Paper |
| Optimal on-line flow time with resource augmentation | 2006-04-28 | Paper |
| Improved competitive guarantees for QoS buffering | 2006-03-21 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Minimizing the total completion time on-line on a single machine, using restarts | 2005-12-08 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Minimizing the maximum starting time on-line | 2005-02-22 | Paper |
| An approximation algorithm for square packing. | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828973 | 2004-11-29 | Paper |
| Combining request scheduling with web caching | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737209 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737166 | 2004-08-11 | Paper |
| More on weighted servers or FIFO is better than LRU. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449210 | 2004-02-08 | Paper |
| Preemptive scheduling in overloaded systems. | 2003-08-19 | Paper |
| New bounds for multidimensional packing | 2003-08-17 | Paper |
| Resource augmentation in load balancing. | 2003-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411382 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411418 | 2003-07-08 | Paper |
| New Bounds for Variable-Sized Online Bin Packing | 2003-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708575 | 2003-06-18 | Paper |
| Lower bounds for on-line single-machine scheduling. | 2003-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782742 | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779156 | 2002-11-25 | Paper |
| Partial servicing of on-line jobs | 2002-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753745 | 2001-11-11 | Paper |
| Running a job on a collection of partly available machines, with on-line restarts | 2001-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721978 | 2001-07-11 | Paper |
