Rob van Stee

According to our database1, Rob van Stee authored at least 127 papers between 2000 and 2018.

Collaborative distances :

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
SIGACT News Online Algorithms Column 33.
SIGACT News, 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. Scheduling, 2017

Reordering buffer management with advice.
J. Scheduling, 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

Beating the Harmonic lower bound for online bin packing.
CoRR, 2015

The optimal absolute ratio for online bin packing.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 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

Better Algorithms for Online Bin Stretching.
CoRR, 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. Scheduling, 2013

Two for One: Tight Approximation of 2D Bin Packing.
Int. J. Found. Comput. Sci., 2013

Online Algorithms with Advice for Bin Packing and Scheduling Problems.
CoRR, 2013

Reordering Buffer Management with Advice.
Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

A unified approach to truthful scheduling on related machines.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Dividing Connected Chores Fairly.
Proceedings of the Algorithmic Game Theory - 6th International Symposium, 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. Scheduling, 2012

The price of anarchy on uniformly related machines revisited.
Inf. Comput., 2012

The Price of Anarchy for Selfish Ring Routing is Two
CoRR, 2012

A unified approach to truthful scheduling on related machines
CoRR, 2012

Approximation Schemes for Packing Splittable Items with Cardinality Constraints.
Algorithmica, 2012

The Price of Anarchy for Selfish Ring Routing Is Two.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

A (5/3 + eps)-Approximation for 2D Strip Packing.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

Online Scheduling of Jobs with Fixed Start Times on Related Machines.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011
Max-min Online Allocations with a Reordering Buffer.
SIAM J. Discrete Math., 2011

Improved Results for a Memory Allocation Problem.
Theory Comput. Syst., 2011

A (5/3 + ε)-Approximation for Strip Packing.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 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

A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

An Improved Algorithm for Online Rectangle Filling.
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

Max-min Online Allocations with a Reordering Buffer.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 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
Paging.
Proceedings of the Encyclopedia of Algorithms, 2008

Packet Switching in Single Buffer.
Proceedings of the Encyclopedia of Algorithms, 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 Inf., 2008

Packing Rectangles into 2OPT Bins Using Rotations.
Proceedings of the Algorithm Theory, 2008

The Price of Anarchy on Uniformly Related Machines Revisited.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

Maximizing the Minimum Load for Selfish Agents.
Proceedings of the LATIN 2008: Theoretical Informatics, 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.
Discrete Optimization, 2007

Bounds for online bounded space hypercube packing.
Discrete Optimization, 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

On the Online Unit Clustering Problem.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Improved Results for a Memory Allocation Problem.
Proceedings of the Algorithms and Data Structures, 10th 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
This side up!
ACM Trans. Algorithms, 2006

Online scheduling of splittable tasks.
ACM Trans. Algorithms, 2006

Competitive Algorithms for Cottage Rental.
Electronic Notes in Discrete Mathematics, 2006

Optimal on-line flow time with resource augmentation.
Discrete Applied Mathematics, 2006

Improved results for a memory allocation problem
CoRR, 2006

Covering selfish machines
CoRR, 2006

Paging with Request Sets.
Proceedings of the Algorithm Theory, 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 Inf., 2005

Speed Scaling of Tasks with Precedence Constraints.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

On strip packing With rotations.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Online scheduling of splittable tasks.
Proceedings of the Algorithms for Optimization with Incomplete Information, 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

This Side Up!
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Online Bin Packing with Resource Augmentation.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 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. Scheduling, 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

Improved Competitive Guarantees for QoS Buffering.
Proceedings of the Algorithms, 2003

2002
New bounds for multi-dimensional packing.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

More on Weighted Servers or FIFO is Better than LRU.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

New Bounds for Variable-Sized and Resource Augmented Online Bin Packing.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Preemptive Scheduling in Overloaded Systems.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

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

Minimizing the Maximum Starting Time On-line.
Proceedings of the Algorithms, 2002

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

Lower Bounds for On-Line Single-Machine Scheduling.
Proceedings of the Mathematical Foundations of Computer Science 2001, 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


  Loading...