The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rob van Stee: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rob van Stee, Johannes A. La Poutré
    Partial servicing of on-line jobs. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:250-261 [Conf]
  2. Leah Epstein, Rob van Stee
    Online scheduling of splittable tasks. [Citation Graph (0, 0)][DBLP]
    Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
  3. Leah Epstein, Rob van Stee
    Minimizing the Maximum Starting Time On-line. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:449-460 [Conf]
  4. Leah Epstein, Rob van Stee
    On Variable-Sized Multidimensional Packing. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:287-298 [Conf]
  5. Alexander Kesselman, Yishay Mansour, Rob van Stee
    Improved Competitive Guarantees for QoS Buffering. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:361-372 [Conf]
  6. Rob van Stee, Johannes A. La Poutré
    Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:872-883 [Conf]
  7. Leah Epstein, Rob van Stee
    Optimal Online Flow Time with Resource Augmentation. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:472-482 [Conf]
  8. Susanne Albers, Rob van Stee
    A Study of Integrated Document and Connection Caching. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:653-667 [Conf]
  9. Marek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
    Preemptive Scheduling in Overloaded Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:800-811 [Conf]
  10. Leah Epstein, Steven S. Seiden, Rob van Stee
    New Bounds for Variable-Sized and Resource Augmented Online Bin Packing. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:306-317 [Conf]
  11. Leah Epstein, Csanád Imreh, Rob van Stee
    More on Weighted Servers or FIFO is Better than LRU. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:257-268 [Conf]
  12. Leah Epstein, Rob van Stee
    Lower Bounds for On-Line Single-Machine Scheduling. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:338-350 [Conf]
  13. Leah Epstein, Rob van Stee
    Optimal online bounded space multidimensional packing. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:214-223 [Conf]
  14. Steven S. Seiden, Rob van Stee
    New bounds for multi-dimensional packing. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:486-495 [Conf]
  15. Klaus Jansen, Rob van Stee
    On strip packing With rotations. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:755-761 [Conf]
  16. Yossi Azar, Leah Epstein, Rob van Stee
    Resource Augmentation in Load Balancing. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:189-199 [Conf]
  17. Leah Epstein, Rob van Stee
    Online Scheduling of Splittable Tasks in Peer-to-Peer Networks. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:408-419 [Conf]
  18. Leah Epstein, Rob van Stee, Tami Tamir
    Paging with Request Sets. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:124-135 [Conf]
  19. Leah Epstein, Rob van Stee
    Online Bin Packing with Resource Augmentation. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:23-35 [Conf]
  20. Leah Epstein, Rob van Stee
    This Side Up! [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:48-60 [Conf]
  21. Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut
    Speed Scaling of Tasks with Precedence Constraints. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:307-319 [Conf]
  22. Leah Epstein, Rob van Stee
    Online square and cube packing. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2005, v:41, n:9, pp:595-606 [Journal]
  23. Rob van Stee, Johannes A. La Poutré
    Running a job on a collection of partly available machines, with on-line restarts. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2001, v:37, n:10, pp:727-742 [Journal]
  24. Alexander Kesselman, Yishay Mansour, Rob van Stee
    Improved Competitive Guarantees for QoS Buffering. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:43, n:1-2, pp:63-80 [Journal]
  25. Steven S. Seiden, Rob van Stee
    New Bounds for Multidimensional Packing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:36, n:3, pp:261-293 [Journal]
  26. Leah Epstein, Rob van Stee
    Optimal on-line flow time with resource augmentation. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:4, pp:611-621 [Journal]
  27. Leah Epstein, Rob van Stee
    Minimizing the maximum starting time on-line. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:195, n:1-2, pp:53-65 [Journal]
  28. Rob van Stee, Johannes A. La Poutré
    Minimizing the total completion time on-line on a single machine, using restarts. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:57, n:2, pp:95-129 [Journal]
  29. Marek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
    Preemptive scheduling in overloaded systems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:1, pp:183-197 [Journal]
  30. Rob van Stee
    An approximation algorithm for square packing. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:6, pp:535-539 [Journal]
  31. 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. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2003, v:6, n:2, pp:131-147 [Journal]
  32. Leah Epstein, Rob van Stee
    Optimal Online Algorithms for Multidimensional Packing Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:431-448 [Journal]
  33. Steven S. Seiden, Rob van Stee, Leah Epstein
    New Bounds for Variable-Sized Online Bin Packing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:2, pp:455-469 [Journal]
  34. Leah Epstein, Rob van Stee
    This side up! [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:2, pp:228-243 [Journal]
  35. Leah Epstein, Rob van Stee
    Online scheduling of splittable tasks. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:1, pp:79-94 [Journal]
  36. Leah Epstein, Csanád Imreh, Rob van Stee
    More on weighted servers or FIFO is better than LRU. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:305-317 [Journal]
  37. Leah Epstein, Rob van Stee
    Lower bounds for on-line single-machine scheduling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:439-450 [Journal]
  38. Tomás Feder, Rajeev Motwani, Rina Panigrahy, Steven S. Seiden, Rob van Stee, An Zhu
    Combining request scheduling with web caching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:201-218 [Journal]
  39. Leah Epstein, Yanir Kleiman, Jiri Sgall, Rob van Stee
    Paging with connections: FIFO strikes again. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:377, n:1-3, pp:55-64 [Journal]
  40. Leah Epstein, Asaf Levin, Rob van Stee
    Multi-dimensional Packing with Conflicts. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:288-299 [Conf]
  41. Leah Epstein, Rob van Stee
    Improved Results for a Memory Allocation Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:362-373 [Conf]
  42. Susanne Albers, Rob van Stee
    A Study of Integrated Document and Connection Caching in the WWW. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:3, pp:239-252 [Journal]
  43. Leah Epstein, Rob van Stee
    Calculating lower bounds for caching problems. [Citation Graph (0, 0)][DBLP]
    Computing, 2007, v:80, n:3, pp:275-285 [Journal]
  44. Leah Epstein, Rob van Stee
    Improved results for a memory allocation problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  45. Leah Epstein, Rob van Stee
    Covering selfish machines [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  46. Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems. [Citation Graph (, )][DBLP]


  47. Preemptive Scheduling on Selfish Machines. [Citation Graph (, )][DBLP]


  48. Maximizing the Minimum Load for Selfisch Agents. [Citation Graph (, )][DBLP]


  49. Max-min Online Allocations with a Reordering Buffer. [Citation Graph (, )][DBLP]


  50. Maximizing the Minimum Load for Selfish Agents. [Citation Graph (, )][DBLP]


  51. Packing Rectangles into 2OPT Bins Using Rotations. [Citation Graph (, )][DBLP]


  52. On the Online Unit Clustering Problem. [Citation Graph (, )][DBLP]


  53. Approximation Schemes for Packing Splittable Items with Cardinality Constraints. [Citation Graph (, )][DBLP]


  54. On the Price of Stability for Undirected Network Design. [Citation Graph (, )][DBLP]


  55. Maximizing the Minimum Load: The Cost of Selfishness. [Citation Graph (, )][DBLP]


  56. The Price of Anarchy on Uniformly Related Machines Revisited. [Citation Graph (, )][DBLP]


  57. Two-dimensional packing with conflicts. [Citation Graph (, )][DBLP]


  58. An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002