2023
SIGACT News Online Algorithms Column 41: 2023 in review.
SIGACT News, December, 2023
SIGACT News Online Algorithms Column 40: 2022 in review.
SIGACT News, March, 2023
A 10/7-Approximation for Discrete Bamboo Garden Trimming and Continuous Trimming on Star Graphs.
Proceedings of the Approximation, 2023
2022
SIGACT News Online Algorithms Column 39.
SIGACT News, 2022
2021
Buffer minimization with conflicts on a line.
Theor. Comput. Sci., 2021
SIGACT News Online Algorithms Column 37.
SIGACT News, 2021
SIGACT News Online Algorithms Column 38: 2021 in review.
SIGACT News, 2021
Allocating contiguous blocks of indivisible chores fairly.
Inf. Comput., 2021
2020
SIGACT News Online Algorithms Column 36: 2020 in review.
SIGACT News, 2020
2019
SIGACT News Online Algorithms Column 35: 2019 in review.
SIGACT News, 2019
The optimal absolute ratio for online bin packing.
J. Comput. Syst. Sci., 2019
The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019
2018
SIGACT News Online Algorithms Column 34: 2018 in review.
SIGACT News, 2018
SIGACT News Online Algorithms Column 33.
SIGACT News, 2018
Multidimensional Packing Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2017
SIGACT News Online Algorithms Column 32: 2017 in review.
SIGACT News, 2017
SIGACT News Online Algorithms Column 30: 2016 in review.
SIGACT News, 2017
Online bin stretching with three bins.
J. Sched., 2017
Reordering buffer management with advice.
J. Sched., 2017
Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5.
J. Comb. Optim., 2017
A two-phase algorithm for bin stretching with stretching factor 1.5.
J. Comb. Optim., 2017
2016
Packet Switching in Single Buffer.
Encyclopedia of Algorithms, 2016
Lower Bounds for Online Bin Packing.
Encyclopedia of Algorithms, 2016
Current Champion for Online Bin Packing.
Encyclopedia of Algorithms, 2016
SIGACT News Online Algorithms Column 29.
SIGACT News, 2016
SIGACT News Online Algorithms Column 28: Online Matching on the Line, Part 2.
SIGACT News, 2016
SIGACT News Online Algorithms Column 27: Online Matching on the Line, Part 1.
SIGACT News, 2016
A Unified Approach to Truthful Scheduling on Related Machines.
Math. Oper. Res., 2016
Improved Lower Bounds for Online Hypercube Packing.
CoRR, 2016
The Best Two-Phase Algorithm for Bin Stretching.
CoRR, 2016
Online Scheduling of Jobs with Fixed Start Times on Related Machines.
Algorithmica, 2016
Beating the Harmonic Lower Bound for Online Bin Packing.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
2015
Online algorithms with advice for bin packing and scheduling problems.
Theor. Comput. Sci., 2015
Dividing connected chores fairly.
Theor. Comput. Sci., 2015
SIGACT News Online Algorithms Column 26: Bin packing in multiple dimensions.
SIGACT News, 2015
2014
The Price of Anarchy for Selfish Ring Routing is Two.
ACM Trans. Economics and Comput., 2014
SIGACT news online algorithms column 24: 2014 so far.
SIGACT News, 2014
SIGACT news online algorithms column 23.
SIGACT News, 2014
The cost of selfishness for maximizing the minimum load on uniformly related machines.
J. Comb. Optim., 2014
A (5/3 + ε)-approximation for strip packing.
Comput. Geom., 2014
Better Algorithms for Online Bin Stretching.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014
2013
Maximizing the minimum load: The cost of selfishness.
Theor. Comput. Sci., 2013
A truthful constant approximation for maximizing the minimum load on related machines.
Theor. Comput. Sci., 2013
SIGACT news online algorithms column 22.
SIGACT News, 2013
Real-time integrated prefetching and caching.
J. Sched., 2013
Two for One: Tight Approximation of 2D Bin Packing.
Int. J. Found. Comput. Sci., 2013
Proceedings of the Fundamental Problems in Computing, 2013
2012
An improved algorithm for online rectangle filling.
Theor. Comput. Sci., 2012
A note on sorting buffers offline.
Theor. Comput. Sci., 2012
SIGACT news online algorithms column 21: APPROX and ALGO.
SIGACT News, 2012
SIGACT news online algorithms column 20: the power of harmony.
SIGACT News, 2012
Absolute approximation ratios for packing rectangles into bins.
J. Sched., 2012
The price of anarchy on uniformly related machines revisited.
Inf. Comput., 2012
Approximation Schemes for Packing Splittable Items with Cardinality Constraints.
Algorithmica, 2012
A (5/3 + eps)-Approximation for 2D Strip Packing.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012
2011
Max-min Online Allocations with a Reordering Buffer.
SIAM J. Discret. Math., 2011
Improved Results for a Memory Allocation Problem.
Theory Comput. Syst., 2011
2010
Maximizing the minimum load for selfish agents.
Theor. Comput. Sci., 2010
On the online unit clustering problem.
ACM Trans. Algorithms, 2010
The Sorting Buffer Problem is NP-hard
CoRR, 2010
2009
Paging with Request Sets.
Theory Comput. Syst., 2009
An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing
CoRR, 2009
Maximizing the Minimum Load: The Cost of Selfishness.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009
On the Price of Stability for Undirected Network Design.
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems.
Proceedings of the Approximation, 2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Packet Switching in Single Buffer.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Combinatorial algorithms for packing and scheduling problems
PhD thesis, 2008
Online unit clustering: Variations on a theme.
Theor. Comput. Sci., 2008
A monotone approximation algorithm for scheduling with precedence constraints.
Oper. Res. Lett., 2008
Speed Scaling of Tasks with Precedence Constraints.
Theory Comput. Syst., 2008
Two-dimensional packing with conflicts.
Acta Informatica, 2008
Packing Rectangles into 2OPT Bins Using Rotations.
Proceedings of the Algorithm Theory, 2008
2007
Multidimensional Packing Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Paging with connections: FIFO strikes again.
Theor. Comput. Sci., 2007
Online bin packing with resource augmentation.
Discret. Optim., 2007
Bounds for online bounded space hypercube packing.
Discret. Optim., 2007
Calculating lower bounds for caching problems.
Computing, 2007
A Study of Integrated Document and Connection Caching in the WWW.
Algorithmica, 2007
Approximation Schemes for Packing Splittable Items with Cardinality Constraints.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007
Multi-dimensional Packing with Conflicts.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007
Maximizing the Minimum Load for Selfisch Agents.
Proceedings of the Fair Division, 24.06. - 29.06.2007, 2007
Preemptive Scheduling on Selfish Machines.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007
2006
ACM Trans. Algorithms, 2006
Online scheduling of splittable tasks.
ACM Trans. Algorithms, 2006
Competitive Algorithms for Cottage Rental.
Electron. Notes Discret. Math., 2006
Optimal on-line flow time with resource augmentation.
Discret. Appl. Math., 2006
Covering selfish machines
CoRR, 2006
2005
Optimal Online Algorithms for Multidimensional Packing Problems.
SIAM J. Comput., 2005
Minimizing the total completion time on-line on a single machine, using restarts.
J. Algorithms, 2005
Improved Competitive Guarantees for QoS Buffering.
Algorithmica, 2005
Online square and cube packing.
Acta Informatica, 2005
On strip packing With rotations.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005
2004
Combining request scheduling with web caching.
Theor. Comput. Sci., 2004
An approximation algorithm for square packing.
Oper. Res. Lett., 2004
Minimizing the maximum starting time on-line.
Inf. Comput., 2004
Online Scheduling of Splittable Tasks in Peer-to-Peer Networks.
Proceedings of the Algorithm Theory, 2004
Optimal online bounded space multidimensional packing.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
On Variable-Sized Multidimensional Packing.
Proceedings of the Algorithms, 2004
2003
Lower bounds for on-line single-machine scheduling.
Theor. Comput. Sci., 2003
More on weighted servers or FIFO is better than LRU.
Theor. Comput. Sci., 2003
New Bounds for Variable-Sized Online Bin Packing.
SIAM J. Comput., 2003
Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.
J. Sched., 2003
Preemptive scheduling in overloaded systems.
J. Comput. Syst. Sci., 2003
New Bounds for Multidimensional Packing.
Algorithmica, 2003
A Study of Integrated Document and Connection Caching.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
2002
New bounds for multi-dimensional packing.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
New Bounds for Variable-Sized and Resource Augmented Online Bin Packing.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002
2001
Running a job on a collection of partly available machines, with on-line restarts.
Acta Informatica, 2001
Optimal Online Flow Time with Resource Augmentation.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001
2000
Resource Augmentation in Load Balancing.
Proceedings of the Algorithm Theory, 2000
Partial servicing of on-line jobs.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000
