- Online Interval Coloring and Variants Leah Epstein1, and Meital Levy2
- Preemptive online scheduling with reordering Gyorgy Dosa
- Randomized algorithms for online bounded bidding Leah Epstein
- Approximation Schemes for the Min-Max Starting Time Problem
- Optimal Online Bounded Space Multidimensional Packing Leah Epstein # Rob van Stee +
- Path layout on tree networks: Bounds in different label switching models
- Preemptive Scheduling in Overloaded Marek Chrobak a;1;4 , Leah Epstein b;2 , John Noga c ,
- Bin packing with rejection revisited Leah Epstein
- The Maximum Resource Bin Packing Problem Joan Boyar 1
- Optimal On-line Algorithms for the Uniform Machine Scheduling Problem with Ordinal Data
- BIN PACKING WITH CONTROLLABLE ITEM SIZES JOSE R. CORREA
- Resource Augmentation in Load Balancing Yossi Azar y Leah Epstein z Rob van Stee x
- Online Scheduling with Precedence Constraints \Lambda
- Optimal Preemptive Semi-Online Scheduling to Minimize Makespan on Two Related Machines
- Lower Bounds for Online Scheduling with Precedence Constraints on Identical
- Load balancing of temporary tasks in the p Yossi Azar a,1
- SONET ADMs Minimization with Divisible Leah Epstein 1,# and Asaf Levin 2
- The price of anarchy on uniformly related machines revisited Leah Epstein Rob van Stee
- On the online unit clustering problem Leah Epstein
- Tight Bounds on the Competitive Ratio on Accommodating Sequences
- OnLine Maximizing the Number of Items Packed in VariableSized Bins
- Separating Online Scheduling Algorithms with the Relative Worst Order Leah Epstein1, Lene M. Favrholdt2, and Jens S. Kohrt2
- Resource augmented semi-online bounded space bin packing Leah Epstein
- Minimization of SONET ADMs in ring networks revisited Leah Epstein
- Comparing Online Algorithms for Bin Packing Problems Leah Epstein1, Lene M. Favrholdt2, and Jens S. Kohrt2
- On online bin packing with LIB constraints Leah Epstein
- Selfish Bin Packing Leah Epstein1
- Preemptive scheduling on a small number of hierarchical machines Gyorgy Dosa
- Online scheduling with a buffer on related machines Gyorgy Dosa
- More on online bin packing with two item sizes Leah Epstein
- Preemptive scheduling on selfish machines Leah Epstein1 and Rob van Stee2
- Improved results for a memory allocation problem Leah Epstein
- The hierarchical model for load balancing on two machines Orion Chassid
- Semi-online scheduling with "end of sequence" information Leah Epstein
- Paging with connections: FIFO strikes again Leah Epstein
- Paging with Request Sets Leah Epstein1
- Variable Sized Online Interval Coloring with Leah Epstein1
- Transactional Contention Management as a Non-Clairvoyant Scheduling Problem
- On bin packing with conflicts Leah Epstein1
- Online Bin Packing with Cardinality Constraints Leah Epstein
- Online Interval Coloring with Packing Constraints Leah Epstein1, and Meital Levy2
- Better bounds for minimizing SONET ADMs Leah Epstein
- Bounds for online bounded space hypercube packing Leah Epstein
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation
- Operations Research Letters 30 (2002) 415420 www.elsevier.com/locate/dsw
- On the Max Coloring Problem Leah Epstein
- A Lower Bound for OnLine Scheduling on Uniformly Related Machines
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
- Randomized Online Scheduling on Two Uniform Machines Leah Epstein \Lambda John Noga y Steve Seiden z Jir'i Sgall x Gerhard Woeginger z
- Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs Leah Epstein
- Optimal Preemptive Scheduling for General Target Functions Leah Epstein
- A Robust APTAS for the Classical Bin Packing Problem
- Online unit clustering: variations on a theme Leah Epstein
- This Side Up! Leah Epstein1,
- Calculating lower bounds for caching problems Leah Epstein
- Tight results for Next Fit and Worst Fit with resource augmentation Joan Boyar
- Improved randomized results for that interval selection Leah Epstein
- Two dimensional packing: the power of rotation Leah Epstein y
- On-line Variable Sized Covering Leah Epstein
- The Conference Call Search Problem in Wireless Networks Leah Epstein1, and Asaf Levin2
- On the Remote Server Problem More about TCP Acknowledgments
- Two-dimensional packing with conflicts Leah Epstein
- Bin Stretching Revisited Leah Epstein
- On variable sized vector packing Leah Epstein
- Optimal Non-Preemptive Semi-Online Scheduling on Two Related Machines
- Online Bin Packing with Resource Augmentation Leah Epstein
- Maximizing the Minimum Load for Selfish Agents Leah Epstein
- Graph Coloring with Rejection Leah Epstein
- Online Capacitated Interval Coloring Leah Epstein1
- Lower bounds for on-line single-machine scheduling
- Fair versus Unrestricted Bin Packing Yossi Azar y Joan Boyar z Leah Epstein x
- Semi-online machine covering for two uniform machines Xingyu Chen
- Graph Based Vector Assignment Schemes Leah Epstein
- Optimal On-line Flow Time with Resource Augmentation
- Online Square and Cube Packing Leah Epstein
- Optimal Online Algorithms for Multidimensional Packing Problems
- Vector Assignment Problems: A General Framework Leah Epstein Tamir Tassa
- Tight Bounds for Online Bandwidth Allocation on Two Links
- A PTAS for Delay Minimization Establishing Wireless Conference Calls
- Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
- On the sum minimization version of the online bin covering Janos Csirik1, Leah Epstein2, Csanad Imreh1 and Asaf Levin3
- The chord version for SONET ADMs minimization Leah Epstein Asaf Levin y
- An APTAS for generalized cost variable sized bin packing Leah Epstein
- Bin packing with general cost structures Leah Epstein
