- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j41 |      | Peter Sanders, Johannes Singler, Rob van Stee: Real-time integrated prefetching and caching. J. Scheduling 16(1): 47-58 (2013) |
| j40 | | Xujin Chen, Leah Epstein, Elena Kleiman, Rob van Stee: Maximizing the minimum load: The cost of selfishness. Theor. Comput. Sci. 482: 9-19 (2013) |
| c41 | | Leah Epstein, Asaf Levin, Rob van Stee: A unified approach to truthful scheduling on related machines. SODA 2013: 1243-1252 |
| 2012 | ||
| j39 | | Leah Epstein, Asaf Levin, Rob van Stee: Approximation Schemes for Packing Splittable Items with Cardinality Constraints. Algorithmica 62(1-2): 102-129 (2012) |
| j38 | | Leah Epstein, Rob van Stee: The price of anarchy on uniformly related machines revisited. Inf. Comput. 212: 37-54 (2012) |
| j37 | | Rolf Harren, Rob van Stee: Absolute approximation ratios for packing rectangles into bins. J. Scheduling 15(1): 63-75 (2012) |
| j36 | | Rob van Stee: SIGACT news online algorithms column 20: the power of harmony. SIGACT News 43(2): 127-136 (2012) |
| j35 | | Rob van Stee: SIGACT news online algorithms column 21: APPROX and ALGO. SIGACT News 43(4): 123-129 (2012) |
| j34 | | Ho-Leung Chan, Nicole Megow, René Sitters, Rob van Stee: A note on sorting buffers offline. Theor. Comput. Sci. 423: 11-18 (2012) |
| j33 | | Rob van Stee: An improved algorithm for online rectangle filling. Theor. Comput. Sci. 423: 59-74 (2012) |
| c40 | | Leah Epstein, Lukasz Jez, Jiri Sgall, Rob van Stee: Online Scheduling of Jobs with Fixed Start Times on Related Machines. APPROX-RANDOM 2012: 134-145 |
| c39 |  | Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee: A (5/3 + eps)-Approximation for 2D Strip Packing. CTW 2012: 139-142 |
| c38 | | Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, Carola Winzen: The Price of Anarchy for Selfish Ring Routing Is Two. WINE 2012: 420-433 |
| i6 | | Leah Epstein, Asaf Levin, Rob van Stee: A unified approach to truthful scheduling on related machines. CoRR abs/1207.3523 (2012) |
| i5 | | Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, Carola Winzen: The Price of Anarchy for Selfish Ring Routing is Two. CoRR abs/1210.0230 (2012) |
| 2011 | ||
| j32 | | Leah Epstein, Rob van Stee: Improved Results for a Memory Allocation Problem. Theory Comput. Syst. 48(1): 79-92 (2011) |
| j31 | | Leah Epstein, Asaf Levin, Rob van Stee: Max-min Online Allocations with a Reordering Buffer. SIAM J. Discrete Math. 25(3): 1230-1250 (2011) |
| c37 | | Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee: A (5/3 + ε)-Approximation for Strip Packing. WADS 2011: 475-487 |
| 2010 | ||
| j30 | | Leah Epstein, Rob van Stee: On the online unit clustering problem. ACM Transactions on Algorithms 7(1): 7 (2010) |
| j29 | | Leah Epstein, Rob van Stee: Maximizing the minimum load for selfish agents. Theor. Comput. Sci. 411(1): 44-57 (2010) |
| c36 | | Leah Epstein, Asaf Levin, Rob van Stee: Max-min Online Allocations with a Reordering Buffer. ICALP (1) 2010: 336-347 |
| c35 | | |
| c34 | | George Christodoulou, Annamária Kovács, Rob van Stee: A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines. WINE 2010: 182-193 |
| i4 | | Ho-Leung Chan, Nicole Megow, Rob van Stee, René Sitters: The Sorting Buffer Problem is NP-hard. CoRR abs/1009.4355 (2010) |
| 2009 | ||
| j28 | | Leah Epstein, Rob van Stee, Tami Tamir: Paging with Request Sets. Theory Comput. Syst. 44(1): 67-81 (2009) |
| c33 | | Rolf Harren, Rob van Stee: Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems. APPROX-RANDOM 2009: 177-189 |
| c32 | | George Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, Rob van Stee: On the Price of Stability for Undirected Network Design. WAOA 2009: 86-97 |
| c31 | | Leah Epstein, Elena Kleiman, Rob van Stee: Maximizing the Minimum Load: The Cost of Selfishness. WINE 2009: 232-243 |
| i3 | | Rolf Harren, Rob van Stee: An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing. CoRR abs/0903.2265 (2009) |
| 2008 | ||
| j27 | | Leah Epstein, Asaf Levin, Rob van Stee: Two-dimensional packing with conflicts. Acta Inf. 45(3): 155-175 (2008) |
| j26 | | Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut: Speed Scaling of Tasks with Precedence Constraints. Theory Comput. Syst. 43(1): 67-80 (2008) |
| j25 | | Sven Oliver Krumke, Anne Schwahn, Rob van Stee, Stephan Westphal: A monotone approximation algorithm for scheduling with precedence constraints. Oper. Res. Lett. 36(2): 247-249 (2008) |
| j24 | | Leah Epstein, Asaf Levin, Rob van Stee: Online unit clustering: Variations on a theme. Theor. Comput. Sci. 407(1-3): 85-96 (2008) |
| c30 | | |
| c29 | | Leah Epstein, Rob van Stee: The Price of Anarchy on Uniformly Related Machines Revisited. SAGT 2008: 46-57 |
| c28 | | |
| r2 | | |
| r1 | | |
| 2007 | ||
| j23 | | Susanne Albers, Rob van Stee: A Study of Integrated Document and Connection Caching in the WWW. Algorithmica 47(3): 239-252 (2007) |
| j22 | | Leah Epstein, Rob van Stee: Calculating lower bounds for caching problems. Computing 80(3): 275-285 (2007) |
| j21 | | Leah Epstein, Rob van Stee: Bounds for online bounded space hypercube packing. Discrete Optimization 4(2): 185-197 (2007) |
| j20 | | Leah Epstein, Rob van Stee: Online bin packing with resource augmentation. Discrete Optimization 4(3-4): 322-333 (2007) |
| j19 | | Leah Epstein, Yanir Kleiman, Jiri Sgall, Rob van Stee: Paging with connections: FIFO strikes again. Theor. Comput. Sci. 377(1-3): 55-64 (2007) |
| c27 | | |
| c26 | | |
| c25 | | |
| c24 | | |
| c23 | | |
| c22 | | Leah Epstein, Rob van Stee: Approximation Schemes for Packing Splittable Items with Cardinality Constraints. WAOA 2007: 232-245 |
| 2006 | ||
| j18 | | Leah Epstein, Rob van Stee: Optimal on-line flow time with resource augmentation. Discrete Applied Mathematics 154(4): 611-621 (2006) |
| j17 | | Stephan Westphal, Sven Oliver Krumke, Rob van Stee: Competitive Algorithms for Cottage Rental. Electronic Notes in Discrete Mathematics 25: 187-188 (2006) |
| j16 | | Leah Epstein, Rob van Stee: Online scheduling of splittable tasks. ACM Transactions on Algorithms 2(1): 79-94 (2006) |
| j15 | | |
| c21 | | |
| i2 | | |
| i1 | | Leah Epstein, Rob van Stee: Improved results for a memory allocation problem. CoRR abs/cs/0612100 (2006) |
| 2005 | ||
| j14 | | |
| j13 | | Alexander Kesselman, Yishay Mansour, Rob van Stee: Improved Competitive Guarantees for QoS Buffering. Algorithmica 43(1-2): 63-80 (2005) |
| j12 | | Rob van Stee, Johannes A. La Poutré: Minimizing the total completion time on-line on a single machine, using restarts. J. Algorithms 57(2): 95-129 (2005) |
| j11 | | Leah Epstein, Rob van Stee: Optimal Online Algorithms for Multidimensional Packing Problems. SIAM J. Comput. 35(2): 431-448 (2005) |
| c20 | | Leah Epstein, Rob van Stee: Online scheduling of splittable tasks. Algorithms for Optimization with Incomplete Information 2005 |
| c19 | | |
| c18 | | Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut: Speed Scaling of Tasks with Precedence Constraints. WAOA 2005: 307-319 |
| 2004 | ||
| j10 | | Leah Epstein, Rob van Stee: Minimizing the maximum starting time on-line. Inf. Comput. 195(1-2): 53-65 (2004) |
| j9 | | |
| j8 | | Tomás Feder, Rajeev Motwani, Rina Panigrahy, Steven S. Seiden, Rob van Stee, An Zhu: Combining request scheduling with web caching. Theor. Comput. Sci. 324(2-3): 201-218 (2004) |
| c17 | | |
| c16 | | Leah Epstein, Rob van Stee: Optimal online bounded space multidimensional packing. SODA 2004: 214-223 |
| c15 | | Leah Epstein, Rob van Stee: Online Scheduling of Splittable Tasks in Peer-to-Peer Networks. SWAT 2004: 408-419 |
| c14 | | |
| c13 | | |
| 2003 | ||
| j7 | | Steven S. Seiden, Rob van Stee: New Bounds for Multidimensional Packing. Algorithmica 36(3): 261-293 (2003) |
| j6 | | Marek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania: Preemptive scheduling in overloaded systems. J. Comput. Syst. Sci. 67(1): 183-197 (2003) |
| j5 | | Eric Bach, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Tao Jiang, Kim S. Larsen, Guo-Hui Lin, Rob van Stee: Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem. J. Scheduling 6(2): 131-147 (2003) |
| j4 | | Steven S. Seiden, Rob van Stee, Leah Epstein: New Bounds for Variable-Sized Online Bin Packing. SIAM J. Comput. 32(2): 455-469 (2003) |
| j3 | | Leah Epstein, Rob van Stee: Lower bounds for on-line single-machine scheduling. Theor. Comput. Sci. 1-3(299): 439-450 (2003) |
| j2 | | Leah Epstein, Csanád Imreh, Rob van Stee: More on weighted servers or FIFO is better than LRU. Theor. Comput. Sci. 306(1-3): 305-317 (2003) |
| c12 | | Alexander Kesselman, Yishay Mansour, Rob van Stee: Improved Competitive Guarantees for QoS Buffering. ESA 2003: 361-372 |
| c11 | | Susanne Albers, Rob van Stee: A Study of Integrated Document and Connection Caching. ICALP 2003: 653-667 |
| 2002 | ||
| c10 | | |
| c9 | | Rob van Stee, Johannes A. La Poutré: Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts. ESA 2002: 872-883 |
| c8 | | Leah Epstein, Steven S. Seiden, Rob van Stee: New Bounds for Variable-Sized and Resource Augmented Online Bin Packing. ICALP 2002: 306-317 |
| c7 | | Marek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania: Preemptive Scheduling in Overloaded Systems. ICALP 2002: 800-811 |
| c6 | | Leah Epstein, Csanád Imreh, Rob van Stee: More on Weighted Servers or FIFO is Better than LRU. MFCS 2002: 257-268 |
| c5 | | |
| 2001 | ||
| j1 | | Rob van Stee, Johannes A. La Poutré: Running a job on a collection of partly available machines, with on-line restarts. Acta Inf. 37(10): 727-742 (2001) |
| c4 | | |
| c3 | | |
| 2000 | ||
| c2 | | |
| c1 | | |
Colors in the list of coauthors
Last update Fri May 24 01:18:06 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page