The following pages link to Rob van Stee (Q199230):
Displaying 47 items.
- Reordering Buffer Management with Advice (Q3188872) (← links)
- On the online unit clustering problem (Q3188989) (← links)
- Competitive Algorithms for Cottage Rental (Q3439500) (← links)
- Better Algorithms for Online Bin Stretching (Q3453280) (← links)
- Packing Rectangles into 2OPT Bins Using Rotations (Q3512468) (← links)
- On the Price of Stability for Undirected Network Design (Q3558916) (← links)
- On strip packing With rotations (Q3581413) (← links)
- Improved Results for a Memory Allocation Problem (Q3603541) (← links)
- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems (Q3638877) (← links)
- (Q4411382) (← links)
- (Q4411418) (← links)
- (Q4449210) (← links)
- Beating the Harmonic Lower Bound for Online Bin Packing (Q4598179) (← links)
- New Bounds for Variable-Sized Online Bin Packing (Q4706213) (← links)
- (Q4708575) (← links)
- (Q4737166) (← links)
- (Q4737209) (← links)
- (Q4779156) (← links)
- (Q4782742) (← links)
- (Q4828973) (← links)
- TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING (Q5168419) (← links)
- Online Job Admission (Q5192368) (← links)
- A (5/3 + ε)-Approximation for Strip Packing (Q5199266) (← links)
- Algorithm Theory - SWAT 2004 (Q5315392) (← links)
- The optimal absolute ratio for online bin packing (Q5363009) (← links)
- On the Online Unit Clustering Problem (Q5443383) (← links)
- Approximation Schemes for Packing Splittable Items with Cardinality Constraints (Q5443386) (← links)
- Multi-dimensional Packing with Conflicts (Q5444968) (← links)
- Preemptive Scheduling on Selfish Machines (Q5458506) (← links)
- Maximizing the Minimum Load for Selfish Agents (Q5458534) (← links)
- The Price of Anarchy on Uniformly Related Machines Revisited (Q5459971) (← links)
- Algorithms – ESA 2004 (Q5464587) (← links)
- Optimal Online Algorithms for Multidimensional Packing Problems (Q5470698) (← links)
- (Q5501262) (← links)
- Minimizing the total completion time on-line on a single machine, using restarts (Q5711727) (← links)
- Approximation and Online Algorithms (Q5713446) (← links)
- Approximation and Online Algorithms (Q5713448) (← links)
- A Unified Approach to Truthful Scheduling on Related Machines (Q5741799) (← links)
- Paging with Request Sets (Q5757877) (← links)
- Max-min Online Allocations with a Reordering Buffer (Q5895538) (← links)
- Algorithms - ESA 2003 (Q5897260) (← links)
- Approximation and Online Algorithms (Q5898482) (← links)
- Max-min Online Allocations with a Reordering Buffer (Q5901172) (← links)
- Buffer minimization with conflicts on a line (Q5918297) (← links)
- Running a job on a collection of partly available machines, with on-line restarts (Q5941748) (← links)
- Buffer minimization with conflicts on a line (Q5970726) (← links)
- A 10/7-approximation for discrete bamboo garden trimming and continuous trimming on star graphs (Q6663026) (← links)
