Leah Epstein

	2012
192		Leah Epstein, Asaf Levin, Rob van Stee: Approximation Schemes for Packing Splittable Items with Cardinality Constraints. Algorithmica 62(1-2): 102-129 (2012)
191		Leah Epstein, Asaf Levin: On Equilibria for ADM Minimization Games. Algorithmica 63(1-2): 246-273 (2012)
190		Leah Epstein, Asaf Levin: An efficient polynomial time approximation scheme for load balancing on uniformly related machines CoRR abs/1202.4072: (2012)
189		György Dósa, Leah Epstein: Generalized selfish bin packing CoRR abs/1202.4080: (2012)
188		Leah Epstein, Rob van Stee: The price of anarchy on uniformly related machines revisited. Inf. Comput. 212: 37-54 (2012)
187		Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt: Comparing online algorithms for bin packing problems. J. Scheduling 15(1): 13-21 (2012)
186		Leah Epstein, Asaf Levin: Bin packing with general cost structures. Math. Program. 132(1-2): 355-391 (2012)
	2011
185		Leah Epstein, Elena Kleiman: On the quality and complexity of pareto equilibria in the job scheduling game. AAMAS 2011: 525-532
184		Leah Epstein, Asaf Levin: Robust Algorithms for Preemptive Scheduling. ESA 2011: 567-578
183		Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György: On Variants of File Caching. ICALP (1) 2011: 195-206
182		Leah Epstein, Elena Kleiman: Selfish Bin Packing. Algorithmica 60(2): 368-394 (2011)
181		Leah Epstein, Lene M. Favrholdt, Asaf Levin: Online variable-sized bin packing with conflicts. Discrete Optimization 8(2): 333-343 (2011)
180		Leah Epstein, Sven Oliver Krumke, Asaf Levin, Heike Sperber: Selfish bin coloring. J. Comb. Optim. 22(4): 531-548 (2011)
179		Leah Epstein, Asaf Levin, Gerhard J. Woeginger: Graph coloring with rejection. J. Comput. Syst. Sci. 77(2): 439-447 (2011)
178		György Dósa, Leah Epstein: Preemptive Online Scheduling with Reordering. SIAM J. Discrete Math. 25(1): 21-49 (2011)
177		Leah Epstein, Asaf Levin, Rob van Stee: Max-min Online Allocations with a Reordering Buffer. SIAM J. Discrete Math. 25(3): 1230-1250 (2011)
176		Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev: Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model. SIAM J. Discrete Math. 25(3): 1251-1265 (2011)
175		Leah Epstein, Hanan Zebedat-Haider: Online scheduling with rejection and withdrawal. Theor. Comput. Sci. 412(48): 6666-6674 (2011)
174		Leah Epstein, Rob van Stee: Improved Results for a Memory Allocation Problem. Theory Comput. Syst. 48(1): 79-92 (2011)
	2010
173		Ramin Yahyapour, Raffaele Perego, Frédéric Desprez, Leah Epstein, Francesc Guim Bernat: Scheduling and Load Balancing. Euro-Par (1) 2010: 156
172		Leah Epstein, Asaf Levin, Rob van Stee: Max-min Online Allocations with a Reordering Buffer. ICALP (1) 2010: 336-347
171		Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie: Universal Sequencing on a Single Machine. IPCO 2010: 230-243
170		János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin: Online Clustering with Variable Sized Clusters. MFCS 2010: 282-293
169		Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev: Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. STACS 2010: 347-358
168		Leah Epstein, Rob van Stee: On the online unit clustering problem. ACM Transactions on Algorithms 7(1): 7 (2010)
167		Leah Epstein: Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy. Acta Inf. 47(7-8): 375-389 (2010)
166		Leah Epstein: Bin Packing with Rejection Revisited. Algorithmica 56(4): 505-528 (2010)
165		Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir: Transactional Contention Management as a Non-Clairvoyant Scheduling Problem. Algorithmica 57(1): 44-61 (2010)
164		Leah Epstein, Asaf Levin, Betzalel Menahem: Minimization of SONET ADMs in ring networks revisited. Computing 87(1-2): 3-19 (2010)
163		János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin: On the sum minimization version of the online bin covering problem. Discrete Applied Mathematics 158(13): 1381-1393 (2010)
162		Leah Epstein, Asaf Levin: Randomized algorithms for online bounded bidding. Inf. Process. Lett. 110(12-13): 503-506 (2010)
161		György Dósa, Leah Epstein: Online scheduling with a buffer on related machines. J. Comb. Optim. 20(2): 161-179 (2010)
160		Leah Epstein, Meital Levy: Dynamic multi-dimensional bin packing. J. Discrete Algorithms 8(4): 356-372 (2010)
159		Leah Epstein, Asaf Levin: AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items. SIAM Journal on Optimization 20(6): 3121-3145 (2010)
158		Leah Epstein, Rob van Stee: Maximizing the minimum load for selfish agents. Theor. Comput. Sci. 411(1): 44-57 (2010)
157		Joan Boyar, Leah Epstein, Asaf Levin: Tight results for Next Fit and Worst Fit with resource augmentation. Theor. Comput. Sci. 411(26-28): 2572-2580 (2010)
156		Leah Epstein: Two-dimensional online bin packing with rotation. Theor. Comput. Sci. 411(31-33): 2899-2911 (2010)
155		Leah Epstein, Csanád Imreh, Asaf Levin: Class constrained bin packing revisited. Theor. Comput. Sci. 411(34-36): 3073-3089 (2010)
154		Leah Epstein, Asaf Levin: Improved randomized results for the interval selection problem. Theor. Comput. Sci. 411(34-36): 3129-3135 (2010)
153		Leah Epstein, Csanád Imreh, Asaf Levin: Class Constrained Bin Covering. Theory Comput. Syst. 46(2): 246-260 (2010)
	2009
152		György Dósa, Leah Epstein: Preemptive Online Scheduling with Reordering. ESA 2009: 456-467
151		Leah Epstein, Asaf Levin: On Equilibria for ADM Minimization Games. SAGT 2009: 347-358
150		Leah Epstein, Elena Kleiman, Rob van Stee: Maximizing the Minimum Load: The Cost of Selfishness. WINE 2009: 232-243
149		Leah Epstein, Elena Kleiman, Julián Mestre: Parametric Packing of Selfish Items and the Subset Sum Algorithm. WINE 2009: 67-78
148		Leah Epstein, Thomas Erlebach, Asaf Levin: Variable Sized Online Interval Coloring with Bandwidth. Algorithmica 53(3): 385-401 (2009)
147		Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai: Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. Algorithmica 55(4): 643-665 (2009)
146		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)
145		Leah Epstein, Asaf Levin: AFPTAS results for common variants of bin packing: A new method to handle the small items CoRR abs/0906.5050: (2009)
144		Leah Epstein, Asaf Levin: Bin packing with general cost structures CoRR abs/0906.5051: (2009)
143		Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev: Improved approximation guarantees for weighted matching in the semi-streaming model CoRR abs/0907.0305: (2009)
142		Leah Epstein, Elena Kleiman, Julián Mestre: Parametric packing of selfish items and the subset sum algorithm CoRR abs/0907.4311: (2009)
141		Leah Epstein, Elena Kleiman: Resource augmented semi-online bounded space bin packing. Discrete Applied Mathematics 157(13): 2785-2798 (2009)
140		Leah Epstein, Asaf Levin: Better bounds for minimizing SONET ADMs. J. Comput. Syst. Sci. 75(2): 122-136 (2009)
139		Leah Epstein, Asaf Levin: A robust APTAS for the classical bin packing problem. Math. Program. 119(1): 33-49 (2009)
138		Leah Epstein, Thomas Erlebach, Asaf Levin: Online Capacitated Interval Coloring. SIAM J. Discrete Math. 23(2): 822-841 (2009)
137		Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga: Optimally competitive list batching. Theor. Comput. Sci. 410(38-40): 3631-3639 (2009)
136		Xingyu Chen, Leah Epstein, Zhiyi Tan: Semi-online machine covering for two uniform machines. Theor. Comput. Sci. 410(47-49): 5047-5062 (2009)
135		Leah Epstein, Rob van Stee, Tami Tamir: Paging with Request Sets. Theory Comput. Syst. 44(1): 67-81 (2009)
	2008
134		Leah Epstein, Elena Kleiman: Selfish Bin Packing. ESA 2008: 368-380
133		Leah Epstein, Asaf Levin: Improved Randomized Results for That Interval Selection Problem. ESA 2008: 381-392
132		Leah Epstein, Rob van Stee: Maximizing the Minimum Load for Selfish Agents. LATIN 2008: 264-275
131		Leah Epstein, Rob van Stee: The Price of Anarchy on Uniformly Related Machines Revisited. SAGT 2008: 46-57
130		Leah Epstein, Amos Fiat, Meital Levy: Caching Content under Digital Rights Management. WAOA 2008: 188-200
129		Leah Epstein: List Scheduling. Encyclopedia of Algorithms 2008
128		Leah Epstein: Load Balancing. Encyclopedia of Algorithms 2008
127		Leah Epstein: Online Interval Coloring. Encyclopedia of Algorithms 2008
126		Leah Epstein, Asaf Levin, Rob van Stee: Two-dimensional packing with conflicts. Acta Inf. 45(3): 155-175 (2008)
125		Leah Epstein, Asaf Levin: A PTAS for delay minimization in establishing wireless conference calls. Discrete Optimization 5(1): 88-96 (2008)
124		Leah Epstein, Asaf Levin: More on online bin packing with two item sizes. Discrete Optimization 5(4): 705-713 (2008)
123		György Dósa, Leah Epstein: Preemptive scheduling on a small number of hierarchical machines. Inf. Comput. 206(5): 602-619 (2008)
122		José R. Correa, Leah Epstein: Bin packing with controllable item sizes. Inf. Comput. 206(8): 1003-1016 (2008)
121		Leah Epstein, Asaf Levin: Asymptotic fully polynomial approximation schemes for variants of open-end bin packing. Inf. Process. Lett. 109(1): 32-37 (2008)
120		Orion Chassid, Leah Epstein: The hierarchical model for load balancing on two machines. J. Comb. Optim. 15(4): 305-314 (2008)
119		Leah Epstein, Asaf Levin: An APTAS for Generalized Cost Variable-Sized Bin Packing. SIAM J. Comput. 38(1): 411-428 (2008)
118		Leah Epstein, Asaf Levin: On Bin Packing with Conflicts. SIAM Journal on Optimization 19(3): 1270-1298 (2008)
117		Leah Epstein, Meital Levy: Online interval coloring with packing constraints. Theor. Comput. Sci. 407(1-3): 203-212 (2008)
116		Leah Epstein, Asaf Levin, Rob van Stee: Online unit clustering: Variations on a theme. Theor. Comput. Sci. 407(1-3): 85-96 (2008)
115		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
114		Leah Epstein, Rob van Stee: Preemptive Scheduling on Selfish Machines. CAAN 2007: 57-70
113		Leah Epstein, Thomas Erlebach, Asaf Levin: Online Capacitated Interval Coloring. ESCAPE 2007: 243-254
112		Leah Epstein, Asaf Levin, Rob van Stee: Multi-dimensional Packing with Conflicts. FCT 2007: 288-299
111		Leah Epstein: Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy. Fair Division 2007
110		Leah Epstein, Rob van Stee: Maximizing the Minimum Load for Selfisch Agents. Fair Division 2007
109		Leah Epstein, Rob van Stee: Improved Results for a Memory Allocation Problem. WADS 2007: 362-373
108		Leah Epstein, Asaf Levin: On the Max Coloring Problem. WAOA 2007: 142-155
107		Leah Epstein, Rob van Stee: On the Online Unit Clustering Problem. WAOA 2007: 193-206
106		Leah Epstein, Asaf Levin: Minimum Weighted Sum Bin Packing. WAOA 2007: 218-231
105		Leah Epstein, Rob van Stee: Approximation Schemes for Packing Splittable Items with Cardinality Constraints. WAOA 2007: 232-245
104		Leah Epstein, Asaf Levin: SONET ADMs Minimization with Divisible Paths. Algorithmica 49(1): 51-68 (2007)
103		Leah Epstein, Rob van Stee: Calculating lower bounds for caching problems. Computing 80(3): 275-285 (2007)
102		Leah Epstein, Rob van Stee: Bounds for online bounded space hypercube packing. Discrete Optimization 4(2): 185-197 (2007)
101		Leah Epstein, Rob van Stee: Online bin packing with resource augmentation. Discrete Optimization 4(3-4): 322-333 (2007)
100		Leah Epstein, Deshi Ye: Semi-online scheduling with "end of sequence" information. J. Comb. Optim. 14(1): 45-61 (2007)
99		Anat Bremler-Barr, Leah Epstein: Path layout on tree networks: Bounds in different label switching models. Nord. J. Comput. 14(1-2): 109-125 (2007)
98		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		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		Leah Epstein, Asaf Levin, Gerhard J. Woeginger: Graph Coloring with Rejection. ESA 2006: 364-375
95		Leah Epstein, Asaf Levin: A Robust APTAS for the Classical Bin Packing Problem. ICALP (1) 2006: 214-225
94		Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir: Transactional contention management as a non-clairvoyant scheduling problem. PODC 2006: 308-315
93		Leah Epstein, Rob van Stee, Tami Tamir: Paging with Request Sets. SWAT 2006: 124-135
92		Leah Epstein, Thomas Erlebach, Asaf Levin: Variable Sized Online Interval Coloring with Bandwidth. SWAT 2006: 29-40
91		Leah Epstein: Bin Packing with Rejection Revisited. WAOA 2006: 146-159
90		Leah Epstein, Asaf Levin: On Bin Packing with Conflicts. WAOA 2006: 160-173
89		Leah Epstein, Rob van Stee: Online scheduling of splittable tasks. ACM Transactions on Algorithms 2(1): 79-94 (2006)
88		Leah Epstein, Rob van Stee: This side up! ACM Transactions on Algorithms 2(2): 228-243 (2006)
87		Leah Epstein, Tamir Tassa: Vector assignment schemes for asymmetric settings. Acta Inf. 42(6-7): 501-514 (2006)
86		Leah Epstein, Rob van Stee: Covering selfish machines CoRR abs/cs/0610026: (2006)
85		Leah Epstein, Rob van Stee: Improved results for a memory allocation problem CoRR abs/cs/0612100: (2006)
84		Leah Epstein, Rob van Stee: Optimal on-line flow time with resource augmentation. Discrete Applied Mathematics 154(4): 611-621 (2006)
83		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		Leah Epstein, Tamir Tassa: Optimal preemptive scheduling for general target functions. J. Comput. Syst. Sci. 72(1): 132-162 (2006)
81		Leah Epstein: Online Bin Packing with Cardinality Constraints. SIAM J. Discrete Math. 20(4): 1015-1030 (2006)
80		Leah Epstein, Asaf Levin: The conference call search problem in wireless networks. Theor. Comput. Sci. 359(1-3): 418-429 (2006)
79		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		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		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		Leah Epstein, Rob van Stee: Online scheduling of splittable tasks. Algorithms for Optimization with Incomplete Information 2005
75		Leah Epstein, Asaf Levin: Tracking mobile users. Algorithms for Optimization with Incomplete Information 2005
74		Leah Epstein: Online Bin Packing with Cardinality Constraints. ESA 2005: 604-615
73		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		Leah Epstein, Meital Levy: Online Interval Coloring and Variants. ICALP 2005: 602-613
71		Leah Epstein, Meital Levy: Online Interval Coloring with Packing Constraints. MFCS 2005: 295-307
70		Leah Epstein, Asaf Levin: SONET ADMs Minimization with Divisible Paths. WAOA 2005: 119-132
69		Leah Epstein, Asaf Levin: The Conference Call Search Problem in Wireless Networks. WAOA 2005: 133-146
68		Leah Epstein, Rob van Stee: Online square and cube packing. Acta Inf. 41(9): 595-606 (2005)
67		Leah Epstein: Tight bounds for bandwidth allocation on two links. Discrete Applied Mathematics 148(2): 181-188 (2005)
66		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		Leah Epstein, Lene M. Favrholdt: Optimal non-preemptive semi-online scheduling on two related machines. J. Algorithms 57(1): 49-73 (2005)
64		Leah Epstein, Rob van Stee: Optimal Online Algorithms for Multidimensional Packing Problems. SIAM J. Comput. 35(2): 431-448 (2005)
63		Leah Epstein, Asaf Levin: The chord version for SONET ADMs minimization. Theor. Comput. Sci. 349(3): 337-346 (2005)
	2004
62		Leah Epstein, Rob van Stee: On Variable-Sized Multidimensional Packing. ESA 2004: 287-298
61		Leah Epstein, Tamir Tassa: Optimal Preemptive Scheduling for General Target Functions. MFCS 2004: 562-573
60		Anat Bremler-Barr, Leah Epstein: Path Layout on Tree Networks: Bounds in Different Label Switching Models. SIROCCO 2004: 35-46
59		Leah Epstein, Rob van Stee: Optimal online bounded space multidimensional packing. SODA 2004: 214-223
58		Leah Epstein, Rob van Stee: Online Scheduling of Splittable Tasks in Peer-to-Peer Networks. SWAT 2004: 408-419
57		Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga: Optimally Competitive List Batching. SWAT 2004: 77-89
56		Leah Epstein, Rob van Stee: Online Bin Packing with Resource Augmentation. WAOA 2004: 23-35
55		Leah Epstein, Asaf Levin: Better Bounds for Minimizing SONET ADMs. WAOA 2004: 281-294
54		Leah Epstein, Asaf Levin: A PTAS for Delay Minimization in Establishing Wireless Conference Calls. WAOA 2004: 36-47
53		Leah Epstein, Rob van Stee: This Side Up! WAOA 2004: 48-60
52		Leah Epstein, Tamir Tassa: Approximation schemes for the Min-Max Starting Time Problem. Acta Inf. 40(9): 657-674 (2004)
51		Leah Epstein, Jiri Sgall: Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines. Algorithmica 39(1): 43-57 (2004)
50		Leah Epstein, Rob van Stee: Minimizing the maximum starting time on-line. Inf. Comput. 195(1-2): 53-65 (2004)
49		Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger: All-norm approximation algorithms. J. Algorithms 52(2): 120-133 (2004)
48		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		Leah Epstein: Two Dimensional Packing: The Power of Rotation. MFCS 2003: 398-407
46		Leah Epstein, Tamir Tassa: Approximation Schemes for the Min-Max Starting Time Problem. MFCS 2003: 408-418
45		Leah Epstein, Arik Ganot: Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation. WAOA 2003: 109-122
44		Yossi Azar, Amir Epstein, Leah Epstein: Load Balancing of Temporary Tasks in the lp Norm. WAOA 2003: 53-66
43		Leah Epstein: On variable sized vector packing. Acta Cybern. 16(1): 47-56 (2003)
42		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		Leah Epstein: Bin stretching revisited. Acta Inf. 39(2): 97-117 (2003)
40		Amitai Armon, Yossi Azar, Leah Epstein: Temporary Tasks Assignment Resolved. Algorithmica 36(3): 295-314 (2003)
39		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		Leah Epstein, Tamir Tassa: Vector assignment problems: a general framework. J. Algorithms 48(2): 360-384 (2003)
37		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		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		Leah Epstein, Rob van Stee: Lower bounds for on-line single-machine scheduling. Theor. Comput. Sci. 1-3(299): 439-450 (2003)
33		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		Leah Epstein, Lene M. Favrholdt: On-Line Maximizing the Number of Items Packed in Variable-Sized Bins. COCOON 2002: 467-475
31		Leah Epstein, Rob van Stee: Minimizing the Maximum Starting Time On-line. ESA 2002: 449-460
30		Leah Epstein, Tamir Tassa: Vector Assignment Problems: A General Framework. ESA 2002: 461-472
29		Leah Epstein, Steven S. Seiden, Rob van Stee: New Bounds for Variable-Sized and Resource Augmented Online Bin Packing. ICALP 2002: 306-317
28		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		Leah Epstein, Lene M. Favrholdt: Optimal Non-preemptive Semi-online Scheduling on Two Related Machines. MFCS 2002: 245-256
26		Leah Epstein, Csanád Imreh, Rob van Stee: More on Weighted Servers or FIFO is Better than LRU. MFCS 2002: 257-268
25		Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev: Temporary tasks assignment resolved. SODA 2002: 116-124
24		Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger: All-Norm Approximation Algorithms. SWAT 2002: 288-297
23		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		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		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		Leah Epstein: On-Line Variable Sized Covering. COCOON 2001: 463-472
18		Leah Epstein, Rob van Stee: Optimal Online Flow Time with Resource Augmentation. FCT 2001: 472-482
17		Leah Epstein, Rob van Stee: Lower Bounds for On-Line Single-Machine Scheduling. MFCS 2001: 338-350
16		Leah Epstein: Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios. STACS 2001: 230-237
15		Leah Epstein: Online Variable Sized Covering. Inf. Comput. 171(2): 294-305 (2001)
14		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		Yossi Azar, Leah Epstein: On-Line Scheduling with Precedence Constraints. SWAT 2000: 164-174
12		Yossi Azar, Leah Epstein, Rob van Stee: Resource Augmentation in Load Balancing. SWAT 2000: 189-199
11		Leah Epstein: A note on on-line scheduling with precedence constraints on identical machines. Inf. Process. Lett. 76(4-6): 149-153 (2000)
10		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		Leah Epstein, Jiri Sgall: Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines. ESA 1999: 151-162
8		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		Yossi Azar, Leah Epstein: Approximation Schemes for Covering and Scheduling on Related Machines. APPROX 1998: 39-47
6		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		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

Coauthor Index

1	Noga Alon	[5]
2	Amitai Armon	[25] [39] [40]
3	Hagit Attiya (Chagit Attiya)	[94] [165]
4	Yossi Azar	[1] [2] [3] [4] [5] [7] [12] [13] [22] [23] [24] [25] [39] [40] [44] [48] [49] [79]
5	Eric Bach	[36]
6	Wolfgang W. Bein	[57] [137] [146]
7	Francesc Guim Bernat	[173]
8	Joan Boyar (Joan B. Plumstead)	[23] [36] [73] [78] [157]
9	Anat Bremler-Barr	[60] [99]
10	Orion Chassid	[120]
11	Xingyu Chen	[136]
12	Marek Chrobak	[28] [37]
13	José R. Correa	[122]
14	János Csirik	[5] [163] [170]
15	Frédéric Desprez (Frederic Desprez)	[173]
16	György Dósa	[123] [152] [161] [178] [189]
17	Amir Epstein	[44] [79]
18	Thomas Erlebach	[92] [113] [138] [148]
19	Lene M. Favrholdt	[21] [23] [27] [32] [36] [42] [65] [73] [78] [83] [181] [187]
20	Amos Fiat	[130]
21	Arik Ganot	[45] [115]
22	Magnús M. Halldórsson	[97] [147]
23	Yong He	[66]
24	Csanád Imreh	[26] [33] [153] [155] [163] [170] [183]
25	Tao Jiang	[36]
26	Alexander Kesselman (Alexander Keizelman)	[77]
27	Elena Kleiman	[134] [141] [142] [149] [150] [182] [185]
28	Yanir Kleiman	[98]
29	Jens S. Kohrt (Jens S. Frederiksen)	[73] [78] [83] [187]
30	Sven Oliver Krumke	[180]
31	Lawrence L. Larmore	[57] [137] [146]
32	Kim S. Larsen	[23] [36] [73] [78]
33	Asaf Levin	[54] [55] [63] [69] [70] [75] [80] [90] [92] [95] [96] [97] [104] [106] [108] [112] [113] [116] [118] [119] [121] [124] [125] [126] [133] [138] [139] [140] [143] [144] [145] [147] [148] [151] [153] [154] [155] [157] [159] [162] [163] [164] [169] [170] [171] [172] [176] [177] [179] [180] [181] [183] [184] [186] [190] [191] [192]
34	Meital Levy	[71] [72] [117] [130] [160]
35	Guohui Lin (Guo-Hui Lin)	[36]
36	Alberto Marchetti-Spaccamela	[171]
37	Nicole Megow	[171]
38	Betzalel Menahem	[164]
39	Julián Mestre	[142] [143] [149] [169] [171] [176]
40	Judit Nagy-György	[183]
41	Morten N. Nielsen	[23]
42	John Noga	[8] [20] [28] [37] [57] [137] [146]
43	Morten Monrad Pedersen	[73] [78]
44	Raffaele Perego	[173]
45	Oded Regev	[25] [39]
46	Yossi Richter	[24] [49]
47	Danny Segev	[143] [169] [176]
48	Steven S. Seiden	[8] [29] [35]
49	Sergey V. Sevastianov	[5]
50	Jiri Sgall	[8] [9] [10] [28] [37] [51] [98]
51	Hadas Shachnai	[94] [97] [147] [165]
52	Martin Skutella	[171]
53	Heike Sperber	[180]
54	Rob van Stee	[12] [17] [18] [26] [28] [29] [31] [33] [34] [35] [36] [37] [50] [53] [56] [58] [59] [62] [64] [68] [76] [84] [85] [86] [88] [89] [93] [98] [101] [102] [103] [105] [107] [109] [110] [112] [114] [116] [126] [131] [132] [135] [150] [158] [168] [172] [174] [177] [188] [192]
55	Leen Stougie	[171]
56	Tami Tamir	[93] [94] [135] [165]
57	Zhiyi Tan	[66] [136]
58	Tamir Tassa	[30] [38] [46] [52] [61] [82] [87]
59	Tomás Tichý	[28] [37]
60	Nodari Vakhania	[28] [37]
61	Arjen P. A. Vestjens	[5]
62	Gerhard J. Woeginger	[5] [8] [20] [24] [49] [96] [179]
63	Sanne Wøhlk	[73] [78]
64	Ramin Yahyapour	[173]
65	Deshi Ye	[100]
66	Hanan Zebedat-Haider	[175]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page