Rob van Stee

SIGACT News, December, 2024

SIGACT News Online Algorithms Column 42.

[BibT_eX]

[DOI]

SIGACT News, September, 2024

Improved Online Scheduling with Restarts on a Single Machine.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 22nd International Workshop, 2024

Improved Online Load Balancing with Known Makespan.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2024

2023

SIGACT News Online Algorithms Column 41: 2023 in review.

[BibT_eX]

[DOI]

SIGACT News, December, 2023

SIGACT News Online Algorithms Column 40: 2022 in review.

[BibT_eX]

[DOI]

SIGACT News, March, 2023

A 10/7-Approximation for Discrete Bamboo Garden Trimming and Continuous Trimming on Star Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2023

2022

SIGACT News Online Algorithms Column 39.

[BibT_eX]

[DOI]

SIGACT News, 2022

2021

SIGACT News Online Algorithms Column 37.

[BibT_eX]

[DOI]

SIGACT News, 2021

SIGACT News Online Algorithms Column 38: 2021 in review.

[BibT_eX]

[DOI]

SIGACT News, 2021

Allocating contiguous blocks of indivisible chores fairly.

[BibT_eX]

[DOI]

Inf. Comput., 2021

2020

SIGACT News Online Algorithms Column 36: 2020 in review.

[BibT_eX]

[DOI]

SIGACT News, 2020

Buffer Minimization with Conflicts on a Line.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 14th International Workshop, 2020

2019

SIGACT News Online Algorithms Column 35: 2019 in review.

[BibT_eX]

[DOI]

SIGACT News, 2019

The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

2018

SIGACT News Online Algorithms Column 34: 2018 in review.

[BibT_eX]

[DOI]

SIGACT News, 2018

SIGACT News Online Algorithms Column 33.

[BibT_eX]

[DOI]

SIGACT News, 2018

Multidimensional Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

SIGACT News Online Algorithms Column 32: 2017 in review.

[BibT_eX]

[DOI]

SIGACT News, 2017

SIGACT News Online Algorithms Column 30: 2016 in review.

[BibT_eX]

[DOI]

SIGACT News, 2017

Online bin stretching with three bins.

[BibT_eX]

[DOI]

J. Sched., 2017

Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

A two-phase algorithm for bin stretching with stretching factor 1.5.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

2016

Packet Switching in Single Buffer.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Lower Bounds for Online Bin Packing.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Current Champion for Online Bin Packing.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

SIGACT News Online Algorithms Column 29.

[BibT_eX]

[DOI]

SIGACT News, 2016

SIGACT News Online Algorithms Column 28: Online Matching on the Line, Part 2.

[BibT_eX]

[DOI]

SIGACT News, 2016

SIGACT News Online Algorithms Column 27: Online Matching on the Line, Part 1.

[BibT_eX]

[DOI]

SIGACT News, 2016

Improved Lower Bounds for Online Hypercube Packing.

[BibT_eX]

[DOI]

Sandy Heydrich

CoRR, 2016

The Best Two-Phase Algorithm for Bin Stretching.

[BibT_eX]

[DOI]

CoRR, 2016

Beating the Harmonic Lower Bound for Online Bin Packing.

[BibT_eX]

[DOI]

Sandy Heydrich

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Online algorithms with advice for bin packing and scheduling problems.

[BibT_eX]

[DOI]

Marc P. Renault

Adi Rosén

Theor. Comput. Sci., 2015

SIGACT News Online Algorithms Column 26: Bin packing in multiple dimensions.

[BibT_eX]

[DOI]

SIGACT News, 2015

The optimal absolute ratio for online bin packing.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

SIGACT news online algorithms column 24: 2014 so far.

[BibT_eX]

[DOI]

SIGACT News, 2014

SIGACT news online algorithms column 23.

[BibT_eX]

[DOI]

SIGACT News, 2014

The cost of selfishness for maximizing the minimum load on uniformly related machines.

[BibT_eX]

[DOI]

Elena Kleiman

J. Comb. Optim., 2014

Better Algorithms for Online Bin Stretching.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

2013

Maximizing the minimum load: The cost of selfishness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

SIGACT news online algorithms column 22.

[BibT_eX]

[DOI]

SIGACT News, 2013

Real-time integrated prefetching and caching.

[BibT_eX]

[DOI]

Peter Sanders

Johannes Singler

J. Sched., 2013

Two for One: Tight Approximation of 2D Bin Packing.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

Reordering Buffer Management with Advice.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

A unified approach to truthful scheduling on related machines.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Dividing Connected Chores Fairly.

[BibT_eX]

[DOI]

Sandy Heydrich

Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

Online Job Admission.

[BibT_eX]

[DOI]

Sven O. Krumke

Stephan Westphal

Proceedings of the Fundamental Problems in Computing, 2013

2012

A note on sorting buffers offline.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

SIGACT news online algorithms column 21: APPROX and ALGO.

[BibT_eX]

[DOI]

SIGACT News, 2012

SIGACT news online algorithms column 20: the power of harmony.

[BibT_eX]

[DOI]

SIGACT News, 2012

Absolute approximation ratios for packing rectangles into bins.

[BibT_eX]

[DOI]

J. Sched., 2012

Approximation Schemes for Packing Splittable Items with Cardinality Constraints.

[BibT_eX]

[DOI]

Algorithmica, 2012

The Price of Anarchy for Selfish Ring Routing Is Two.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

A (5/3 + eps)-Approximation for 2D Strip Packing.

[BibT_eX]

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

Online Scheduling of Jobs with Fixed Start Times on Related Machines.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011

A (5/3 + ε)-Approximation for Strip Packing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

2010

The Sorting Buffer Problem is NP-hard

[BibT_eX]

[DOI]

CoRR, 2010

A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines.

[BibT_eX]

[DOI]

George Christodoulou

Annamária Kovács

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

An Improved Algorithm for Online Rectangle Filling.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

Max-min Online Allocations with a Reordering Buffer.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing

[BibT_eX]

[DOI]

CoRR, 2009

Maximizing the Minimum Load: The Cost of Selfishness.

[BibT_eX]

[DOI]

Elena Kleiman

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

On the Price of Stability for Undirected Network Design.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2009

2008

Paging.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Packet Switching in Single Buffer.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Combinatorial algorithms for packing and scheduling problems

[BibT_eX]

[DOI]

PhD thesis, 2008

Online unit clustering: Variations on a theme.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

A monotone approximation algorithm for scheduling with precedence constraints.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

Two-dimensional packing with conflicts.

[BibT_eX]

[DOI]

Acta Informatica, 2008

Packing Rectangles into 2OPT Bins Using Rotations.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2008

The Price of Anarchy on Uniformly Related Machines Revisited.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

Maximizing the Minimum Load for Selfish Agents.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

Multidimensional Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Paging with connections: FIFO strikes again.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Bounds for online bounded space hypercube packing.

[BibT_eX]

[DOI]

Discret. Optim., 2007

Calculating lower bounds for caching problems.

[BibT_eX]

[DOI]

Computing, 2007

A Study of Integrated Document and Connection Caching in the WWW.

[BibT_eX]

[DOI]

Susanne Albers

Algorithmica, 2007

Approximation Schemes for Packing Splittable Items with Cardinality Constraints.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

On the Online Unit Clustering Problem.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Improved Results for a Memory Allocation Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Multi-dimensional Packing with Conflicts.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Maximizing the Minimum Load for Selfisch Agents.

[BibT_eX]

[DOI]

Proceedings of the Fair Division, 24.06. - 29.06.2007, 2007

Preemptive Scheduling on Selfish Machines.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

2006

Competitive Algorithms for Cottage Rental.

[BibT_eX]

[DOI]

Stephan Westphal

Sven Oliver Krumke

Electron. Notes Discret. Math., 2006

Optimal on-line flow time with resource augmentation.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Covering selfish machines

[BibT_eX]

[DOI]

CoRR, 2006

Paging with Request Sets.

[BibT_eX]

[DOI]

Tami Tamir

Proceedings of the Algorithm Theory, 2006

2005

Optimal Online Algorithms for Multidimensional Packing Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Online square and cube packing.

[BibT_eX]

[DOI]

Acta Informatica, 2005

Speed Scaling of Tasks with Precedence Constraints.

[BibT_eX]

[DOI]

Kirk Pruhs

Patchrawat Uthaisombut

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

On strip packing With rotations.

[BibT_eX]

[DOI]

Klaus Jansen

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Online scheduling of splittable tasks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

2004

Combining request scheduling with web caching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

An approximation algorithm for square packing.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

This Side Up!

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Online Bin Packing with Resource Augmentation.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Online Scheduling of Splittable Tasks in Peer-to-Peer Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2004

Optimal online bounded space multidimensional packing.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

On Variable-Sized Multidimensional Packing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2004

2003

New Bounds for Variable-Sized Online Bin Packing.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.

[BibT_eX]

[DOI]

J. Sched., 2003

New Bounds for Multidimensional Packing.

[BibT_eX]

[DOI]

Algorithmica, 2003

A Study of Integrated Document and Connection Caching.

[BibT_eX]

[DOI]

Susanne Albers

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Improved Competitive Guarantees for QoS Buffering.

[BibT_eX]

[DOI]

Alexander Kesselman

Yishay Mansour

Proceedings of the Algorithms, 2003

2002

New bounds for multi-dimensional packing.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

More on Weighted Servers or FIFO is Better than LRU.

[BibT_eX]

[DOI]

Csanád Imreh

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

New Bounds for Variable-Sized and Resource Augmented Online Bin Packing.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Preemptive Scheduling in Overloaded Systems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts.

[BibT_eX]

[DOI]

Johannes A. La Poutré

Proceedings of the Algorithms, 2002

Minimizing the Maximum Starting Time On-line.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

2001

Running a job on a collection of partly available machines, with on-line restarts.

[BibT_eX]

[DOI]

Johannes A. La Poutré

Acta Informatica, 2001

Lower Bounds for On-Line Single-Machine Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Optimal Online Flow Time with Resource Augmentation.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000

Resource Augmentation in Load Balancing.

[BibT_eX]

[DOI]

Yossi Azar

Proceedings of the Algorithm Theory, 2000

Partial servicing of on-line jobs.

[BibT_eX]

[DOI]