| 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
Information and Computation | 2021-11-25 | Paper |
Buffer minimization with conflicts on a line
Frontiers in Algorithmics | 2021-07-08 | Paper |
Buffer minimization with conflicts on a line
Theoretical Computer Science | 2021-06-23 | Paper |
A unified approach to truthful scheduling on related machines
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
The optimal absolute ratio for online bin packing
Journal of Computer and System Sciences | 2019-05-03 | Paper |
Reordering buffer management with advice
Journal of Scheduling | 2018-04-04 | Paper |
Online bin stretching with three bins
Journal of Scheduling | 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
Journal of Combinatorial Optimization | 2017-11-16 | Paper |
The optimal absolute ratio for online bin packing
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
A unified approach to truthful scheduling on related machines
Mathematics of Operations Research | 2016-04-15 | Paper |
Online scheduling of jobs with fixed start times on related machines
Algorithmica | 2016-03-23 | Paper |
Better Algorithms for Online Bin Stretching
Approximation and Online Algorithms | 2015-11-20 | Paper |
Dividing connected chores fairly
Theoretical Computer Science | 2015-10-08 | Paper |
Online algorithms with advice for bin packing and scheduling problems
Theoretical Computer Science | 2015-09-16 | Paper |
Online scheduling of splittable tasks
ACM Transactions on Algorithms | 2015-09-02 | Paper |
This side up!
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Optimal online bounded space multidimensional packing
| 2015-08-03 | Paper |
On the online unit clustering problem
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Reordering buffer management with advice
Approximation and Online Algorithms | 2014-09-02 | Paper |
Real-time integrated prefetching and caching
Journal of Scheduling | 2014-08-18 | Paper |
Two for one: tight approximation of 2D bin packing
International Journal of Foundations of Computer Science | 2014-07-04 | Paper |
The cost of selfishness for maximizing the minimum load on uniformly related machines
Journal of Combinatorial Optimization | 2014-06-24 | Paper |
Absolute approximation ratios for packing rectangles into bins
Journal of Scheduling | 2014-02-05 | Paper |
A \((5/3+\varepsilon)\)-approximation for strip packing
Computational Geometry | 2014-01-22 | Paper |
Maximizing the minimum load: the cost of selfishness
Theoretical Computer Science | 2014-01-09 | Paper |
A truthful constant approximation for maximizing the minimum load on related machines
Theoretical Computer Science | 2013-12-19 | Paper |
Dividing connected chores fairly
Algorithmic Game Theory | 2013-10-23 | Paper |
Online scheduling of jobs with fixed start times on related machines
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
The price of anarchy on uniformly related machines revisited
Information and Computation | 2012-05-24 | Paper |
A note on sorting buffers offline
Theoretical Computer Science | 2012-05-14 | Paper |
An improved algorithm for online rectangle filling
Theoretical Computer Science | 2012-05-14 | Paper |
Approximation schemes for packing splittable items with cardinality constraints
Algorithmica | 2012-04-26 | Paper |
Max-min online allocations with a reordering buffer
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
A \((5/3 + \varepsilon )\)-approximation for strip packing
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Improved results for a memory allocation problem
Theory of Computing Systems | 2011-04-01 | Paper |
An Improved Algorithm for Online Rectangle Filling
Approximation and Online Algorithms | 2011-02-15 | Paper |
Max-min online allocations with a reordering buffer
Automata, Languages and Programming | 2010-09-07 | Paper |
On strip packing with rotations
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
On the price of stability for undirected network design
Approximation and Online Algorithms | 2010-05-11 | Paper |
Improved competitive guarantees for QoS buffering
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Maximizing the minimum load for selfish agents
Theoretical Computer Science | 2009-12-01 | Paper |
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Paging with request sets
Theory of Computing Systems | 2009-08-06 | Paper |
Online Job Admission
Fundamental Problems in Computing | 2009-08-05 | Paper |
Improved Results for a Memory Allocation Problem
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Online unit clustering: Variations on a theme
Theoretical Computer Science | 2008-11-18 | Paper |
A monotone approximation algorithm for scheduling with precedence constraints
Operations Research Letters | 2008-08-06 | Paper |
Packing Rectangles into 2OPT Bins Using Rotations
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Two-dimensional packing with conflicts
Acta Informatica | 2008-06-17 | Paper |
Speed scaling of tasks with precedence constraints
Theory of Computing Systems | 2008-06-06 | Paper |
Online bin packing with resource augmentation
Discrete Optimization | 2008-05-14 | Paper |
The Price of Anarchy on Uniformly Related Machines Revisited
Algorithmic Game Theory | 2008-05-02 | Paper |
Preemptive Scheduling on Selfish Machines
Combinatorial and Algorithmic Aspects of Networking | 2008-04-15 | Paper |
Maximizing the Minimum Load for Selfish Agents
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Multi-dimensional Packing with Conflicts
Fundamentals of Computation Theory | 2008-02-26 | Paper |
On the Online Unit Clustering Problem
Approximation and Online Algorithms | 2008-02-20 | Paper |
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
Approximation and Online Algorithms | 2008-02-20 | Paper |
Bounds for online bounded space hypercube packing
Discrete Optimization | 2008-01-18 | Paper |
Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
Journal of Scheduling | 2007-12-20 | Paper |
Calculating lower bounds for caching problems
Computing | 2007-11-19 | Paper |
Paging with Request Sets
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Paging with connections: FIFO strikes again
Theoretical Computer Science | 2007-06-06 | Paper |
Competitive Algorithms for Cottage Rental
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
A study of integrated document and connection caching in the WWW
Algorithmica | 2007-04-26 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Optimal Online Algorithms for Multidimensional Packing Problems
SIAM Journal on Computing | 2006-06-01 | Paper |
Optimal on-line flow time with resource augmentation
Discrete Applied Mathematics | 2006-04-28 | Paper |
Improved competitive guarantees for QoS buffering
Algorithmica | 2006-03-21 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Minimizing the total completion time on-line on a single machine, using restarts
Journal of Algorithms | 2005-12-08 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Minimizing the maximum starting time on-line
Information and Computation | 2005-02-22 | Paper |
An approximation algorithm for square packing.
Operations Research Letters | 2005-01-11 | Paper |
scientific article; zbMATH DE number 2119702 (Why is no real title available?)
| 2004-11-29 | Paper |
Combining request scheduling with web caching
Theoretical Computer Science | 2004-11-23 | Paper |
scientific article; zbMATH DE number 2086672 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2086631 (Why is no real title available?)
| 2004-08-11 | Paper |
More on weighted servers or FIFO is better than LRU.
Theoretical Computer Science | 2004-03-14 | Paper |
scientific article; zbMATH DE number 2038745 (Why is no real title available?)
| 2004-02-08 | Paper |
Preemptive scheduling in overloaded systems.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
New bounds for multidimensional packing
Algorithmica | 2003-08-17 | Paper |
Resource augmentation in load balancing.
Journal of Scheduling | 2003-07-27 | Paper |
scientific article; zbMATH DE number 1947413 (Why is no real title available?)
| 2003-07-08 | Paper |
scientific article; zbMATH DE number 1947447 (Why is no real title available?)
| 2003-07-08 | Paper |
New Bounds for Variable-Sized Online Bin Packing
SIAM Journal on Computing | 2003-06-19 | Paper |
scientific article; zbMATH DE number 1929943 (Why is no real title available?)
| 2003-06-18 | Paper |
Lower bounds for on-line single-machine scheduling.
Theoretical Computer Science | 2003-05-25 | Paper |
scientific article; zbMATH DE number 1839473 (Why is no real title available?)
| 2002-12-02 | Paper |
scientific article; zbMATH DE number 1834660 (Why is no real title available?)
| 2002-11-25 | Paper |
Partial servicing of on-line jobs
Journal of Scheduling | 2002-06-19 | Paper |
scientific article; zbMATH DE number 1670547 (Why is no real title available?)
| 2001-11-11 | Paper |
Running a job on a collection of partly available machines, with on-line restarts
Acta Informatica | 2001-08-26 | Paper |
scientific article; zbMATH DE number 1617258 (Why is no real title available?)
| 2001-07-11 | Paper |
