| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6090878 | 2023-11-20 | Paper |
| Bin stretching with migration on two hierarchical machines | 2023-09-06 | Paper |
| Parallel solutions for ordinal scheduling with a small number of machines | 2023-08-22 | Paper |
| Parallel solutions for preemptive makespan scheduling on two identical machines | 2023-06-23 | Paper |
| Online bin packing of squares and cubes | 2023-04-28 | Paper |
| Online bin covering with limited migration | 2023-03-10 | Paper |
| Several methods of analysis for cardinality constrained bin packing | 2022-12-21 | Paper |
| On two dimensional packing | 2022-12-09 | Paper |
| Online scheduling with migration on two hierarchical machines | 2022-10-31 | Paper |
| Several methods of analysis for cardinality constrained bin packing | 2022-10-19 | Paper |
| Open-end bin packing: new and old analysis approaches | 2022-09-15 | Paper |
| Lower bounds on the performance of online algorithms for relaxed packing problems | 2022-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075753 | 2022-05-11 | Paper |
| Lower bounds for batched bin packing | 2022-04-13 | Paper |
| Online bin packing of squares and cubes | 2022-03-25 | Paper |
| More on ordered open end bin packing | 2022-01-14 | Paper |
| On-line machine covering | 2021-12-20 | Paper |
| Starting time minimization for the maximum job variant | 2021-12-07 | Paper |
| On bin packing with clustering and bin packing with delays | 2021-10-19 | Paper |
| Selfish vector packing | 2021-09-02 | 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 note on a variant of the online open end bin packing problem | 2021-04-07 | 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 bin packing with cardinality constraints resolved | 2020-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111695 | 2020-05-27 | Paper |
| An optimal online algorithm for scheduling with general machine cost functions | 2020-04-22 | Paper |
| Quality of strong equilibria for selfish bin packing with uniform cost sharing | 2020-03-06 | Paper |
| Lower bounds for online bin covering-type problems | 2020-03-06 | Paper |
| Lower bounds for several online variants of bin packing | 2019-12-19 | Paper |
| Robust algorithms for total completion time | 2019-11-28 | Paper |
| A lower bound for online rectangle packing | 2019-10-29 | Paper |
| A new lower bound on the price of anarchy of selfish bin packing | 2019-09-20 | Paper |
| Pareto optimal equilibria for selfish bin packing with uniform cost sharing | 2019-06-25 | Paper |
| The benefit of preemption with respect to the \(\ell_p\) norm | 2019-06-11 | Paper |
| A Unified Approach to Truthful Scheduling on Related Machines | 2019-05-15 | Paper |
| The benefit of preemption for single machine scheduling so as to minimize total weighted completion time | 2019-01-15 | Paper |
| Batch coloring of graphs | 2019-01-11 | Paper |
| On the performance guarantee of first fit for sum coloring | 2018-12-10 | Paper |
| Online-bounded analysis | 2018-11-07 | Paper |
| A survey on makespan minimization in semi-online environments | 2018-11-07 | Paper |
| More on batched bin packing | 2018-10-01 | Paper |
| The Metric Dimension of Two-Dimensional Extended Meshes | 2018-09-03 | Paper |
| The Convergence Time for Selfish Bin Packing | 2018-09-03 | Paper |
| Min-sum bin packing | 2018-07-20 | Paper |
| Lower bounds for several online variants of bin packing | 2018-06-22 | Paper |
| The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints | 2018-06-06 | Paper |
| The weighted 2-metric dimension of trees in the non-landmarks model | 2018-05-24 | Paper |
| Improved bounds for randomized preemptive online matching | 2018-03-21 | Paper |
| Colored bin packing: online algorithms and lower bounds | 2018-02-28 | Paper |
| The \(k\)-metric dimension | 2017-10-17 | Paper |
| Scheduling selfish jobs on multidimensional parallel machines | 2017-09-12 | Paper |
| Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times | 2017-08-18 | Paper |
| Batch Coloring of Graphs | 2017-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957900 | 2017-01-30 | Paper |
| Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines | 2017-01-27 | Paper |
| Packing Resizable Items with Application to Video Delivery over Wireless Networks | 2016-12-19 | Paper |
| An AFPTAS for variable sized bin packing with general activation costs | 2016-11-14 | Paper |
| Online Bounded Analysis | 2016-07-25 | Paper |
| Bounds for online bin packing with cardinality constraints | 2016-07-07 | Paper |
| A Unified Approach to Truthful Scheduling on Related Machines | 2016-04-15 | Paper |
| Vertex cover meets scheduling | 2016-04-06 | Paper |
| Online scheduling of jobs with fixed start times on related machines | 2016-03-23 | Paper |
| Parametric packing of selfish items and the subset sum algorithm | 2016-03-23 | Paper |
| Online scheduling of unit jobs on three machines with rejection: a tight result | 2016-01-05 | Paper |
| Selfish Vector Packing | 2015-11-19 | Paper |
| The (weighted) metric dimension of graphs: hard and easy cases | 2015-09-02 | 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 |
| Offline black and white bin packing | 2015-07-24 | Paper |
| Rent or buy problems with a fixed time horizon | 2015-05-29 | Paper |
| Online file caching with rejection penalties | 2015-05-26 | Paper |
| Online results for black and white bin packing | 2015-05-12 | Paper |
| Transactional contention management as a non-clairvoyant scheduling problem | 2015-03-10 | Paper |
| Online scheduling with rejection and reordering: exact algorithms for unit size jobs | 2015-01-21 | Paper |
| The Convergence Time for Selfish Bin Packing | 2015-01-14 | Paper |
| Robust algorithms for preemptive scheduling | 2014-11-19 | Paper |
| An efficient polynomial time approximation scheme for load balancing on uniformly related machines | 2014-10-17 | Paper |
| Packing resizable items with application to video delivery over wireless networks | 2014-09-18 | Paper |
| On the online unit clustering problem | 2014-09-09 | Paper |
| Colorful Bin Packing | 2014-09-02 | Paper |
| Preemptive online scheduling with rejection of unit jobs on two uniformly related machines | 2014-08-18 | Paper |
| The cost of selfishness for maximizing the minimum load on uniformly related machines | 2014-06-24 | Paper |
| Approximate strong equilibria in job scheduling games with two uniformly related machines | 2014-04-22 | Paper |
| Bin covering with cardinality constraints | 2014-04-22 | Paper |
| Comparing online algorithms for bin packing problems | 2014-02-05 | Paper |
| Selfish bin packing with cardinality constraints | 2014-01-10 | Paper |
| Maximizing the minimum load: the cost of selfishness | 2014-01-09 | Paper |
| Robust Approximation Schemes for Cube Packing | 2013-09-25 | Paper |
| Bin Packing Games with Selfish Items | 2013-09-20 | Paper |
| Rent or Buy Problems with a Fixed Time Horizon | 2013-09-20 | Paper |
| Online clustering with variable sized clusters | 2013-03-05 | Paper |
| On the max coloring problem | 2012-11-27 | Paper |
| The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases | 2012-11-06 | Paper |
| Online Scheduling of Jobs with Fixed Start Times on Related Machines | 2012-11-02 | Paper |
| Universal Sequencing on an Unreliable Machine | 2012-09-12 | Paper |
| On the absolute approximation ratio for first fit and related results | 2012-08-10 | Paper |
| Online variable-sized bin packing with conflicts | 2012-06-20 | Paper |
| The price of anarchy on uniformly related machines revisited | 2012-05-24 | Paper |
| Bin packing with general cost structures | 2012-04-27 | Paper |
| Approximation schemes for packing splittable items with cardinality constraints | 2012-04-26 | Paper |
| On equilibria for ADM minimization games | 2012-04-26 | Paper |
| Selfish bin coloring | 2012-04-04 | Paper |
| Max-min Online Allocations with a Reordering Buffer | 2012-03-15 | Paper |
| Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model | 2012-03-15 | Paper |
| Randomized algorithms for online bounded bidding | 2012-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113762 | 2012-01-23 | Paper |
| Online scheduling with rejection and withdrawal | 2011-12-07 | Paper |
| Preemptive Online Scheduling with Reordering | 2011-10-27 | Paper |
| Robust Algorithms for Preemptive Scheduling | 2011-09-16 | Paper |
| On Variants of File Caching | 2011-07-06 | Paper |
| Selfish bin packing | 2011-05-10 | Paper |
| Improved results for a memory allocation problem | 2011-04-01 | Paper |
| Graph coloring with rejection | 2011-03-28 | Paper |
| AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items | 2011-03-21 | Paper |
| Dynamic multi-dimensional bin packing | 2011-01-20 | Paper |
| Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy | 2010-12-13 | Paper |
| Online scheduling with a buffer on related machines | 2010-10-26 | Paper |
| Max-min Online Allocations with a Reordering Buffer | 2010-09-07 | 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 |
| Improved randomized results for the interval selection problem | 2010-08-11 | Paper |
| Two-dimensional online bin packing with rotation | 2010-07-07 | Paper |
| Universal Sequencing on a Single Machine | 2010-06-22 | Paper |
| Asymptotic fully polynomial approximation schemes for variants of open-end bin packing | 2010-06-09 | Paper |
| Tight results for next fit and worst fit with resource augmentation | 2010-06-07 | Paper |
| Online Capacitated Interval Coloring | 2010-06-01 | Paper |
| Class constrained bin covering | 2010-05-10 | Paper |
| Resource augmented semi-online bounded space bin packing | 2010-04-28 | Paper |
| Minimization of SONET ADMs in ring networks revisited | 2010-04-12 | Paper |
| Transactional contention management as a Non-clairvoyant scheduling problem | 2010-03-04 | Paper |
| Bin packing with rejection revisited | 2010-02-23 | Paper |
| On online bin packing with LIB constraints | 2010-01-08 | Paper |
| Maximizing the minimum load for selfish agents | 2009-12-01 | Paper |
| On Equilibria for ADM Minimization Games | 2009-12-01 | Paper |
| Semi-online machine covering for two uniform machines | 2009-11-06 | Paper |
| Preemptive Online Scheduling with Reordering | 2009-10-29 | Paper |
| Weighted sum coloring in batch scheduling of conflicting jobs | 2009-10-23 | Paper |
| Optimally competitive list batching | 2009-09-10 | Paper |
| On Bin Packing with Conflicts | 2009-08-20 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Paging with request sets | 2009-08-06 | Paper |
| Variable sized online interval coloring with bandwidth | 2009-06-17 | Paper |
| A robust APTAS for the classical bin packing problem | 2009-04-24 | Paper |
| An APTAS for Generalized Cost Variable-Sized Bin Packing | 2009-03-16 | Paper |
| A Robust APTAS for the Classical Bin Packing Problem | 2009-03-12 | Paper |
| Better bounds for minimizing SONET ADMs | 2009-03-11 | Paper |
| Bin packing with controllable item sizes | 2009-03-04 | Paper |
| Online Capacitated Interval Coloring | 2009-03-03 | Paper |
| Improved Results for a Memory Allocation Problem | 2009-02-17 | Paper |
| Caching Content under Digital Rights Management | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5503436 | 2009-01-15 | Paper |
| Selfish Bin Packing | 2008-11-25 | Paper |
| Improved Randomized Results for That Interval Selection Problem | 2008-11-25 | Paper |
| More on online bin packing with two item sizes | 2008-11-19 | Paper |
| Online unit clustering: Variations on a theme | 2008-11-18 | Paper |
| Online interval coloring with packing constraints | 2008-11-18 | Paper |
| Two-dimensional packing with conflicts | 2008-06-17 | Paper |
| Optimal on-line algorithms to minimize makespan on two machines with resource augmentation | 2008-06-06 | Paper |
| The hierarchical model for load balancing on two machines | 2008-06-04 | Paper |
| Preemptive scheduling on a small number of hierarchical machines | 2008-05-19 | Paper |
| A PTAS for delay minimization in establishing wireless conference calls | 2008-05-16 | 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 |
| Graph Coloring with Rejection | 2008-03-11 | Paper |
| Multi-dimensional Packing with Conflicts | 2008-02-26 | Paper |
| Bin Packing with Rejection Revisited | 2008-02-21 | Paper |
| On Bin Packing with Conflicts | 2008-02-21 | Paper |
| On the Max Coloring Problem | 2008-02-20 | Paper |
| On the Online Unit Clustering Problem | 2008-02-20 | Paper |
| Minimum Weighted Sum Bin Packing | 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 |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| SONET ADMs minimization with divisible paths | 2007-11-28 | Paper |
| Calculating lower bounds for caching problems | 2007-11-19 | Paper |
| Online Bin Packing with Cardinality Constraints | 2007-11-16 | Paper |
| Semi-online scheduling with ``end of sequence information | 2007-11-14 | Paper |
| Separating online scheduling algorithms with the relative worst order ratio | 2007-10-12 | Paper |
| Paging with Request Sets | 2007-09-07 | Paper |
| Variable Sized Online Interval Coloring with Bandwidth | 2007-09-07 | Paper |
| Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs | 2007-08-28 | Paper |
| Paging with connections: FIFO strikes again | 2007-06-06 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| On the remote server problem or more about TCP acknowledgments | 2007-01-09 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| The maximum resource bin packing problem | 2006-10-20 | Paper |
| The conference call search problem in wireless networks | 2006-09-14 | Paper |
| Load balancing of temporary tasks in the \(\ell _{p}\) norm | 2006-09-14 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Optimal Online Algorithms for Multidimensional Packing Problems | 2006-06-01 | Paper |
| Vector assignment schemes for asymmetric settings | 2006-05-26 | Paper |
| Optimal on-line flow time with resource augmentation | 2006-04-28 | Paper |
| The chord version for SONET ADMs minimization | 2006-03-20 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Optimal preemptive scheduling for general target functions | 2006-01-10 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Optimal non-preemptive semi-online scheduling on two related machines | 2005-11-16 | Paper |
| Online square and cube packing | 2005-10-31 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Tight bounds for bandwidth allocation on two links | 2005-08-17 | Paper |
| Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data | 2005-03-08 | Paper |
| On-Line Load Balancing of Temporary Tasks on Identical Machines | 2005-02-28 | Paper |
| Minimizing the maximum starting time on-line | 2005-02-22 | Paper |
| Approximation schemes for the min-max starting time problem | 2005-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828923 | 2004-11-29 | Paper |
| Approximation schemes for scheduling on uniformly related and identical parallel machines | 2004-09-22 | Paper |
| All-norm approximation algorithms | 2004-09-08 | Paper |
| All-Norm Approximation Algorithms | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808668 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737166 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737209 | 2004-08-11 | Paper |
| More on weighted servers or FIFO is better than LRU. | 2004-03-14 | Paper |
| Vector assignment problems: a general framework | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4439452 | 2003-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4439453 | 2003-12-14 | Paper |
| Bin stretching revisited | 2003-09-01 | Paper |
| Preemptive scheduling in overloaded systems. | 2003-08-19 | Paper |
| Temporary tasks assignment resolved | 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/Q4411383 | 2003-07-08 | Paper |
| New Bounds for Variable-Sized Online Bin Packing | 2003-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708574 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708575 | 2003-06-18 | Paper |
| Lower bounds for on-line single-machine scheduling. | 2003-05-25 | Paper |
| On-line scheduling of unit time jobs with rejection: Minimizing the total completion time | 2003-05-04 | Paper |
| Optimal preemptive semi-online scheduling to minimize makespan on two related machines | 2003-04-03 | Paper |
| On-line restricted assignment of temporary tasks with unknown durations. | 2003-01-21 | Paper |
| Online variable sized covering | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782742 | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779156 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4553241 | 2002-11-04 | Paper |
| Fair versus unrestricted bin packing | 2002-09-25 | Paper |
| A note on on-line scheduling with precedence constraints on identical machines | 2002-07-25 | Paper |
| On-line scheduling with precedence constraints | 2002-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762508 | 2002-01-09 | Paper |
| Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios | 2001-12-05 | Paper |
| Randomized on-line scheduling on two uniform machines | 2001-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721976 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721978 | 2001-07-11 | Paper |
| A lower bound for on-line scheduling on uniformly related machines | 2001-04-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252304 | 2000-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938775 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400843 | 1999-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400847 | 1999-03-23 | Paper |
| On-line machine covering | 1998-11-01 | Paper |
| On-line and off-line approximation algorithms for vector covering problems | 1998-10-01 | Paper |
| On Two Dimensional Packing | 1997-12-18 | Paper |
