Your search returned the following 43 documents:

43. Dividing Connected Chores Fairly
    Sandy Heydrich and Rob van Stee
    Theoretical Computer Science 593: 51-61, 2015
    
42. A truthful constant approximation for maximizing the minimum load on related machines
    George Christodoulou, Annamaria Kovacs, and Rob van Stee
    Theoretical Computer Science 489-490: 88-98, 2013
    
    
41. A unified approach to truthful scheduling on related machines
    Leah Epstein, Asaf Levin, and Rob van Stee
    In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, USA, 2013, 1243-1252
    [PDF: Download: monotone_PTAS_SODA_proceedings.pdf]
    
40. Dividing connected chores fairly
    Sandy Heydrich and Rob van Stee
    In: 6th International Symposium on Algorithmic Game Theory, Aachen, Germany, 2013, 420-433
    
    
39. Maximizing the minimum load: The cost of selfishness
    Xujin Chen, Leah Epstein, Elena Kleiman, and Rob van Stee
    Theoretical Computer Science 482: 9-19, 2013
    
    
38. Real-time prefetching and caching
    Peter Sanders, Johannes Singler, and Rob van Stee
    Journal of Scheduling 16 (1): 47-58, 2013
    [PDF: Download: fetch.pdf]
    
37. SIGACT News Online Algorithms Column 22
    Rob van Stee
    SIGACT News 44 (2): 125 p., 2013
    
36. A note on sorting buffers offline
    Ho-Leung Chan, Nicole Megow, René Sitters, and Rob van Stee
    Theoretical Computer Science 423: 11-18, 2012
    
    
35. Absolute Approximation Ratios for Packing Rectangles into Bins
    Rolf Harren and Rob van Stee
    Journal of Scheduling 15 (1): 63-75, 2012
    
34. An improved algorithm for online rectangle filling
    Rob van Stee
    Theoretical Computer Science 423: 59-74, 2012
    
    
33. Approximation Schemes for Packing Splittable Items with Cardinality Constraints
    Leah Epstein, Asaf Levin, and Rob van Stee
    Algorithmica 62 (1-2): 102-129, 2012
    [Download: cards-j_revised2.dvi]
    
32. Online Scheduling of Jobs with Fixed Start Times on Related Machines
    Leah Epstein, Lukasz Jez, Jiri Sgall, and Rob van Stee
    In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012, Boston, USA, 2012, 134-145
    
    
31. The price of anarchy on uniformly related machines revisited
    Leah Epstein and Rob van Stee
    Information and Computation 212: 37-54, 2012
    
    
30. The Price of Anarchy for Selfish Ring Routing is Two
    Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, and Carola Winzen
    In: Internet and Network Economics : 8th International Workshop, WINE 2012, Liverpool, UK, 2012, 420-433
    
    
29. SIGACT News Online Algorithms Column 20: The Power of Harmony
    Rob van Stee
    SIGACT News 43 (2): 127-136, 2012
    
    
28. SIGACT News Online Algorithms Column 21: APPROX and ALGO
    Rob van Stee
    SIGACT News 43 (4): 123-129, 2012
    
    
27. A (5/3 + ε)-Approximation for Strip Packing
    Rolf Harren, Klaus Jansen, Lars Prädel, and Rob van Stee
    In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, New York, NY, 2011, 475-487
    [PDF: Download: strip53.pdf]
    
26. An improved algorithm for online rectangle filling
    Rob van Stee
    In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, Liverpool, Great Britain, 2011, 249-260
    [PDF: Download: recfillingJ.pdf]
    
25. Improved results for a memory allocation problem
    Leah Epstein and Rob van Stee
    Theory of Computing Systems 48 (1): 79-92, 2011
    [PDF: Download: splitemj9.pdf]
    
24. Max-min online allocations with a reordering buffer
    Leah Epstein, Asaf Levin, and Rob van Stee
    SIAM Journal on Discrete Mathematics 25 (3): 1230-1250, 2011
    [Download: bcover_jour2.dvi] [PDF: Download: bcover_jour5_rev_sec.pdf]
    
23. On the online unit clustering problem
    Leah Epstein and Rob van Stee
    ACM Transactions on Algorithms 7 (1): 7:1-7:1, 2011
    
22. A truthful constant approximation for maximizing the minimum load on related machines
    George Christodoulou, Annamaria Kovacs, and Rob van Stee
    In: Internet and Network Economics : 6th International Workshop, WINE 2010, Stanford, USA, 2010, 182-193
    
21. Max-min online allocations with a reordering buffer
    Leah Epstein, Asaf Levin, and Rob van Stee
    In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, Bordeaux, France, 2010, 336-347
    
    
20. Maximizing the minimum load for selfish agents
    Leah Epstein and Rob van Stee
    Theoretical Computer Science 411 (1): 44-57, 2010
    
19. On the online unit clustering problem
    Leah Epstein and Rob van Stee
    ACM Transactions on Algorithms 7 (1): 1-18, 2010
    
    
18. On the price of stability for undirected network design
    George Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, and Rob van Stee
    In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, Copenhagen, Denmark, 2010, 86-97
    [Download: networkpos.dvi]
    
17. Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
    Rolf Harren and Rob van Stee
    In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, Berkeley, CA, 2009, 177-189
    
16. Maximizing the Minimum Load: The Cost of Selfishness
    Leah Epstein, Elena Kleiman, and Rob van Stee
    In: Internet and Network Economics : 5th International Workshop, WINE 2009, Rome, Italy, 2009, 232-243
    
15. Online job admissions
    Sven Krumke, Rob van Stee, and Stefan Westphal
    In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 2009, 435-454
    [PDF: Download: online-jobs.pdf]
    
14. Paging with request sets
    Leah Epstein, Rob van Stee, and Tami Tamir
    Theory of Computing Systems 44 (1): 67-81, 2009
    [PDF: Download: pagesets-j3.pdf]
    
13. More on weighted servers or FIFO is better than LRU
    Leah Epstein, Csanád Imreh, and Rob van Stee
    In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, Warsawa-Otwock, Poland, 2002, 257-268
    
12. A monotone approximation algorithm for scheduling with precedence constraints
    Sven Oliver Krumke, Anne Schwahn, Rob van Stee, and Stephan Westphal
    Operations Research Letters 36 (2): 247-249, 2008
    [Download: mprecede.dvi]
    
11. Approximation schemes for packing splittable items with cardinality constraints
    Leah Epstein and Rob van Stee
    In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, 2008, 232-245
    [PS: Download: cards-j.ps]
    
10. Combinatorial algorithms for packing and scheduling problems
    Rob van Stee
    Habilitation thesis, Universität Karlsruhe, 2008
    [PS: Download: habil-embed.ps]
    
9. Maximizing the minimum load for selfish agents
   Leah Epstein and Rob van Stee
   In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, 2008, 264-275
   [Download: cover16.dvi]
   
8. On the Online Unit Clustering Problem
   Leah Epstein and Rob van Stee
   In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, 2008, 193-206
   [Download: unitj3.dvi]
   
7. Online unit clustering: Variations on a theme
   Leah Epstein, Asaf Levin, and Rob van Stee
   Theoretical Computer Science 407 (1-3): 85-96, 2008
   [PDF: Download: unitcard_jour2.pdf]
   
6. Packet Switching in Single Buffer
   Rob van Stee
   In: Encyclopedia of Algorithms, 2008, 1-99
   [Download: paging.dvi]
   
5. Packing Rectangles into 2 OPT Bins using Rotations
   Rolf Harren and Rob van Stee
   In: 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, 2008, 306-318
   [PDF: Download: Harren,vanStee-SWAT2008.pdf]
   
4. Paging
   Rob van Stee
   In: Encyclopedia of Algorithms, 2008, 1-99
   [Download: paging.dvi]
   
3. Speed Scaling of Tasks with Precedence Constraints
   Kirk Pruhs, Rob van Stee, and Patchrawat Uthaisombut
   Theory of Computing Systems 43 (1): 67-80, 2008
   [PS: Download: precede-j5.ps]
   
2. The price of anarchy on uniformly related machines revisited
   Leah Epstein and Rob van Stee
   In: Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, 2008, 46-57
   [Download: poa-sagt.dvi]
   
1. Two-dimensional packing with conflicts
   Leah Epstein, Asaf Levin, and Rob van Stee
   Acta Informatica 45 (3): 155-175, 2008
   [Download: area_perf_jour_revised.dvi]