| 2009 |
|---|
| 135 | EE | Leah Epstein,
Thomas Erlebach,
Asaf Levin:
Variable Sized Online Interval Coloring with Bandwidth.
Algorithmica 53(3): 385-401 (2009) |
| 134 | EE | Wolfgang W. Bein,
Leah Epstein,
Lawrence L. Larmore,
John Noga:
A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs
CoRR abs/0904.1002: (2009) |
| 133 | EE | Leah Epstein,
Asaf Levin:
Better bounds for minimizing SONET ADMs.
J. Comput. Syst. Sci. 75(2): 122-136 (2009) |
| 2008 |
|---|
| 132 | EE | Leah Epstein,
Elena Kleiman:
Selfish Bin Packing.
ESA 2008: 368-380 |
| 131 | EE | Leah Epstein,
Asaf Levin:
Improved Randomized Results for That Interval Selection Problem.
ESA 2008: 381-392 |
| 130 | EE | Leah Epstein,
Rob van Stee:
Maximizing the Minimum Load for Selfish Agents.
LATIN 2008: 264-275 |
| 129 | EE | Leah Epstein,
Rob van Stee:
The Price of Anarchy on Uniformly Related Machines Revisited.
SAGT 2008: 46-57 |
| 128 | EE | Leah Epstein,
Amos Fiat,
Meital Levy:
Caching Content under Digital Rights Management.
WAOA 2008: 188-200 |
| 127 | EE | Leah Epstein:
List Scheduling.
Encyclopedia of Algorithms 2008 |
| 126 | EE | Leah Epstein:
Load Balancing.
Encyclopedia of Algorithms 2008 |
| 125 | EE | Leah Epstein:
Online Interval Coloring.
Encyclopedia of Algorithms 2008 |
| 124 | EE | Leah Epstein,
Asaf Levin,
Rob van Stee:
Two-dimensional packing with conflicts.
Acta Inf. 45(3): 155-175 (2008) |
| 123 | EE | Leah Epstein,
Asaf Levin:
A PTAS for delay minimization in establishing wireless conference calls.
Discrete Optimization 5(1): 88-96 (2008) |
| 122 | EE | Leah Epstein,
Asaf Levin:
More on online bin packing with two item sizes.
Discrete Optimization 5(4): 705-713 (2008) |
| 121 | EE | György Dósa,
Leah Epstein:
Preemptive scheduling on a small number of hierarchical machines.
Inf. Comput. 206(5): 602-619 (2008) |
| 120 | EE | José R. Correa,
Leah Epstein:
Bin packing with controllable item sizes.
Inf. Comput. 206(8): 1003-1016 (2008) |
| 119 | EE | Leah Epstein,
Asaf Levin:
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing.
Inf. Process. Lett. 109(1): 32-37 (2008) |
| 118 | EE | Orion Chassid,
Leah Epstein:
The hierarchical model for load balancing on two machines.
J. Comb. Optim. 15(4): 305-314 (2008) |
| 117 | EE | Leah Epstein,
Asaf Levin:
An APTAS for Generalized Cost Variable-Sized Bin Packing.
SIAM J. Comput. 38(1): 411-428 (2008) |
| 116 | EE | Leah Epstein,
Meital Levy:
Online interval coloring with packing constraints.
Theor. Comput. Sci. 407(1-3): 203-212 (2008) |
| 115 | EE | Leah Epstein,
Asaf Levin,
Rob van Stee:
Online unit clustering: Variations on a theme.
Theor. Comput. Sci. 407(1-3): 85-96 (2008) |
| 114 | EE | Leah Epstein,
Arik Ganot:
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation.
Theory Comput. Syst. 42(4): 431-449 (2008) |
| 2007 |
|---|
| 113 | EE | Leah Epstein,
Rob van Stee:
Preemptive Scheduling on Selfish Machines.
CAAN 2007: 57-70 |
| 112 | EE | Leah Epstein,
Thomas Erlebach,
Asaf Levin:
Online Capacitated Interval Coloring.
ESCAPE 2007: 243-254 |
| 111 | EE | Leah Epstein,
Asaf Levin,
Rob van Stee:
Multi-dimensional Packing with Conflicts.
FCT 2007: 288-299 |
| 110 | EE | Leah Epstein:
Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy.
Fair Division 2007 |
| 109 | EE | Leah Epstein,
Rob van Stee:
Maximizing the Minimum Load for Selfisch Agents.
Fair Division 2007 |
| 108 | EE | Leah Epstein,
Rob van Stee:
Improved Results for a Memory Allocation Problem.
WADS 2007: 362-373 |
| 107 | EE | Leah Epstein,
Asaf Levin:
On the Max Coloring Problem.
WAOA 2007: 142-155 |
| 106 | EE | Leah Epstein,
Rob van Stee:
On the Online Unit Clustering Problem.
WAOA 2007: 193-206 |
| 105 | EE | Leah Epstein,
Asaf Levin:
Minimum Weighted Sum Bin Packing.
WAOA 2007: 218-231 |
| 104 | EE | Leah Epstein,
Rob van Stee:
Approximation Schemes for Packing Splittable Items with Cardinality Constraints.
WAOA 2007: 232-245 |
| 103 | EE | Leah Epstein,
Asaf Levin:
SONET ADMs Minimization with Divisible Paths.
Algorithmica 49(1): 51-68 (2007) |
| 102 | EE | Leah Epstein,
Rob van Stee:
Calculating lower bounds for caching problems.
Computing 80(3): 275-285 (2007) |
| 101 | EE | Leah Epstein,
Rob van Stee:
Bounds for online bounded space hypercube packing.
Discrete Optimization 4(2): 185-197 (2007) |
| 100 | EE | Leah Epstein,
Rob van Stee:
Online bin packing with resource augmentation.
Discrete Optimization 4(3-4): 322-333 (2007) |
| 99 | EE | Leah Epstein,
Deshi Ye:
Semi-online scheduling with "end of sequence" information.
J. Comb. Optim. 14(1): 45-61 (2007) |
| 98 | 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 |
|---|
| 97 | EE | Leah Epstein,
Magnús M. Halldórsson,
Asaf Levin,
Hadas Shachnai:
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs.
APPROX-RANDOM 2006: 116-127 |
| 96 | EE | Leah Epstein,
Asaf Levin,
Gerhard J. Woeginger:
Graph Coloring with Rejection.
ESA 2006: 364-375 |
| 95 | EE | Leah Epstein,
Asaf Levin:
A Robust APTAS for the Classical Bin Packing Problem.
ICALP (1) 2006: 214-225 |
| 94 | EE | Hagit Attiya,
Leah Epstein,
Hadas Shachnai,
Tami Tamir:
Transactional contention management as a non-clairvoyant scheduling problem.
PODC 2006: 308-315 |
| 93 | EE | Leah Epstein,
Rob van Stee,
Tami Tamir:
Paging with Request Sets.
SWAT 2006: 124-135 |
| 92 | EE | Leah Epstein,
Thomas Erlebach,
Asaf Levin:
Variable Sized Online Interval Coloring with Bandwidth.
SWAT 2006: 29-40 |
| 91 | EE | Leah Epstein:
Bin Packing with Rejection Revisited.
WAOA 2006: 146-159 |
| 90 | EE | Leah Epstein,
Asaf Levin:
On Bin Packing with Conflicts.
WAOA 2006: 160-173 |
| 89 | EE | Leah Epstein,
Rob van Stee:
Online scheduling of splittable tasks.
ACM Transactions on Algorithms 2(1): 79-94 (2006) |
| 88 | EE | Leah Epstein,
Rob van Stee:
This side up!
ACM Transactions on Algorithms 2(2): 228-243 (2006) |
| 87 | EE | Leah Epstein,
Tamir Tassa:
Vector assignment schemes for asymmetric settings.
Acta Inf. 42(6-7): 501-514 (2006) |
| 86 | EE | Leah Epstein,
Rob van Stee:
Covering selfish machines
CoRR abs/cs/0610026: (2006) |
| 85 | EE | Leah Epstein,
Rob van Stee:
Improved results for a memory allocation problem
CoRR abs/cs/0612100: (2006) |
| 84 | EE | Leah Epstein,
Rob van Stee:
Optimal on-line flow time with resource augmentation.
Discrete Applied Mathematics 154(4): 611-621 (2006) |
| 83 | EE | Leah Epstein,
Lene M. Favrholdt,
Jens S. Kohrt:
Separating online scheduling algorithms with the relative worst order ratio.
J. Comb. Optim. 12(4): 363-386 (2006) |
| 82 | EE | Leah Epstein,
Tamir Tassa:
Optimal preemptive scheduling for general target functions.
J. Comput. Syst. Sci. 72(1): 132-162 (2006) |
| 81 | EE | Leah Epstein:
Online Bin Packing with Cardinality Constraints.
SIAM J. Discrete Math. 20(4): 1015-1030 (2006) |
| 80 | EE | Leah Epstein,
Asaf Levin:
The conference call search problem in wireless networks.
Theor. Comput. Sci. 359(1-3): 418-429 (2006) |
| 79 | EE | Yossi Azar,
Amir Epstein,
Leah Epstein:
Load balancing of temporary tasks in the lp norm.
Theor. Comput. Sci. 361(2-3): 314-328 (2006) |
| 78 | EE | Joan Boyar,
Leah Epstein,
Lene M. Favrholdt,
Jens S. Kohrt,
Kim S. Larsen,
Morten Monrad Pedersen,
Sanne Wøhlk:
The maximum resource bin packing problem.
Theor. Comput. Sci. 362(1-3): 127-139 (2006) |
| 77 | EE | Leah Epstein,
Alexander Kesselman:
On the remote server problem or more about TCP acknowledgments.
Theor. Comput. Sci. 369(1-3): 285-299 (2006) |
| 2005 |
|---|
| 76 | EE | Leah Epstein,
Rob van Stee:
Online scheduling of splittable tasks.
Algorithms for Optimization with Incomplete Information 2005 |
| 75 | EE | Leah Epstein,
Asaf Levin:
Tracking mobile users.
Algorithms for Optimization with Incomplete Information 2005 |
| 74 | EE | Leah Epstein:
Online Bin Packing with Cardinality Constraints.
ESA 2005: 604-615 |
| 73 | EE | Joan Boyar,
Leah Epstein,
Lene M. Favrholdt,
Jens S. Kohrt,
Kim S. Larsen,
Morten Monrad Pedersen,
Sanne Wøhlk:
The Maximum Resource Bin Packing Problem.
FCT 2005: 397-408 |
| 72 | EE | Leah Epstein,
Meital Levy:
Online Interval Coloring and Variants.
ICALP 2005: 602-613 |
| 71 | EE | Leah Epstein,
Meital Levy:
Online Interval Coloring with Packing Constraints.
MFCS 2005: 295-307 |
| 70 | EE | Leah Epstein,
Asaf Levin:
SONET ADMs Minimization with Divisible Paths.
WAOA 2005: 119-132 |
| 69 | EE | Leah Epstein,
Asaf Levin:
The Conference Call Search Problem in Wireless Networks.
WAOA 2005: 133-146 |
| 68 | EE | Leah Epstein,
Rob van Stee:
Online square and cube packing.
Acta Inf. 41(9): 595-606 (2005) |
| 67 | EE | Leah Epstein:
Tight bounds for bandwidth allocation on two links.
Discrete Applied Mathematics 148(2): 181-188 (2005) |
| 66 | EE | Zhiyi Tan,
Yong He,
Leah Epstein:
Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data.
Inf. Comput. 196(1): 57-70 (2005) |
| 65 | EE | Leah Epstein,
Lene M. Favrholdt:
Optimal non-preemptive semi-online scheduling on two related machines.
J. Algorithms 57(1): 49-73 (2005) |
| 64 | EE | Leah Epstein,
Rob van Stee:
Optimal Online Algorithms for Multidimensional Packing Problems.
SIAM J. Comput. 35(2): 431-448 (2005) |
| 63 | EE | Leah Epstein,
Asaf Levin:
The chord version for SONET ADMs minimization.
Theor. Comput. Sci. 349(3): 337-346 (2005) |
| 2004 |
|---|
| 62 | EE | Leah Epstein,
Rob van Stee:
On Variable-Sized Multidimensional Packing.
ESA 2004: 287-298 |
| 61 | EE | Leah Epstein,
Tamir Tassa:
Optimal Preemptive Scheduling for General Target Functions.
MFCS 2004: 562-573 |
| 60 | EE | Anat Bremler-Barr,
Leah Epstein:
Path Layout on Tree Networks: Bounds in Different Label Switching Models.
SIROCCO 2004: 35-46 |
| 59 | EE | Leah Epstein,
Rob van Stee:
Optimal online bounded space multidimensional packing.
SODA 2004: 214-223 |
| 58 | EE | Leah Epstein,
Rob van Stee:
Online Scheduling of Splittable Tasks in Peer-to-Peer Networks.
SWAT 2004: 408-419 |
| 57 | EE | Wolfgang W. Bein,
Leah Epstein,
Lawrence L. Larmore,
John Noga:
Optimally Competitive List Batching.
SWAT 2004: 77-89 |
| 56 | EE | Leah Epstein,
Rob van Stee:
Online Bin Packing with Resource Augmentation.
WAOA 2004: 23-35 |
| 55 | EE | Leah Epstein,
Asaf Levin:
Better Bounds for Minimizing SONET ADMs.
WAOA 2004: 281-294 |
| 54 | EE | Leah Epstein,
Asaf Levin:
A PTAS for Delay Minimization in Establishing Wireless Conference Calls.
WAOA 2004: 36-47 |
| 53 | EE | Leah Epstein,
Rob van Stee:
This Side Up!
WAOA 2004: 48-60 |
| 52 | EE | Leah Epstein,
Tamir Tassa:
Approximation schemes for the Min-Max Starting Time Problem.
Acta Inf. 40(9): 657-674 (2004) |
| 51 | EE | Leah Epstein,
Jiri Sgall:
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines.
Algorithmica 39(1): 43-57 (2004) |
| 50 | EE | Leah Epstein,
Rob van Stee:
Minimizing the maximum starting time on-line.
Inf. Comput. 195(1-2): 53-65 (2004) |
| 49 | EE | Yossi Azar,
Leah Epstein,
Yossi Richter,
Gerhard J. Woeginger:
All-norm approximation algorithms.
J. Algorithms 52(2): 120-133 (2004) |
| 48 | EE | Yossi Azar,
Leah Epstein:
On-Line Load Balancing of Temporary Tasks on Identical Machines.
SIAM J. Discrete Math. 18(2): 347-352 (2004) |
| 2003 |
|---|
| 47 | EE | Leah Epstein:
Two Dimensional Packing: The Power of Rotation.
MFCS 2003: 398-407 |
| 46 | EE | Leah Epstein,
Tamir Tassa:
Approximation Schemes for the Min-Max Starting Time Problem.
MFCS 2003: 408-418 |
| 45 | EE | Leah Epstein,
Arik Ganot:
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation.
WAOA 2003: 109-122 |
| 44 | EE | Yossi Azar,
Amir Epstein,
Leah Epstein:
Load Balancing of Temporary Tasks in the lp Norm.
WAOA 2003: 53-66 |
| 43 | EE | Leah Epstein:
On variable sized vector packing.
Acta Cybern. 16(1): 47-56 (2003) |
| 42 | EE | Leah Epstein,
Lene M. Favrholdt:
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.
Acta Cybern. 16(1): 57-66 (2003) |
| 41 | EE | Leah Epstein:
Bin stretching revisited.
Acta Inf. 39(2): 97-117 (2003) |
| 40 | EE | Amitai Armon,
Yossi Azar,
Leah Epstein:
Temporary Tasks Assignment Resolved.
Algorithmica 36(3): 295-314 (2003) |
| 39 | EE | Amitai Armon,
Yossi Azar,
Leah Epstein,
Oded Regev:
On-line restricted assignment of temporary tasks with unknown durations.
Inf. Process. Lett. 85(2): 67-72 (2003) |
| 38 | EE | Leah Epstein,
Tamir Tassa:
Vector assignment problems: a general framework.
J. Algorithms 48(2): 360-384 (2003) |
| 37 | 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) |
| 36 | | 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) |
| 35 | 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) |
| 34 | EE | Leah Epstein,
Rob van Stee:
Lower bounds for on-line single-machine scheduling.
Theor. Comput. Sci. 1-3(299): 439-450 (2003) |
| 33 | 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 |
|---|
| 32 | EE | Leah Epstein,
Lene M. Favrholdt:
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.
COCOON 2002: 467-475 |
| 31 | EE | Leah Epstein,
Rob van Stee:
Minimizing the Maximum Starting Time On-line.
ESA 2002: 449-460 |
| 30 | EE | Leah Epstein,
Tamir Tassa:
Vector Assignment Problems: A General Framework.
ESA 2002: 461-472 |
| 29 | EE | Leah Epstein,
Steven S. Seiden,
Rob van Stee:
New Bounds for Variable-Sized and Resource Augmented Online Bin Packing.
ICALP 2002: 306-317 |
| 28 | 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 |
| 27 | EE | Leah Epstein,
Lene M. Favrholdt:
Optimal Non-preemptive Semi-online Scheduling on Two Related Machines.
MFCS 2002: 245-256 |
| 26 | EE | Leah Epstein,
Csanád Imreh,
Rob van Stee:
More on Weighted Servers or FIFO is Better than LRU.
MFCS 2002: 257-268 |
| 25 | EE | Amitai Armon,
Yossi Azar,
Leah Epstein,
Oded Regev:
Temporary tasks assignment resolved.
SODA 2002: 116-124 |
| 24 | EE | Yossi Azar,
Leah Epstein,
Yossi Richter,
Gerhard J. Woeginger:
All-Norm Approximation Algorithms.
SWAT 2002: 288-297 |
| 23 | EE | Yossi Azar,
Joan Boyar,
Lene M. Favrholdt,
Kim S. Larsen,
Morten N. Nielsen,
Leah Epstein:
Fair versus Unrestricted Bin Packing.
Algorithmica 34(2): 181-196 (2002) |
| 22 | | Yossi Azar,
Leah Epstein:
On-line scheduling with precedence constraints.
Discrete Applied Mathematics 119(1-2): 169-180 (2002) |
| 21 | EE | Leah Epstein,
Lene M. Favrholdt:
Optimal preemptive semi-online scheduling to minimize makespan on two related machines.
Oper. Res. Lett. 30(4): 269-275 (2002) |
| 20 | EE | Leah Epstein,
John Noga,
Gerhard J. Woeginger:
On-line scheduling of unit time jobs with rejection: minimizing the total completion time.
Oper. Res. Lett. 30(6): 415-420 (2002) |
| 2001 |
|---|
| 19 | EE | Leah Epstein:
On-Line Variable Sized Covering.
COCOON 2001: 463-472 |
| 18 | EE | Leah Epstein,
Rob van Stee:
Optimal Online Flow Time with Resource Augmentation.
FCT 2001: 472-482 |
| 17 | EE | Leah Epstein,
Rob van Stee:
Lower Bounds for On-Line Single-Machine Scheduling.
MFCS 2001: 338-350 |
| 16 | EE | Leah Epstein:
Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios.
STACS 2001: 230-237 |
| 15 | EE | Leah Epstein:
Online Variable Sized Covering.
Inf. Comput. 171(2): 294-305 (2001) |
| 14 | EE | Leah Epstein:
Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios.
Oper. Res. Lett. 29(2): 93-98 (2001) |
| 2000 |
|---|
| 13 | EE | Yossi Azar,
Leah Epstein:
On-Line Scheduling with Precedence Constraints.
SWAT 2000: 164-174 |
| 12 | EE | Yossi Azar,
Leah Epstein,
Rob van Stee:
Resource Augmentation in Load Balancing.
SWAT 2000: 189-199 |
| 11 | EE | Leah Epstein:
A note on on-line scheduling with precedence constraints on identical machines.
Inf. Process. Lett. 76(4-6): 149-153 (2000) |
| 10 | EE | Leah Epstein,
Jiri Sgall:
A lower bound for on-line scheduling on uniformly related machines.
Oper. Res. Lett. 26(1): 17-22 (2000) |
| 1999 |
|---|
| 9 | EE | Leah Epstein,
Jiri Sgall:
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines.
ESA 1999: 151-162 |
| 8 | EE | Leah Epstein,
John Noga,
Steven S. Seiden,
Jiri Sgall,
Gerhard J. Woeginger:
Randomized Online Scheduling on Two Uniform Machines.
SODA 1999: 317-326 |
| 1998 |
|---|
| 7 | EE | Yossi Azar,
Leah Epstein:
Approximation Schemes for Covering and Scheduling on Related Machines.
APPROX 1998: 39-47 |
| 6 | EE | Leah Epstein:
Lower Bounds for On-line Scheduling with Precedence Constraints on Identical Machines.
APPROX 1998: 89-98 |
| 5 | | Noga Alon,
Yossi Azar,
János Csirik,
Leah Epstein,
Sergey V. Sevastianov,
Arjen P. A. Vestjens,
Gerhard J. Woeginger:
On-Line and Off-Line Approximation Algorithms for Vector Covering Problems.
Algorithmica 21(1): 104-118 (1998) |
| 1997 |
|---|
| 4 | | Yossi Azar,
Leah Epstein:
On-Line Machine Covering.
ESA 1997: 23-36 |
| 3 | EE | Yossi Azar,
Leah Epstein:
On-Line Load Balancing of Temporary Tasks on Identical Machines.
ISTCS 1997: 119-125 |
| 2 | | Yossi Azar,
Leah Epstein:
On Two Dimensional Packing.
J. Algorithms 25(2): 290-310 (1997) |
| 1996 |
|---|
| 1 | | Yossi Azar,
Leah Epstein:
On Two Dimensional Packing.
SWAT 1996: 321-332 |
