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 25 of 90  

Select a publication
Show	Title	Venue	Rating	Date
	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 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, Jiri 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

Show item 1 to 25 of 90  

Your query returned 90 matches in the database.