Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Rob van
    Last name: Stee
    DBLP: 10/4553
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 100 of 102  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee.
    A (5/3 + ε)-approximation for strip packing.
    Comput. Geom. 2014, Volume 47 (0) 2014
    Conference paper
    Leah Epstein, Elena Kleiman, Rob van Stee.
    The cost of selfishness for maximizing the minimum load on uniformly related machines.
    J. Comb. Optim. 2014, Volume 27 (0) 2014
    Journal article
    Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý.
    Better Algorithms for Online Bin Stretching.
    CoRR 2014, Volume 0 (0) 2014
    Journal article
    Rob van Stee.
    SIGACT news online algorithms column 23.
    SIGACT News 2014, Volume 45 (0) 2014
    Conference paper
    Xujin Chen, Benjamin Doerr, Carola Doerr, Xiao-Dong Hu, Weidong Ma, Rob van Stee.
    The Price of Anarchy for Selfish Ring Routing is Two.
    ACM Trans. Economics and Comput. 2014, Volume 2 (0) 2014
    Conference paper
    Rob van Stee.
    SIGACT news online algorithms column 24: 2014 so far.
    SIGACT News 2014, Volume 45 (0) 2014
    Journal article
    Xujin Chen, Leah Epstein, Elena Kleiman, Rob van Stee.
    Maximizing the minimum load: The cost of selfishness.
    Theor. Comput. Sci. 2013, Volume 482 (0) 2013
    Journal article
    Peter Sanders, Johannes Singler, Rob van Stee.
    Real-time integrated prefetching and caching.
    J. Scheduling 2013, Volume 16 (0) 2013
    Conference paper
    Leah Epstein, Asaf Levin, Rob van Stee.
    A unified approach to truthful scheduling on related machines.
    Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013 2013 (0) 2013
    Journal article
    George Christodoulou 0001, Annamária Kovács, Rob van Stee.
    A truthful constant approximation for maximizing the minimum load on related machines.
    Theor. Comput. Sci. 2013, Volume 489 (0) 2013
    Conference paper
    Rob van Stee.
    SIGACT news online algorithms column 22.
    SIGACT News 2013, Volume 44 (0) 2013
    Conference paper
    Sandy Heydrich, Rob van Stee.
    Dividing Connected Chores Fairly.
    Algorithmic Game Theory - 6th International Symposium, SAGT 2013, Aachen, Germany, October 21-23, 2013. Proceedings 2013 (0) 2013
    Journal article
    Marc P. Renault, Adi Rosén, Rob van Stee.
    Online Algorithms with Advice for Bin Packing and Scheduling Problems.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Rolf Harren, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Rob van Stee.
    Two for One: Tight Approximation of 2D Bin Packing.
    Int. J. Found. Comput. Sci. 2013, Volume 24 (0) 2013
    Conference paper
    Anna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee.
    Reordering Buffer Management with Advice.
    Approximation and Online Algorithms - 11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers 2014 (0) 2013
    Journal article
    Leah Epstein, Asaf Levin, Rob van Stee.
    Approximation Schemes for Packing Splittable Items with Cardinality Constraints.
    Algorithmica 2012, Volume 62 (0) 2012
    Journal article
    Rolf Harren, Rob van Stee.
    Absolute approximation ratios for packing rectangles into bins.
    J. Scheduling 2012, Volume 15 (0) 2012
    Journal article
    Leah Epstein, Rob van Stee.
    The price of anarchy on uniformly related machines revisited.
    Inf. Comput. 2012, Volume 212 (0) 2012
    Journal article
    Ho-Leung Chan, Nicole Megow, René Sitters, Rob van Stee.
    A note on sorting buffers offline.
    Theor. Comput. Sci. 2012, Volume 423 (0) 2012
    Journal article
    Rob van Stee.
    An improved algorithm for online rectangle filling.
    Theor. Comput. Sci. 2012, Volume 423 (0) 2012
    Conference paper
    Rob van Stee.
    SIGACT news online algorithms column 20: the power of harmony.
    SIGACT News 2012, Volume 43 (0) 2012
    Conference paper
    Leah Epstein, Lukasz Jez, Jirí Sgall, Rob van Stee.
    Online Scheduling of Jobs with Fixed Start Times on Related Machines.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Leah Epstein, Asaf Levin, Rob van Stee.
    A unified approach to truthful scheduling on related machines
    CoRR 2012, Volume 0 (0) 2012
    Journal article
    Xujin Chen, Benjamin Doerr, Xiao-Dong Hu, Weidong Ma, Rob van Stee, Carola Doerr.
    The Price of Anarchy for Selfish Ring Routing is Two
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Xujin Chen, Benjamin Doerr, Xiao-Dong Hu, Weidong Ma, Rob van Stee, Carola Doerr.
    The Price of Anarchy for Selfish Ring Routing Is Two.
    Internet and Network Economics - 8th International Workshop, WINE 2012, Liverpool, UK, December 10-12, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Rob van Stee.
    SIGACT news online algorithms column 21: APPROX and ALGO.
    SIGACT News 2012, Volume 43 (0) 2012
    Conference paper
    Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee.
    A (5/3 + eps)-Approximation for 2D Strip Packing.
    11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Munich, Germany, May 29-31, 2012. Extended Abstracts. 2012 (0) 2012
    Journal article
    Leah Epstein, Rob van Stee.
    Improved Results for a Memory Allocation Problem.
    Theory Comput. Syst. 2011, Volume 48 (0) 2011
    Conference paper
    Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee.
    A (5/3 + ?)-Approximation for Strip Packing.
    Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings 2011 (0) 2011
    Conference paper
    Leah Epstein, Asaf Levin, Rob van Stee.
    Max-min Online Allocations with a Reordering Buffer.
    SIAM J. Discrete Math. 2011, Volume 25 (0) 2011
    Conference paper
    Leah Epstein, Asaf Levin, Rob van Stee.
    Max-min Online Allocations with a Reordering Buffer.
    Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I 2010 (0) 2010
    Journal article
    Ho-Leung Chan, Nicole Megow, Rob van Stee, René Sitters.
    The Sorting Buffer Problem is NP-hard
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    George Christodoulou, Annamária Kovács, Rob van Stee.
    A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines.
    Internet and Network Economics - 6th International Workshop, WINE 2010, Stanford, CA, USA, December 13-17, 2010. Proceedings 2010 (0) 2010
    Journal article
    Leah Epstein, Rob van Stee.
    On the online unit clustering problem.
    ACM Transactions on Algorithms 2010, Volume 7 (0) 2010
    Conference paper
    Rob van Stee.
    An Improved Algorithm for Online Rectangle Filling.
    Approximation and Online Algorithms - 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers 2011 (0) 2010
    Conference paper
    Leah Epstein, Rob van Stee.
    Maximizing the minimum load for selfish agents.
    Theor. Comput. Sci. 2010, Volume 411 (0) 2010
    Conference paper
    George Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, Rob van Stee.
    On the Price of Stability for Undirected Network Design.
    Approximation and Online Algorithms, 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers 2010 (0) 2009
    Conference paper
    Rolf Harren, Rob van Stee.
    Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Leah Epstein, Elena Kleiman, Rob van Stee.
    Maximizing the Minimum Load: The Cost of Selfishness.
    Internet and Network Economics, 5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Rolf Harren, Rob van Stee.
    An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Leah Epstein, Rob van Stee, Tami Tamir.
    Paging with Request Sets.
    Theory Comput. Syst. 2009, Volume 44 (0) 2009
    Conference paper
    Leah Epstein, Rob van Stee.
    Maximizing the Minimum Load for Selfish Agents.
    LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings 2008 (0) 2008
    Conference paper
    Rolf Harren, Rob van Stee.
    Packing Rectangles into 2OPT Bins Using Rotations.
    Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings 2008 (0) 2008
    Conference paper
    Leah Epstein, Rob van Stee.
    The Price of Anarchy on Uniformly Related Machines Revisited.
    Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings 2008 (0) 2008
    Conference paper
    Leah Epstein, Asaf Levin, Rob van Stee.
    Two-dimensional packing with conflicts.
    Acta Inf. 2008, Volume 45 (0) 2008
    Conference paper
    Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut.
    Speed Scaling of Tasks with Precedence Constraints.
    Theory Comput. Syst. 2008, Volume 43 (0) 2008
    Conference paper
    Sven Oliver Krumke, Anne Schwahn, Rob van Stee, Stephan Westphal.
    A monotone approximation algorithm for scheduling with precedence constraints.
    Oper. Res. Lett. 2008, Volume 36 (0) 2008
    Conference paper
    Leah Epstein, Asaf Levin, Rob van Stee.
    Online unit clustering: Variations on a theme.
    Theor. Comput. Sci. 2008, Volume 407 (0) 2008
    Book chapter
    Rob van Stee.
    Packet Switching in Single Buffer.
    Encyclopedia of Algorithms 2008 (0) 2008
    Book chapter
    Rob van Stee.
    Paging.
    Encyclopedia of Algorithms 2008 (0) 2008
    Conference paper
    Leah Epstein, Rob van Stee.
    Preemptive Scheduling on Selfish Machines.
    Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers 2007 (0) 2007
    Conference paper
    Leah Epstein, Rob van Stee.
    Maximizing the Minimum Load for Selfisch Agents.
    Fair Division, 24.06. - 29.06.2007 2007 (0) 2007
    Conference paper
    Leah Epstein, Asaf Levin, Rob van Stee.
    Multi-dimensional Packing with Conflicts.
    Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Leah Epstein, Rob van Stee.
    Improved Results for a Memory Allocation Problem.
    Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Leah Epstein, Rob van Stee.
    On the Online Unit Clustering Problem.
    Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers 2008 (0) 2007
    Conference paper
    Leah Epstein, Rob van Stee.
    Approximation Schemes for Packing Splittable Items with Cardinality Constraints.
    Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers 2008 (0) 2007
    Conference paper
    Susanne Albers, Rob van Stee.
    A Study of Integrated Document and Connection Caching in the WWW.
    Algorithmica 2007, Volume 47 (0) 2007
    Conference paper
    Leah Epstein, Rob van Stee.
    Calculating lower bounds for caching problems.
    Computing 2007, Volume 80 (0) 2007
    Conference paper
    Leah Epstein, Yanir Kleiman, Jirí Sgall, Rob van Stee.
    Paging with connections: FIFO strikes again.
    Theor. Comput. Sci. 2007, Volume 377 (0) 2007
    Conference paper
    Leah Epstein, Rob van Stee.
    Online bin packing with resource augmentation.
    Discrete Optimization 2007, Volume 4 (0) 2007
    Conference paper
    Leah Epstein, Rob van Stee.
    Bounds for online bounded space hypercube packing.
    Discrete Optimization 2007, Volume 4 (0) 2007
    Conference paper
    Leah Epstein, Rob van Stee, Tami Tamir.
    Paging with Request Sets.
    Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings 2006 (0) 2006
    Conference paper
    Leah Epstein, Rob van Stee.
    Improved results for a memory allocation problem
    CoRR 2006, Volume 0 (0) 2006
    Conference paper
    Leah Epstein, Rob van Stee.
    Covering selfish machines
    CoRR 2006, Volume 0 (0) 2006
    Conference paper
    Leah Epstein, Rob van Stee.
    Optimal on-line flow time with resource augmentation.
    Discrete Applied Mathematics 2006, Volume 154 (0) 2006
    Conference paper
    Leah Epstein, Rob van Stee.
    This side up!
    ACM Transactions on Algorithms 2006, Volume 2 (0) 2006
    Conference paper
    Leah Epstein, Rob van Stee.
    Online scheduling of splittable tasks.
    ACM Transactions on Algorithms 2006, Volume 2 (0) 2006
    Conference paper
    Stephan Westphal, Sven Oliver Krumke, Rob van Stee.
    Competitive Algorithms for Cottage Rental.
    Electronic Notes in Discrete Mathematics 2006, Volume 25 (0) 2006
    Conference paper
    Leah Epstein, Rob van Stee.
    Online scheduling of splittable tasks.
    Algorithms for Optimization with Incomplete Information, 16.-21. January 2005 2005 (0) 2005
    Conference paper
    Klaus Jansen, Rob van Stee.
    On strip packing With rotations.
    Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005 2005 (0) 2005
    Conference paper
    Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut.
    Speed Scaling of Tasks with Precedence Constraints.
    Approximation and Online Algorithms, Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers 2006 (0) 2005
    Conference paper
    Leah Epstein, Rob van Stee.
    Online square and cube packing.
    Acta Inf. 2004, Volume 41 (0) 2005
    Conference paper
    Alexander Kesselman, Yishay Mansour, Rob van Stee.
    Improved Competitive Guarantees for QoS Buffering.
    Algorithmica 2005, Volume 43 (0) 2005
    Conference paper
    Rob van Stee, Johannes A. La Poutré.
    Minimizing the total completion time on-line on a single machine, using restarts.
    J. Algorithms 2005, Volume 57 (0) 2005
    Conference paper
    Leah Epstein, Rob van Stee.
    Optimal Online Algorithms for Multidimensional Packing Problems.
    SIAM J. Comput. 2006, Volume 35 (0) 2005
    Conference paper
    Leah Epstein, Rob van Stee.
    On Variable-Sized Multidimensional Packing.
    Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings 2004 (0) 2004
    Conference paper
    Leah Epstein, Rob van Stee.
    Optimal online bounded space multidimensional packing.
    Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004 2004 (0) 2004
    Conference paper
    Leah Epstein, Rob van Stee.
    Online Scheduling of Splittable Tasks in Peer-to-Peer Networks.
    Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings 2004 (0) 2004
    Conference paper
    Leah Epstein, Rob van Stee.
    Online Bin Packing with Resource Augmentation.
    Approximation and Online Algorithms, Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers 2005 (0) 2004
    Conference paper
    Leah Epstein, Rob van Stee.
    This Side Up!
    Approximation and Online Algorithms, Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers 2005 (0) 2004
    Conference paper
    Leah Epstein, Rob van Stee.
    Minimizing the maximum starting time on-line.
    Inf. Comput. 2004, Volume 195 (0) 2004
    Conference paper
    Rob van Stee.
    An approximation algorithm for square packing.
    Oper. Res. Lett. 2004, Volume 32 (0) 2004
    Conference paper
    Tomás Feder, Rajeev Motwani, Rina Panigrahy, Steven S. Seiden, Rob van Stee, An Zhu.
    Combining request scheduling with web caching.
    Theor. Comput. Sci. 2004, Volume 324 (0) 2004
    Conference paper
    Alexander Kesselman, Yishay Mansour, Rob van Stee.
    Improved Competitive Guarantees for QoS Buffering.
    Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings 2003 (0) 2003
    Conference paper
    Susanne Albers, Rob van Stee.
    A Study of Integrated Document and Connection Caching.
    Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings 2003 (0) 2003
    Conference paper
    Steven S. Seiden, Rob van Stee.
    New Bounds for Multidimensional Packing.
    Algorithmica 2003, Volume 36 (0) 2003
    Conference paper
    Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania.
    Preemptive scheduling in overloaded systems.
    J. Comput. Syst. Sci. 2003, Volume 67 (0) 2003
    Conference paper
    Eric Bach, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Tao Jiang, Kim S. Larsen, Guohui Lin, Rob van Stee.
    Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.
    J. Scheduling 2003, Volume 6 (0) 2003
    Conference paper
    Steven S. Seiden, Rob van Stee, Leah Epstein.
    New Bounds for Variable-Sized Online Bin Packing.
    SIAM J. Comput. 2003, Volume 32 (0) 2003
    Conference paper
    Leah Epstein, Csanád Imreh, Rob van Stee.
    More on weighted servers or FIFO is better than LRU.
    Theor. Comput. Sci. 2003, Volume 306 (0) 2003
    Conference paper
    Leah Epstein, Rob van Stee.
    Lower bounds for on-line single-machine scheduling.
    Theor. Comput. Sci. 2003, Volume 1 (0) 2003
    Conference paper
    Leah Epstein, Rob van Stee.
    Minimizing the Maximum Starting Time On-line.
    Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings 2002 (0) 2002
    Conference paper
    Rob van Stee, Johannes A. La Poutré.
    Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts.
    Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings 2002 (0) 2002
    Conference paper
    Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania.
    Preemptive Scheduling in Overloaded Systems.
    Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings 2002 (0) 2002
    Conference paper
    Leah Epstein, Steven S. Seiden, Rob van Stee.
    New Bounds for Variable-Sized and Resource Augmented Online Bin Packing.
    Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings 2002 (0) 2002
    Conference paper
    Leah Epstein, Csanád Imreh, Rob van Stee.
    More on Weighted Servers or FIFO is Better than LRU.
    Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings 2002 (0) 2002
    Conference paper
    Steven S. Seiden, Rob van Stee.
    New bounds for multi-dimensional packing.
    SODA 2002 (0) 2002
    Conference paper
    Leah Epstein, Rob van Stee.
    Optimal Online Flow Time with Resource Augmentation.
    Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings 2001 (0) 2001
    Conference paper
    Leah Epstein, Rob van Stee.
    Lower Bounds for On-Line Single-Machine Scheduling.
    Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings 2001 (0) 2001
    Conference paper
    Rob van Stee, Johannes A. La Poutré.
    Running a job on a collection of partly available machines, with on-line restarts.
    Acta Inf. 2001, Volume 37 (0) 2001
    Show item 1 to 100 of 102  

    Your query returned 102 matches in the database.