Partial servicing of on-line jobs. - Rob van Stee; Johannes A. La Poutré (APPROX, 2000)

Resource Augmentation in Load Balancing. - Yossi Azar; Leah Epstein; Rob van Stee (SWAT, 2000)

Optimal Online Flow Time with Resource Augmentation. - Leah Epstein; Rob van Stee (FCT, 2001)

Running a job on a collection of partly available machines, with on-line restarts. - Rob van Stee; Johannes A. La Poutré (Acta Informatica, 2001)

New Bounds for Variable-Sized and Resource Augmented Online Bin Packing. - Leah Epstein; Steven S. Seiden; Rob van Stee (ICALP, 2002)

New bounds for multi-dimensional packing. - Steven S. Seiden; Rob van Stee (SODA, 2002)

A Study of Integrated Document and Connection Caching. - Susanne Albers; Rob van Stee (ICALP, 2003)

New Bounds for Multidimensional Packing. - Steven S. Seiden; Rob van Stee (Algorithmica, 2003)

Preemptive scheduling in overloaded systems. - Marek Chrobak; Leah Epstein; John Noga; Jirí Sgall; Rob van Stee; Tomás Tichý; Nodari Vakhania (J. Comput. Syst. Sci., 2003)

Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem. - Eric Bach 001; Joan Boyar; Leah Epstein; Lene M. Favrholdt; Tao Jiang 001; Kim S. Larsen; Guo-Hui Lin; Rob van Stee (J. Sched., 2003)

New Bounds for Variable-Sized Online Bin Packing. - Steven S. Seiden; Rob van Stee; Leah Epstein (SIAM J. Comput., 2003)

More on weighted servers or FIFO is better than LRU. - Leah Epstein; Csanád Imreh; Rob van Stee (Theor. Comput. Sci., 2003)

Lower bounds for on-line single-machine scheduling. - Leah Epstein; Rob van Stee (Theor. Comput. Sci., 2003)

On Variable-Sized Multidimensional Packing. - Leah Epstein; Rob van Stee (ESA, 2004)

Optimal online bounded space multidimensional packing. - Leah Epstein; Rob van Stee (SODA, 2004)

Online Scheduling of Splittable Tasks in Peer-to-Peer Networks. - Leah Epstein; Rob van Stee (SWAT, 2004)

Minimizing the maximum starting time on-line. - Leah Epstein; Rob van Stee (Inf. Comput., 2004)

An approximation algorithm for square packing. - Rob van Stee (Oper. Res. Lett., 2004)

Combining request scheduling with web caching. - Tomás Feder; Rajeev Motwani 001; Rina Panigrahy; Steven S. Seiden; Rob van Stee; An Zhu (Theor. Comput. Sci., 2004)

On strip packing With rotations. - Klaus Jansen; Rob van Stee (STOC, 2005)

Online square and cube packing. - Leah Epstein; Rob van Stee (Acta Informatica, 2005)

Improved Competitive Guarantees for QoS Buffering. - Alexander Kesselman; Yishay Mansour; Rob van Stee (Algorithmica, 2005)

Minimizing the total completion time on-line on a single machine, using restarts. - Rob van Stee; Johannes A. La Poutré (J. Algorithms, 2005)

Optimal Online Algorithms for Multidimensional Packing Problems. - Leah Epstein; Rob van Stee (SIAM J. Comput., 2005)

Covering selfish machines - Leah Epstein; Rob van Stee (CoRR, 2006)

Optimal on-line flow time with resource augmentation. - Leah Epstein; Rob van Stee (Discret. Appl. Math., 2006)

Competitive Algorithms for Cottage Rental. - Stephan Westphal; Sven Oliver Krumke; Rob van Stee (Electron. Notes Discret. Math., 2006)

Online scheduling of splittable tasks. - Leah Epstein; Rob van Stee (ACM Trans. Algorithms, 2006)

This side up! - Leah Epstein; Rob van Stee (ACM Trans. Algorithms, 2006)

Preemptive Scheduling on Selfish Machines. - Leah Epstein; Rob van Stee (CAAN, 2007)

Maximizing the Minimum Load for Selfisch Agents. - Leah Epstein; Rob van Stee (Fair Division, 2007)

Multi-dimensional Packing with Conflicts. - Leah Epstein; Asaf Levin; Rob van Stee (FCT, 2007)

Approximation Schemes for Packing Splittable Items with Cardinality Constraints. - Leah Epstein; Rob van Stee (WAOA, 2007)

A Study of Integrated Document and Connection Caching in the WWW. - Susanne Albers; Rob van Stee (Algorithmica, 2007)

Calculating lower bounds for caching problems. - Leah Epstein; Rob van Stee (Computing, 2007)

Bounds for online bounded space hypercube packing. - Leah Epstein; Rob van Stee (Discret. Optim., 2007)

Online bin packing with resource augmentation. - Leah Epstein; Rob van Stee (Discret. Optim., 2007)

Paging with connections: FIFO strikes again. - Leah Epstein; Yanir Kleiman; Jirí Sgall; Rob van Stee (Theor. Comput. Sci., 2007)

Multidimensional Packing Problems. - Leah Epstein; Rob van Stee (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Packing Rectangles into 2OPT Bins Using Rotations. - Rolf Harren; Rob van Stee (SWAT, 2008)

Two-dimensional packing with conflicts. - Leah Epstein; Asaf Levin; Rob van Stee (Acta Informatica, 2008)

Speed Scaling of Tasks with Precedence Constraints. - Kirk Pruhs; Rob van Stee; Patchrawat Uthaisombut (Theory Comput. Syst., 2008)

A monotone approximation algorithm for scheduling with precedence constraints. - Sven Oliver Krumke; Anne Schwahn; Rob van Stee; Stephan Westphal (Oper. Res. Lett., 2008)

Online unit clustering: Variations on a theme. - Leah Epstein; Asaf Levin; Rob van Stee (Theor. Comput. Sci., 2008)

Combinatorial algorithms for packing and scheduling problems - Rob van Stee (2008)

Packet Switching in Single Buffer. - Rob van Stee (Encyclopedia of Algorithms, 2008)

Paging. - Rob van Stee (Encyclopedia of Algorithms, 2008)

Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems. - Rolf Harren; Rob van Stee (APPROX-RANDOM, 2009)

On the Price of Stability for Undirected Network Design. - George Christodoulou 001; Christine Chung 001; Katrina Ligett; Evangelia Pyrga; Rob van Stee (WAOA, 2009)

Maximizing the Minimum Load: The Cost of Selfishness. - Leah Epstein; Elena Kleiman; Rob van Stee (WINE, 2009)

An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing - Rolf Harren; Rob van Stee (CoRR, 2009)

Paging with Request Sets. - Leah Epstein; Rob van Stee; Tami Tamir (Theory Comput. Syst., 2009)

The Sorting Buffer Problem is NP-hard - Ho-Leung Chan; Nicole Megow; Rob van Stee; René Sitters (CoRR, 2010)

On the online unit clustering problem. - Leah Epstein; Rob van Stee (ACM Trans. Algorithms, 2010)

Maximizing the minimum load for selfish agents. - Leah Epstein; Rob van Stee (Theor. Comput. Sci., 2010)

Improved Results for a Memory Allocation Problem. - Leah Epstein; Rob van Stee (Theory Comput. Syst., 2011)

Max-min Online Allocations with a Reordering Buffer. - Leah Epstein; Asaf Levin; Rob van Stee (SIAM J. Discret. Math., 2011)

A (5/3 + eps)-Approximation for 2D Strip Packing. - Rolf Harren; Klaus Jansen; Lars Prädel; Rob van Stee (CTW, 2012)

Approximation Schemes for Packing Splittable Items with Cardinality Constraints. - Leah Epstein; Asaf Levin; Rob van Stee (Algorithmica, 2012)

The price of anarchy on uniformly related machines revisited. - Leah Epstein; Rob van Stee (Inf. Comput., 2012)

Absolute approximation ratios for packing rectangles into bins. - Rolf Harren; Rob van Stee (J. Sched., 2012)

SIGACT news online algorithms column 20: the power of harmony. - Rob van Stee (SIGACT News, 2012)

SIGACT news online algorithms column 21: APPROX and ALGO. - Rob van Stee (SIGACT News, 2012)

A note on sorting buffers offline. - Ho-Leung Chan; Nicole Megow; René Sitters; Rob van Stee (Theor. Comput. Sci., 2012)

An improved algorithm for online rectangle filling. - Rob van Stee (Theor. Comput. Sci., 2012)

Online Job Admission. - Sven O. Krumke; Rob van Stee; Stephan Westphal (Fundamental Problems in Computing, 2013)

Two for One: Tight Approximation of 2D Bin Packing. - Rolf Harren; Klaus Jansen; Lars Prädel; Ulrich M. Schwarz; Rob van Stee (Int. J. Found. Comput. Sci., 2013)

Real-time integrated prefetching and caching. - Peter Sanders 001; Johannes Singler; Rob van Stee (J. Sched., 2013)

SIGACT news online algorithms column 22. - Rob van Stee (SIGACT News, 2013)

A truthful constant approximation for maximizing the minimum load on related machines. - George Christodoulou 001; Annamária Kovács; Rob van Stee (Theor. Comput. Sci., 2013)

Maximizing the minimum load: The cost of selfishness. - Xujin Chen; Leah Epstein; Elena Kleiman; Rob van Stee (Theor. Comput. Sci., 2013)

Better Algorithms for Online Bin Stretching. - Martin Böhm 001; Jirí Sgall; Rob van Stee; Pavel Veselý 001 (WAOA, 2014)

A (5/3 + ε)-approximation for strip packing. - Rolf Harren; Klaus Jansen; Lars Prädel; Rob van Stee (Comput. Geom., 2014)

The cost of selfishness for maximizing the minimum load on uniformly related machines. - Leah Epstein; Elena Kleiman; Rob van Stee (J. Comb. Optim., 2014)

SIGACT news online algorithms column 23. - Rob van Stee (SIGACT News, 2014)

SIGACT news online algorithms column 24: 2014 so far. - Rob van Stee (SIGACT News, 2014)

The Price of Anarchy for Selfish Ring Routing is Two. - Xujin Chen; Benjamin Doerr; Carola Doerr; Xiaodong Hu 001; Weidong Ma; Rob van Stee (ACM Trans. Economics and Comput., 2014)

SIGACT News Online Algorithms Column 26: Bin packing in multiple dimensions. - Rob van Stee (SIGACT News, 2015)

Dividing connected chores fairly. - Sandy Heydrich; Rob van Stee (Theor. Comput. Sci., 2015)

Online algorithms with advice for bin packing and scheduling problems. - Marc P. Renault; Adi Rosén; Rob van Stee (Theor. Comput. Sci., 2015)

Beating the Harmonic Lower Bound for Online Bin Packing. - Sandy Heydrich; Rob van Stee (ICALP, 2016)

Online Scheduling of Jobs with Fixed Start Times on Related Machines. - Leah Epstein; Lukasz Jez; Jirí Sgall; Rob van Stee (Algorithmica, 2016)

The Best Two-Phase Algorithm for Bin Stretching. - Martin Böhm 001; Jirí Sgall; Rob van Stee; Pavel Veselý 001 (CoRR, 2016)

Improved Lower Bounds for Online Hypercube Packing. - Sandy Heydrich; Rob van Stee (CoRR, 2016)

A Unified Approach to Truthful Scheduling on Related Machines. - Leah Epstein; Asaf Levin; Rob van Stee (Math. Oper. Res., 2016)

SIGACT News Online Algorithms Column 27: Online Matching on the Line, Part 1. - Rob van Stee (SIGACT News, 2016)

SIGACT News Online Algorithms Column 28: Online Matching on the Line, Part 2. - Rob van Stee (SIGACT News, 2016)

SIGACT News Online Algorithms Column 29. - Rob van Stee (SIGACT News, 2016)

Current Champion for Online Bin Packing. - Rob van Stee (Encyclopedia of Algorithms, 2016)

Lower Bounds for Online Bin Packing. - Rob van Stee (Encyclopedia of Algorithms, 2016)

Packet Switching in Single Buffer. - Rob van Stee (Encyclopedia of Algorithms, 2016)

A two-phase algorithm for bin stretching with stretching factor 1.5. - Martin Böhm 001; Jirí Sgall; Rob van Stee; Pavel Veselý 001 (J. Comb. Optim., 2017)

Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5. - Martin Böhm 001; Jirí Sgall; Rob van Stee; Pavel Veselý 001 (J. Comb. Optim., 2017)

Reordering buffer management with advice. - Anna Adamaszek; Marc P. Renault; Adi Rosén; Rob van Stee (J. Sched., 2017)

Online bin stretching with three bins. - Martin Böhm 001; Jirí Sgall; Rob van Stee; Pavel Veselý 001 (J. Sched., 2017)

SIGACT News Online Algorithms Column 30: 2016 in review. - Rob van Stee (SIGACT News, 2017)

SIGACT News Online Algorithms Column 32: 2017 in review. - Rob van Stee (SIGACT News, 2017)

Multidimensional Packing Problems. - Leah Epstein; Rob van Stee (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

SIGACT News Online Algorithms Column 33. - Rob van Stee (SIGACT News, 2018)

SIGACT News Online Algorithms Column 34: 2018 in review. - Rob van Stee (SIGACT News, 2018)

The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays. - Yossi Azar; Yuval Emek; Rob van Stee; Danny Vainstein (SPAA, 2019)

The optimal absolute ratio for online bin packing. - János Balogh; József Békési; György Dósa; Jirí Sgall; Rob van Stee (J. Comput. Syst. Sci., 2019)

SIGACT News Online Algorithms Column 35: 2019 in review. - Felix Höhne; Sören Schmitt; Rob van Stee (SIGACT News, 2019)

SIGACT News Online Algorithms Column 36: 2020 in review. - Felix Höhne; Sören Schmitt; Rob van Stee (SIGACT News, 2020)

Allocating contiguous blocks of indivisible chores fairly. - Felix Höhne; Rob van Stee (Inf. Comput., 2021)

SIGACT News Online Algorithms Column 38: 2021 in review. - Felix Höhne; Sören Schmitt; Rob van Stee (SIGACT News, 2021)

SIGACT News Online Algorithms Column 37. - Rob van Stee (SIGACT News, 2021)

Buffer minimization with conflicts on a line. - Felix Höhne; Rob van Stee (Theor. Comput. Sci., 2021)

SIGACT News Online Algorithms Column 39. - Rob van Stee (SIGACT News, 2022)

A 10/7-Approximation for Discrete Bamboo Garden Trimming and Continuous Trimming on Star Graphs. - Felix Höhne; Rob van Stee (APPROX/RANDOM, 2023)

SIGACT News Online Algorithms Column 40: 2022 in review. - Aflatoun Amouzandeh; Sören Schmitt; Rob van Stee (SIGACT News, 2023)

SIGACT News Online Algorithms Column 41: 2023 in review. - Aflatoun Amouzandeh; Sören Schmitt; Rob van Stee (SIGACT News, 2023)

Improved Online Load Balancing with Known Makespan. - Martin Böhm 001; Matej Lieskovský; Sören Schmitt; Jirí Sgall; Rob van Stee (APPROX/RANDOM, 2024)

Improved Online Scheduling with Restarts on a Single Machine. - Aflatoun Amouzandeh; Rob van Stee (WAOA, 2024)

SIGACT News Online Algorithms Column 42. - Rob van Stee (SIGACT News, 2024)

SIGACT News Online Algorithms Column 43: 2024 in review. - Aflatoun Amouzandeh; Sören Schmitt; Rob van Stee (SIGACT News, 2024)