| 2009 |
|---|
| 62 | EE | Rolf Harren,
Rob van Stee:
An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing
CoRR abs/0903.2265: (2009) |
| 2008 |
|---|
| 61 | EE | Leah Epstein,
Rob van Stee:
Maximizing the Minimum Load for Selfish Agents.
LATIN 2008: 264-275 |
| 60 | EE | Leah Epstein,
Rob van Stee:
The Price of Anarchy on Uniformly Related Machines Revisited.
SAGT 2008: 46-57 |
| 59 | EE | Rolf Harren,
Rob van Stee:
Packing Rectangles into 2OPT Bins Using Rotations.
SWAT 2008: 306-318 |
| 58 | EE | Rob van Stee:
Packet Switching in Single Buffer.
Encyclopedia of Algorithms 2008 |
| 57 | EE | Rob van Stee:
Paging.
Encyclopedia of Algorithms 2008 |
| 56 | EE | Leah Epstein,
Asaf Levin,
Rob van Stee:
Two-dimensional packing with conflicts.
Acta Inf. 45(3): 155-175 (2008) |
| 55 | EE | 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) |
| 54 | EE | Leah Epstein,
Asaf Levin,
Rob van Stee:
Online unit clustering: Variations on a theme.
Theor. Comput. Sci. 407(1-3): 85-96 (2008) |
| 53 | EE | Kirk Pruhs,
Rob van Stee,
Patchrawat Uthaisombut:
Speed Scaling of Tasks with Precedence Constraints.
Theory Comput. Syst. 43(1): 67-80 (2008) |
| 2007 |
|---|
| 52 | EE | Leah Epstein,
Rob van Stee:
Preemptive Scheduling on Selfish Machines.
CAAN 2007: 57-70 |
| 51 | EE | Leah Epstein,
Asaf Levin,
Rob van Stee:
Multi-dimensional Packing with Conflicts.
FCT 2007: 288-299 |
| 50 | EE | Leah Epstein,
Rob van Stee:
Maximizing the Minimum Load for Selfisch Agents.
Fair Division 2007 |
| 49 | EE | Leah Epstein,
Rob van Stee:
Improved Results for a Memory Allocation Problem.
WADS 2007: 362-373 |
| 48 | EE | Leah Epstein,
Rob van Stee:
On the Online Unit Clustering Problem.
WAOA 2007: 193-206 |
| 47 | EE | Leah Epstein,
Rob van Stee:
Approximation Schemes for Packing Splittable Items with Cardinality Constraints.
WAOA 2007: 232-245 |
| 46 | EE | Susanne Albers,
Rob van Stee:
A Study of Integrated Document and Connection Caching in the WWW.
Algorithmica 47(3): 239-252 (2007) |
| 45 | EE | Leah Epstein,
Rob van Stee:
Calculating lower bounds for caching problems.
Computing 80(3): 275-285 (2007) |
| 44 | EE | Leah Epstein,
Rob van Stee:
Bounds for online bounded space hypercube packing.
Discrete Optimization 4(2): 185-197 (2007) |
| 43 | EE | Leah Epstein,
Rob van Stee:
Online bin packing with resource augmentation.
Discrete Optimization 4(3-4): 322-333 (2007) |
| 42 | EE | Leah Epstein,
Yanir Kleiman,
Jiri Sgall,
Rob van Stee:
Paging with connections: FIFO strikes again.
Theor. Comput. Sci. 377(1-3): 55-64 (2007) |
| 2006 |
|---|
| 41 | EE | Leah Epstein,
Rob van Stee,
Tami Tamir:
Paging with Request Sets.
SWAT 2006: 124-135 |
| 40 | EE | Leah Epstein,
Rob van Stee:
Online scheduling of splittable tasks.
ACM Transactions on Algorithms 2(1): 79-94 (2006) |
| 39 | EE | Leah Epstein,
Rob van Stee:
This side up!
ACM Transactions on Algorithms 2(2): 228-243 (2006) |
| 38 | EE | Leah Epstein,
Rob van Stee:
Covering selfish machines
CoRR abs/cs/0610026: (2006) |
| 37 | EE | Leah Epstein,
Rob van Stee:
Improved results for a memory allocation problem
CoRR abs/cs/0612100: (2006) |
| 36 | EE | Leah Epstein,
Rob van Stee:
Optimal on-line flow time with resource augmentation.
Discrete Applied Mathematics 154(4): 611-621 (2006) |
| 35 | EE | Stephan Westphal,
Sven Oliver Krumke,
Rob van Stee:
Competitive Algorithms for Cottage Rental.
Electronic Notes in Discrete Mathematics 25: 187-188 (2006) |
| 2005 |
|---|
| 34 | EE | Leah Epstein,
Rob van Stee:
Online scheduling of splittable tasks.
Algorithms for Optimization with Incomplete Information 2005 |
| 33 | EE | Klaus Jansen,
Rob van Stee:
On strip packing With rotations.
STOC 2005: 755-761 |
| 32 | EE | Kirk Pruhs,
Rob van Stee,
Patchrawat Uthaisombut:
Speed Scaling of Tasks with Precedence Constraints.
WAOA 2005: 307-319 |
| 31 | EE | Leah Epstein,
Rob van Stee:
Online square and cube packing.
Acta Inf. 41(9): 595-606 (2005) |
| 30 | EE | Alexander Kesselman,
Yishay Mansour,
Rob van Stee:
Improved Competitive Guarantees for QoS Buffering.
Algorithmica 43(1-2): 63-80 (2005) |
| 29 | EE | 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) |
| 28 | EE | Leah Epstein,
Rob van Stee:
Optimal Online Algorithms for Multidimensional Packing Problems.
SIAM J. Comput. 35(2): 431-448 (2005) |
| 2004 |
|---|
| 27 | EE | Leah Epstein,
Rob van Stee:
On Variable-Sized Multidimensional Packing.
ESA 2004: 287-298 |
| 26 | EE | Leah Epstein,
Rob van Stee:
Optimal online bounded space multidimensional packing.
SODA 2004: 214-223 |
| 25 | EE | Leah Epstein,
Rob van Stee:
Online Scheduling of Splittable Tasks in Peer-to-Peer Networks.
SWAT 2004: 408-419 |
| 24 | EE | Leah Epstein,
Rob van Stee:
Online Bin Packing with Resource Augmentation.
WAOA 2004: 23-35 |
| 23 | EE | Leah Epstein,
Rob van Stee:
This Side Up!
WAOA 2004: 48-60 |
| 22 | EE | Leah Epstein,
Rob van Stee:
Minimizing the maximum starting time on-line.
Inf. Comput. 195(1-2): 53-65 (2004) |
| 21 | EE | Rob van Stee:
An approximation algorithm for square packing.
Oper. Res. Lett. 32(6): 535-539 (2004) |
| 20 | EE | 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) |
| 2003 |
|---|
| 19 | EE | Alexander Kesselman,
Yishay Mansour,
Rob van Stee:
Improved Competitive Guarantees for QoS Buffering.
ESA 2003: 361-372 |
| 18 | EE | Susanne Albers,
Rob van Stee:
A Study of Integrated Document and Connection Caching.
ICALP 2003: 653-667 |
| 17 | EE | Steven S. Seiden,
Rob van Stee:
New Bounds for Multidimensional Packing.
Algorithmica 36(3): 261-293 (2003) |
| 16 | EE | 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) |
| 15 | | 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) |
| 14 | EE | Steven S. Seiden,
Rob van Stee,
Leah Epstein:
New Bounds for Variable-Sized Online Bin Packing.
SIAM J. Comput. 32(2): 455-469 (2003) |
| 13 | EE | Leah Epstein,
Rob van Stee:
Lower bounds for on-line single-machine scheduling.
Theor. Comput. Sci. 1-3(299): 439-450 (2003) |
| 12 | EE | 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) |
| 2002 |
|---|
| 11 | EE | Leah Epstein,
Rob van Stee:
Minimizing the Maximum Starting Time On-line.
ESA 2002: 449-460 |
| 10 | EE | Rob van Stee,
Johannes A. La Poutré:
Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts.
ESA 2002: 872-883 |
| 9 | EE | Leah Epstein,
Steven S. Seiden,
Rob van Stee:
New Bounds for Variable-Sized and Resource Augmented Online Bin Packing.
ICALP 2002: 306-317 |
| 8 | EE | 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 |
| 7 | EE | Leah Epstein,
Csanád Imreh,
Rob van Stee:
More on Weighted Servers or FIFO is Better than LRU.
MFCS 2002: 257-268 |
| 6 | EE | Steven S. Seiden,
Rob van Stee:
New bounds for multi-dimensional packing.
SODA 2002: 486-495 |
| 2001 |
|---|
| 5 | EE | Leah Epstein,
Rob van Stee:
Optimal Online Flow Time with Resource Augmentation.
FCT 2001: 472-482 |
| 4 | EE | Leah Epstein,
Rob van Stee:
Lower Bounds for On-Line Single-Machine Scheduling.
MFCS 2001: 338-350 |
| 3 | EE | 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) |
| 2000 |
|---|
| 2 | EE | Rob van Stee,
Johannes A. La Poutré:
Partial servicing of on-line jobs.
APPROX 2000: 250-261 |
| 1 | EE | Yossi Azar,
Leah Epstein,
Rob van Stee:
Resource Augmentation in Load Balancing.
SWAT 2000: 189-199 |
