Rob van Stee

155 papers A* 9A 6B 21C 1Misc 1Journal 94Unranked 15
YearRankTypeTitle / Venue / Authors
2026 J jnl
Forwarding Packets Greedily.
CoRR
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Kevin Schewior, Rob van Stee
2026 J jnl
Improved Online Scheduling with Restarts on a Single Machine.
Theory Comput. Syst.
Aflatoun Amouzandeh, Rob van Stee
2026 B conf
The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts.
SOFSEM
Niklas Haas, Sören Schmitt, Rob van Stee
2025 J jnl
Minimizing the Weighted Makespan with Restarts on a Single Machine.
CoRR
Aflatoun Amouzandeh, Klaus Jansen, Lis Pirotton, Rob van Stee, Corinna Wambsganz
2025 J jnl
SIGACT News Online Algorithms Column 44: 2025 in review.
SIGACT News
Aflatoun Amouzandeh, Paul Hesse, Sören Schmitt, Rob van Stee
2025 J jnl
The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts.
CoRR
Niklas Haas, Sören Schmitt, Rob van Stee
2024 A conf
Improved Online Load Balancing with Known Makespan.
APPROX/RANDOM
Martin Böhm, Matej Lieskovský, Sören Schmitt, Jirí Sgall, Rob van Stee
2024 B conf
Improved Online Scheduling with Restarts on a Single Machine.
WAOA
Aflatoun Amouzandeh, Rob van Stee
2024 J jnl
Improved online load balancing with known makespan.
CoRR
Martin Böhm, Matej Lieskovský, Sören Schmitt, Jirí Sgall, Rob van Stee
2024 J jnl
SIGACT News Online Algorithms Column 42.
SIGACT News
Rob van Stee
2024 J jnl
SIGACT News Online Algorithms Column 43: 2024 in review.
SIGACT News
Aflatoun Amouzandeh, Sören Schmitt, Rob van Stee
2023 A conf
A 10/7-Approximation for Discrete Bamboo Garden Trimming and Continuous Trimming on Star Graphs.
APPROX/RANDOM
Felix Höhne, Rob van Stee
2023 J jnl
SIGACT News Online Algorithms Column 40: 2022 in review.
SIGACT News
Aflatoun Amouzandeh, Sören Schmitt, Rob van Stee
2023 J jnl
SIGACT News Online Algorithms Column 41: 2023 in review.
SIGACT News
Aflatoun Amouzandeh, Sören Schmitt, Rob van Stee
2022 J jnl
SIGACT News Online Algorithms Column 39.
SIGACT News
Rob van Stee
2021 J jnl
Allocating contiguous blocks of indivisible chores fairly.
Inf. Comput.
Felix Höhne, Rob van Stee
2021 J jnl
Buffer minimization with conflicts on a line.
Theor. Comput. Sci.
Felix Höhne, Rob van Stee
2021 J jnl
SIGACT News Online Algorithms Column 37.
SIGACT News
Rob van Stee
2021 J jnl
SIGACT News Online Algorithms Column 38: 2021 in review.
SIGACT News
Felix Höhne, Sören Schmitt, Rob van Stee
2020 Misc conf
Buffer Minimization with Conflicts on a Line.
FAW
Felix Höhne, Rob van Stee
2020 J jnl
SIGACT News Online Algorithms Column 36: 2020 in review.
SIGACT News
Felix Höhne, Sören Schmitt, Rob van Stee
2019 J jnl
SIGACT News Online Algorithms Column 35: 2019 in review.
SIGACT News
Felix Höhne, Sören Schmitt, Rob van Stee
2019 B conf
The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays.
SPAA
Yossi Azar, Yuval Emek, Rob van Stee, Danny Vainstein
2019 J jnl
The optimal absolute ratio for online bin packing.
J. Comput. Syst. Sci.
János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee
2018 — ch.
Multidimensional Packing Problems.
Handbook of Approximation Algorithms and Metaheuristics (1)
Leah Epstein, Rob van Stee
2018 J jnl
SIGACT News Online Algorithms Column 33.
SIGACT News
Rob van Stee
2018 J jnl
SIGACT News Online Algorithms Column 34: 2018 in review.
SIGACT News
Rob van Stee
2017 J jnl
A two-phase algorithm for bin stretching with stretching factor 1.5.
J. Comb. Optim.
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
2017 J jnl
Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5.
J. Comb. Optim.
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
2017 J jnl
Online bin stretching with three bins.
J. Sched.
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
2017 J jnl
Reordering buffer management with advice.
J. Sched.
Anna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee
2017 J jnl
SIGACT News Online Algorithms Column 30: 2016 in review.
SIGACT News
Rob van Stee
2017 J jnl
SIGACT News Online Algorithms Column 32: 2017 in review.
SIGACT News
Rob van Stee
2016 J jnl
A Unified Approach to Truthful Scheduling on Related Machines.
Math. Oper. Res.
Leah Epstein, Asaf Levin, Rob van Stee
2016 A* conf
Beating the Harmonic Lower Bound for Online Bin Packing.
ICALP
Sandy Heydrich, Rob van Stee
2016 — ch.
Current Champion for Online Bin Packing.
Encyclopedia of Algorithms
Rob van Stee
2016 J jnl
Improved Lower Bounds for Online Hypercube Packing.
CoRR
Sandy Heydrich, Rob van Stee
2016 — ch.
Lower Bounds for Online Bin Packing.
Encyclopedia of Algorithms
Rob van Stee
2016 J jnl
Online Scheduling of Jobs with Fixed Start Times on Related Machines.
Algorithmica
Leah Epstein, Lukasz Jez, Jirí Sgall, Rob van Stee
2016 — ch.
Packet Switching in Single Buffer.
Encyclopedia of Algorithms
Rob van Stee
2016 J jnl
SIGACT News Online Algorithms Column 27: Online Matching on the Line, Part 1.
SIGACT News
Rob van Stee
2016 J jnl
SIGACT News Online Algorithms Column 28: Online Matching on the Line, Part 2.
SIGACT News
Rob van Stee
2016 J jnl
SIGACT News Online Algorithms Column 29.
SIGACT News
Rob van Stee
2016 J jnl
The Best Two-Phase Algorithm for Bin Stretching.
CoRR
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
2015 J jnl
Beating the Harmonic lower bound for online bin packing.
CoRR
Sandy Heydrich, Rob van Stee
2015 J jnl
Dividing connected chores fairly.
Theor. Comput. Sci.
Sandy Heydrich, Rob van Stee
2015 J jnl
Online algorithms with advice for bin packing and scheduling problems.
Theor. Comput. Sci.
Marc P. Renault, Adi Rosén, Rob van Stee
2015 J jnl
SIGACT News Online Algorithms Column 26: Bin packing in multiple dimensions.
SIGACT News
Rob van Stee
2015 A* conf
The optimal absolute ratio for online bin packing.
SODA
János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee
2014 J jnl
A (5/3 + ε)-approximation for strip packing.
Comput. Geom.
Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee
2014 B conf
Better Algorithms for Online Bin Stretching.
WAOA
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
2014 J jnl
Better Algorithms for Online Bin Stretching.
CoRR
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
2014 J jnl
SIGACT news online algorithms column 23.
SIGACT News
Rob van Stee
2014 J jnl
SIGACT news online algorithms column 24: 2014 so far.
SIGACT News
Rob van Stee
2014 J jnl
The Price of Anarchy for Selfish Ring Routing is Two.
ACM Trans. Economics and Comput.
Xujin Chen, Benjamin Doerr, Carola Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee
2014 J jnl
The cost of selfishness for maximizing the minimum load on uniformly related machines.
J. Comb. Optim.
Leah Epstein, Elena Kleiman, Rob van Stee
2013 J jnl
A truthful constant approximation for maximizing the minimum load on related machines.
Theor. Comput. Sci.
George Christodoulou, Annamária Kovács, Rob van Stee
2013 A* conf
A unified approach to truthful scheduling on related machines.
SODA
Leah Epstein, Asaf Levin, Rob van Stee
2013 B conf
Dividing Connected Chores Fairly.
SAGT
Sandy Heydrich, Rob van Stee
2013 J jnl
Maximizing the minimum load: The cost of selfishness.
Theor. Comput. Sci.
Xujin Chen, Leah Epstein, Elena Kleiman, Rob van Stee
2013 J jnl
Online Algorithms with Advice for Bin Packing and Scheduling Problems.
CoRR
Marc P. Renault, Adi Rosén, Rob van Stee
2013 — conf
Online Job Admission.
Fundamental Problems in Computing
Sven O. Krumke, Rob van Stee, Stephan Westphal
2013 J jnl
Real-time integrated prefetching and caching.
J. Sched.
Peter Sanders, Johannes Singler, Rob van Stee
2013 B conf
Reordering Buffer Management with Advice.
WAOA
Anna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee
2013 J jnl
SIGACT news online algorithms column 22.
SIGACT News
Rob van Stee
2013 J jnl
Two for One: Tight Approximation of 2D Bin Packing.
Int. J. Found. Comput. Sci.
Rolf Harren, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Rob van Stee
2012 C conf
A (5/3 + eps)-Approximation for 2D Strip Packing.
CTW
Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee
2012 J jnl
A note on sorting buffers offline.
Theor. Comput. Sci.
Ho-Leung Chan, Nicole Megow, René Sitters, Rob van Stee
2012 J jnl
A unified approach to truthful scheduling on related machines
CoRR
Leah Epstein, Asaf Levin, Rob van Stee
2012 J jnl
Absolute approximation ratios for packing rectangles into bins.
J. Sched.
Rolf Harren, Rob van Stee
2012 J jnl
An improved algorithm for online rectangle filling.
Theor. Comput. Sci.
Rob van Stee
2012 J jnl
Approximation Schemes for Packing Splittable Items with Cardinality Constraints.
Algorithmica
Leah Epstein, Asaf Levin, Rob van Stee
2012 — conf
Online Scheduling of Jobs with Fixed Start Times on Related Machines.
APPROX-RANDOM
Leah Epstein, Lukasz Jez, Jirí Sgall, Rob van Stee
2012 J jnl
SIGACT news online algorithms column 20: the power of harmony.
SIGACT News
Rob van Stee
2012 J jnl
SIGACT news online algorithms column 21: APPROX and ALGO.
SIGACT News
Rob van Stee
2012 — conf
The Price of Anarchy for Selfish Ring Routing Is Two.
WINE
Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, Carola Winzen
2012 J jnl
The Price of Anarchy for Selfish Ring Routing is Two
CoRR
Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, Carola Winzen
2012 J jnl
The price of anarchy on uniformly related machines revisited.
Inf. Comput.
Leah Epstein, Rob van Stee
2011 B conf
A (5/3 + ε)-Approximation for Strip Packing.
WADS
Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee
2011 J jnl
Improved Results for a Memory Allocation Problem.
Theory Comput. Syst.
Leah Epstein, Rob van Stee
2011 J jnl
Max-min Online Allocations with a Reordering Buffer.
SIAM J. Discret. Math.
Leah Epstein, Asaf Levin, Rob van Stee
2010 — conf
A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines.
WINE
George Christodoulou, Annamária Kovács, Rob van Stee
2010 B conf
An Improved Algorithm for Online Rectangle Filling.
WAOA
Rob van Stee
2010 — conf
Max-min Online Allocations with a Reordering Buffer.
ICALP (1)
Leah Epstein, Asaf Levin, Rob van Stee
2010 J jnl
Maximizing the minimum load for selfish agents.
Theor. Comput. Sci.
Leah Epstein, Rob van Stee
2010 J jnl
On the online unit clustering problem.
ACM Trans. Algorithms
Leah Epstein, Rob van Stee
2010 J jnl
The Sorting Buffer Problem is NP-hard
CoRR
Ho-Leung Chan, Nicole Megow, Rob van Stee, René Sitters
2009 J jnl
An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing
CoRR
Rolf Harren, Rob van Stee
2009 — conf
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems.
APPROX-RANDOM
Rolf Harren, Rob van Stee
2009 — conf
Maximizing the Minimum Load: The Cost of Selfishness.
WINE
Leah Epstein, Elena Kleiman, Rob van Stee
2009 B conf
On the Price of Stability for Undirected Network Design.
WAOA
George Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, Rob van Stee
2009 J jnl
Paging with Request Sets.
Theory Comput. Syst.
Leah Epstein, Rob van Stee, Tami Tamir
2008 J jnl
A monotone approximation algorithm for scheduling with precedence constraints.
Oper. Res. Lett.
Sven Oliver Krumke, Anne Schwahn, Rob van Stee, Stephan Westphal
2008 — —
Combinatorial algorithms for packing and scheduling problems
Rob van Stee
2008 B conf
Maximizing the Minimum Load for Selfish Agents.
LATIN
Leah Epstein, Rob van Stee
2008 J jnl
Online unit clustering: Variations on a theme.
Theor. Comput. Sci.
Leah Epstein, Asaf Levin, Rob van Stee
2008 — ch.
Packet Switching in Single Buffer.
Encyclopedia of Algorithms
Rob van Stee
2008 — conf
Packing Rectangles into 2OPT Bins Using Rotations.
SWAT
Rolf Harren, Rob van Stee
2008 — ch.
Paging.
Encyclopedia of Algorithms
Rob van Stee
2008 J jnl
Speed Scaling of Tasks with Precedence Constraints.
Theory Comput. Syst.
Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut
2008 B conf
The Price of Anarchy on Uniformly Related Machines Revisited.
SAGT
Leah Epstein, Rob van Stee
2008 J jnl
Two-dimensional packing with conflicts.
Acta Informatica
Leah Epstein, Asaf Levin, Rob van Stee
2007 J jnl
A Study of Integrated Document and Connection Caching in the WWW.
Algorithmica
Susanne Albers, Rob van Stee
2007 B conf
Approximation Schemes for Packing Splittable Items with Cardinality Constraints.
WAOA
Leah Epstein, Rob van Stee
2007 J jnl
Bounds for online bounded space hypercube packing.
Discret. Optim.
Leah Epstein, Rob van Stee
2007 J jnl
Calculating lower bounds for caching problems.
Computing
Leah Epstein, Rob van Stee
2007 B conf
Improved Results for a Memory Allocation Problem.
WADS
Leah Epstein, Rob van Stee
2007 — conf
Maximizing the Minimum Load for Selfisch Agents.
Fair Division
Leah Epstein, Rob van Stee
2007 B conf
Multi-dimensional Packing with Conflicts.
FCT
Leah Epstein, Asaf Levin, Rob van Stee
2007 — ch.
Multidimensional Packing Problems.
Handbook of Approximation Algorithms and Metaheuristics
Leah Epstein, Rob van Stee
2007 B conf
On the Online Unit Clustering Problem.
WAOA
Leah Epstein, Rob van Stee
2007 J jnl
Online bin packing with resource augmentation.
Discret. Optim.
Leah Epstein, Rob van Stee
2007 J jnl
Paging with connections: FIFO strikes again.
Theor. Comput. Sci.
Leah Epstein, Yanir Kleiman, Jirí Sgall, Rob van Stee
2007 — conf
Preemptive Scheduling on Selfish Machines.
CAAN
Leah Epstein, Rob van Stee
2006 J jnl
Competitive Algorithms for Cottage Rental.
Electron. Notes Discret. Math.
Stephan Westphal, Sven Oliver Krumke, Rob van Stee
2006 J jnl
Covering selfish machines
CoRR
Leah Epstein, Rob van Stee
2006 J jnl
Improved results for a memory allocation problem
CoRR
Leah Epstein, Rob van Stee
2006 J jnl
Online scheduling of splittable tasks.
ACM Trans. Algorithms
Leah Epstein, Rob van Stee
2006 J jnl
Optimal on-line flow time with resource augmentation.
Discret. Appl. Math.
Leah Epstein, Rob van Stee
2006 — conf
Paging with Request Sets.
SWAT
Leah Epstein, Rob van Stee, Tami Tamir
2006 J jnl
This side up!
ACM Trans. Algorithms
Leah Epstein, Rob van Stee
2005 J jnl
Improved Competitive Guarantees for QoS Buffering.
Algorithmica
Alexander Kesselman, Yishay Mansour, Rob van Stee
2005 J jnl
Minimizing the total completion time on-line on a single machine, using restarts.
J. Algorithms
Rob van Stee, Johannes A. La Poutré
2005 A* conf
On strip packing With rotations.
STOC
Klaus Jansen, Rob van Stee
2005 — conf
Online scheduling of splittable tasks.
Algorithms for Optimization with Incomplete Information
Leah Epstein, Rob van Stee
2005 J jnl
Online square and cube packing.
Acta Informatica
Leah Epstein, Rob van Stee
2005 J jnl
Optimal Online Algorithms for Multidimensional Packing Problems.
SIAM J. Comput.
Leah Epstein, Rob van Stee
2005 B conf
Speed Scaling of Tasks with Precedence Constraints.
WAOA
Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut
2004 J jnl
An approximation algorithm for square packing.
Oper. Res. Lett.
Rob van Stee
2004 J jnl
Combining request scheduling with web caching.
Theor. Comput. Sci.
Tomás Feder, Rajeev Motwani, Rina Panigrahy, Steven S. Seiden, Rob van Stee, An Zhu
2004 J jnl
Minimizing the maximum starting time on-line.
Inf. Comput.
Leah Epstein, Rob van Stee
2004 A conf
On Variable-Sized Multidimensional Packing.
ESA
Leah Epstein, Rob van Stee
2004 B conf
Online Bin Packing with Resource Augmentation.
WAOA
Leah Epstein, Rob van Stee
2004 — conf
Online Scheduling of Splittable Tasks in Peer-to-Peer Networks.
SWAT
Leah Epstein, Rob van Stee
2004 A* conf
Optimal online bounded space multidimensional packing.
SODA
Leah Epstein, Rob van Stee
2004 B conf
This Side Up!
WAOA
Leah Epstein, Rob van Stee
2003 A* conf
A Study of Integrated Document and Connection Caching.
ICALP
Susanne Albers, Rob van Stee
2003 A conf
Improved Competitive Guarantees for QoS Buffering.
ESA
Alexander Kesselman, Yishay Mansour, Rob van Stee
2003 J jnl
Lower bounds for on-line single-machine scheduling.
Theor. Comput. Sci.
Leah Epstein, Rob van Stee
2003 J jnl
More on weighted servers or FIFO is better than LRU.
Theor. Comput. Sci.
Leah Epstein, Csanád Imreh, Rob van Stee
2003 J jnl
New Bounds for Multidimensional Packing.
Algorithmica
Steven S. Seiden, Rob van Stee
2003 J jnl
New Bounds for Variable-Sized Online Bin Packing.
SIAM J. Comput.
Steven S. Seiden, Rob van Stee, Leah Epstein
2003 J jnl
Preemptive scheduling in overloaded systems.
J. Comput. Syst. Sci.
Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
2003 J jnl
Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.
J. Sched.
Eric Bach, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Tao Jiang, Kim S. Larsen, Guo-Hui Lin, Rob van Stee
2002 A conf
Minimizing the Maximum Starting Time On-line.
ESA
Leah Epstein, Rob van Stee
2002 A conf
Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts.
ESA
Rob van Stee, Johannes A. La Poutré
2002 B conf
More on Weighted Servers or FIFO is Better than LRU.
MFCS
Leah Epstein, Csanád Imreh, Rob van Stee
2002 A* conf
New Bounds for Variable-Sized and Resource Augmented Online Bin Packing.
ICALP
Leah Epstein, Steven S. Seiden, Rob van Stee
2002 A* conf
New bounds for multi-dimensional packing.
SODA
Steven S. Seiden, Rob van Stee
2002 A* conf
Preemptive Scheduling in Overloaded Systems.
ICALP
Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
2001 B conf
Lower Bounds for On-Line Single-Machine Scheduling.
MFCS
Leah Epstein, Rob van Stee
2001 B conf
Optimal Online Flow Time with Resource Augmentation.
FCT
Leah Epstein, Rob van Stee
2001 J jnl
Running a job on a collection of partly available machines, with on-line restarts.
Acta Informatica
Rob van Stee, Johannes A. La Poutré
2000 — conf
Partial servicing of on-line jobs.
APPROX
Rob van Stee, Johannes A. La Poutré
2000 — conf
Resource Augmentation in Load Balancing.
SWAT
Yossi Azar, Leah Epstein, Rob van Stee