Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Leah Epstein
2010 – today
- 2013
[j108]János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin: Online Clustering with Variable Sized Clusters. Algorithmica 65(2): 251-274 (2013)- [j107]Leah Epstein, Michal Feldman, Tami Tamir, Lukasz Witkowski, Marcin Witkowski: Approximate strong equilibria in job scheduling games with two uniformly related machines. Discrete Applied Mathematics 161(13-14): 1843-1858 (2013)
- [j106]Leah Epstein, Csanád Imreh, Asaf Levin: Bin covering with cardinality constraints. Discrete Applied Mathematics 161(13-14): 1975-1987 (2013)
- [j105]Xujin Chen, Leah Epstein, Elena Kleiman, Rob van Stee: Maximizing the minimum load: The cost of selfishness. Theor. Comput. Sci. 482: 9-19 (2013)
- [c84]Leah Epstein, Asaf Levin, Rob van Stee: A unified approach to truthful scheduling on related machines. SODA 2013: 1243-1252
- [c83]Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann: Improved Bounds for Online Preemptive Matching. STACS 2013: 389-399
- 2012
- [j104]Leah Epstein, Asaf Levin, Rob van Stee: Approximation Schemes for Packing Splittable Items with Cardinality Constraints. Algorithmica 62(1-2): 102-129 (2012)
- [j103]Leah Epstein, Asaf Levin: On Equilibria for ADM Minimization Games. Algorithmica 63(1-2): 246-273 (2012)
- [j102]Joan Boyar, György Dósa, Leah Epstein: On the absolute approximation ratio for First Fit and related results. Discrete Applied Mathematics 160(13-14): 1914-1923 (2012)
- [j101]Leah Epstein, Rob van Stee: The price of anarchy on uniformly related machines revisited. Inf. Comput. 212: 37-54 (2012)
- [j100]Leah Epstein, Asaf Levin: Bin packing with general cost structures. Math. Program. 132(1-2): 355-391 (2012)
- [j99]Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt: Comparing online algorithms for bin packing problems. J. Scheduling 15(1): 13-21 (2012)
- [j98]Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie: Universal Sequencing on an Unreliable Machine. SIAM J. Comput. 41(3): 565-586 (2012)
- [j97]
- [c82]Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir: Packing Resizable Items with Application to Video Delivery over Wireless Networks. ALGOSENSORS 2012: 6-17
- [c81]Leah Epstein, Lukasz Jez, Jiri Sgall, Rob van Stee: Online Scheduling of Jobs with Fixed Start Times on Related Machines. APPROX-RANDOM 2012: 134-145
- [c80]Leah Epstein, Asaf Levin, Gerhard J. Woeginger: The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. WG 2012: 114-125
- [e1]Leah Epstein, Paolo Ferragina (Eds.): Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings. Lecture Notes in Computer Science 7501, Springer 2012, ISBN 978-3-642-33089-6
- [i11]Leah Epstein, Asaf Levin: An efficient polynomial time approximation scheme for load balancing on uniformly related machines. CoRR abs/1202.4072 (2012)
- [i10]
- [i9]Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann: Improved Bounds for Online Preemptive Matching. CoRR abs/1207.1788 (2012)
- [i8]Leah Epstein, Asaf Levin, Rob van Stee: A unified approach to truthful scheduling on related machines. CoRR abs/1207.3523 (2012)
- 2011
- [j96]
- [j95]Leah Epstein, Lene M. Favrholdt, Asaf Levin: Online variable-sized bin packing with conflicts. Discrete Optimization 8(2): 333-343 (2011)
- [j94]Leah Epstein, Sven Oliver Krumke, Asaf Levin, Heike Sperber: Selfish bin coloring. J. Comb. Optim. 22(4): 531-548 (2011)
- [j93]Leah Epstein, Asaf Levin, Gerhard J. Woeginger: Graph coloring with rejection. J. Comput. Syst. Sci. 77(2): 439-447 (2011)
- [j92]Leah Epstein, Rob van Stee: Improved Results for a Memory Allocation Problem. Theory Comput. Syst. 48(1): 79-92 (2011)
- [j91]György Dósa, Leah Epstein: Preemptive Online Scheduling with Reordering. SIAM J. Discrete Math. 25(1): 21-49 (2011)
- [j90]Leah Epstein, Asaf Levin, Rob van Stee: Max-min Online Allocations with a Reordering Buffer. SIAM J. Discrete Math. 25(3): 1230-1250 (2011)
- [j89]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)
- [j88]Leah Epstein, Hanan Zebedat-Haider: Online scheduling with rejection and withdrawal. Theor. Comput. Sci. 412(48): 6666-6674 (2011)
- [c79]Leah Epstein, Elena Kleiman: On the quality and complexity of pareto equilibria in the job scheduling game. AAMAS 2011: 525-532
- [c78]
- [c77]Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György: On Variants of File Caching. ICALP (1) 2011: 195-206
- 2010
- [j87]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)
- [j86]
- [j85]Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir: Transactional Contention Management as a Non-Clairvoyant Scheduling Problem. Algorithmica 57(1): 44-61 (2010)
- [j84]Leah Epstein, Asaf Levin, Betzalel Menahem: Minimization of SONET ADMs in ring networks revisited. Computing 87(1-2): 3-19 (2010)
- [j83]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)
- [j82]Leah Epstein, Asaf Levin: Randomized algorithms for online bounded bidding. Inf. Process. Lett. 110(12-13): 503-506 (2010)
- [j81]György Dósa, Leah Epstein: Online scheduling with a buffer on related machines. J. Comb. Optim. 20(2): 161-179 (2010)
- [j80]Leah Epstein, Meital Levy: Dynamic multi-dimensional bin packing. J. Discrete Algorithms 8(4): 356-372 (2010)
- [j79]Leah Epstein, Csanád Imreh, Asaf Levin: Class Constrained Bin Covering. Theory Comput. Syst. 46(2): 246-260 (2010)
- [j78]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)
- [j77]Leah Epstein, Rob van Stee: On the online unit clustering problem. ACM Transactions on Algorithms 7(1): 7 (2010)
- [j76]Leah Epstein, Rob van Stee: Maximizing the minimum load for selfish agents. Theor. Comput. Sci. 411(1): 44-57 (2010)
- [j75]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)
- [j74]Leah Epstein: Two-dimensional online bin packing with rotation. Theor. Comput. Sci. 411(31-33): 2899-2911 (2010)
- [j73]Leah Epstein, Csanád Imreh, Asaf Levin: Class constrained bin packing revisited. Theor. Comput. Sci. 411(34-36): 3073-3089 (2010)
- [j72]Leah Epstein, Asaf Levin: Improved randomized results for the interval selection problem. Theor. Comput. Sci. 411(34-36): 3129-3135 (2010)
- [c76]Ramin Yahyapour, Raffaele Perego, Frédéric Desprez, Leah Epstein, Francesc Guim Bernat: Scheduling and Load Balancing. Euro-Par (1) 2010: 156
- [c75]Leah Epstein, Asaf Levin, Rob van Stee: Max-min Online Allocations with a Reordering Buffer. ICALP (1) 2010: 336-347
- [c74]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
- [c73]János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin: Online Clustering with Variable Sized Clusters. MFCS 2010: 282-293
- [c72]Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev: Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. STACS 2010: 347-358
2000 – 2009
- 2009
- [j71]Leah Epstein, Thomas Erlebach, Asaf Levin: Variable Sized Online Interval Coloring with Bandwidth. Algorithmica 53(3): 385-401 (2009)
- [j70]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)
- [j69]Leah Epstein, Elena Kleiman: Resource augmented semi-online bounded space bin packing. Discrete Applied Mathematics 157(13): 2785-2798 (2009)
- [j68]Leah Epstein, Asaf Levin: Better bounds for minimizing SONET ADMs. J. Comput. Syst. Sci. 75(2): 122-136 (2009)
- [j67]Leah Epstein, Asaf Levin: A robust APTAS for the classical bin packing problem. Math. Program. 119(1): 33-49 (2009)
- [j66]Leah Epstein, Rob van Stee, Tami Tamir: Paging with Request Sets. Theory Comput. Syst. 44(1): 67-81 (2009)
- [j65]Leah Epstein, Thomas Erlebach, Asaf Levin: Online Capacitated Interval Coloring. SIAM J. Discrete Math. 23(2): 822-841 (2009)
- [j64]Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga: Optimally competitive list batching. Theor. Comput. Sci. 410(38-40): 3631-3639 (2009)
- [j63]Xingyu Chen, Leah Epstein, Zhiyi Tan: Semi-online machine covering for two uniform machines. Theor. Comput. Sci. 410(47-49): 5047-5062 (2009)
- [c71]
- [c70]
- [c69]Leah Epstein, Elena Kleiman, Julián Mestre: Parametric Packing of Selfish Items and the Subset Sum Algorithm. WINE 2009: 67-78
- [c68]Leah Epstein, Elena Kleiman, Rob van Stee: Maximizing the Minimum Load: The Cost of Selfishness. WINE 2009: 232-243
- [i7]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)
- [i6]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)
- [i5]
- [i4]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)
- [i3]Leah Epstein, Elena Kleiman, Julián Mestre: Parametric packing of selfish items and the subset sum algorithm. CoRR abs/0907.4311 (2009)
- 2008
- [j62]Leah Epstein, Asaf Levin, Rob van Stee: Two-dimensional packing with conflicts. Acta Inf. 45(3): 155-175 (2008)
- [j61]Leah Epstein, Asaf Levin: A PTAS for delay minimization in establishing wireless conference calls. Discrete Optimization 5(1): 88-96 (2008)
- [j60]Leah Epstein, Asaf Levin: More on online bin packing with two item sizes. Discrete Optimization 5(4): 705-713 (2008)
- [j59]György Dósa, Leah Epstein: Preemptive scheduling on a small number of hierarchical machines. Inf. Comput. 206(5): 602-619 (2008)
- [j58]José R. Correa, Leah Epstein: Bin packing with controllable item sizes. Inf. Comput. 206(8): 1003-1016 (2008)
- [j57]Leah Epstein, Asaf Levin: Asymptotic fully polynomial approximation schemes for variants of open-end bin packing. Inf. Process. Lett. 109(1): 32-37 (2008)
- [j56]Orion Chassid, Leah Epstein: The hierarchical model for load balancing on two machines. J. Comb. Optim. 15(4): 305-314 (2008)
- [j55]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)
- [j54]Leah Epstein, Asaf Levin: An APTAS for Generalized Cost Variable-Sized Bin Packing. SIAM J. Comput. 38(1): 411-428 (2008)
- [j53]Leah Epstein, Asaf Levin: On Bin Packing with Conflicts. SIAM Journal on Optimization 19(3): 1270-1298 (2008)
- [j52]Leah Epstein, Asaf Levin, Rob van Stee: Online unit clustering: Variations on a theme. Theor. Comput. Sci. 407(1-3): 85-96 (2008)
- [j51]Leah Epstein, Meital Levy: Online interval coloring with packing constraints. Theor. Comput. Sci. 407(1-3): 203-212 (2008)
- [c67]
- [c66]Leah Epstein, Asaf Levin: Improved Randomized Results for That Interval Selection Problem. ESA 2008: 381-392
- [c65]
- [c64]Leah Epstein, Rob van Stee: The Price of Anarchy on Uniformly Related Machines Revisited. SAGT 2008: 46-57
- [c63]Leah Epstein, Amos Fiat, Meital Levy: Caching Content under Digital Rights Management. WAOA 2008: 188-200
- [r3]
- [r2]
- [r1]
- 2007
- [j50]Leah Epstein, Asaf Levin: SONET ADMs Minimization with Divisible Paths. Algorithmica 49(1): 51-68 (2007)
- [j49]Leah Epstein, Rob van Stee: Calculating lower bounds for caching problems. Computing 80(3): 275-285 (2007)
- [j48]Leah Epstein, Rob van Stee: Bounds for online bounded space hypercube packing. Discrete Optimization 4(2): 185-197 (2007)
- [j47]Leah Epstein, Rob van Stee: Online bin packing with resource augmentation. Discrete Optimization 4(3-4): 322-333 (2007)
- [j46]Leah Epstein, Deshi Ye: Semi-online scheduling with "end of sequence" information. J. Comb. Optim. 14(1): 45-61 (2007)
- [j45]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)
- [j44]Leah Epstein, Yanir Kleiman, Jiri Sgall, Rob van Stee: Paging with connections: FIFO strikes again. Theor. Comput. Sci. 377(1-3): 55-64 (2007)
- [c62]
- [c61]Leah Epstein: Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy. Fair Division 2007
- [c60]
- [c59]Leah Epstein, Thomas Erlebach, Asaf Levin: Online Capacitated Interval Coloring. ESCAPE 2007: 243-254
- [c58]
- [c57]
- [c56]
- [c55]
- [c54]
- [c53]Leah Epstein, Rob van Stee: Approximation Schemes for Packing Splittable Items with Cardinality Constraints. WAOA 2007: 232-245
- 2006
- [j43]Leah Epstein, Tamir Tassa: Vector assignment schemes for asymmetric settings. Acta Inf. 42(6-7): 501-514 (2006)
- [j42]Leah Epstein, Rob van Stee: Optimal on-line flow time with resource augmentation. Discrete Applied Mathematics 154(4): 611-621 (2006)
- [j41]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)
- [j40]Leah Epstein, Tamir Tassa: Optimal preemptive scheduling for general target functions. J. Comput. Syst. Sci. 72(1): 132-162 (2006)
- [j39]Leah Epstein: Online Bin Packing with Cardinality Constraints. SIAM J. Discrete Math. 20(4): 1015-1030 (2006)
- [j38]Leah Epstein, Rob van Stee: Online scheduling of splittable tasks. ACM Transactions on Algorithms 2(1): 79-94 (2006)
- [j37]
- [j36]Leah Epstein, Asaf Levin: The conference call search problem in wireless networks. Theor. Comput. Sci. 359(1-3): 418-429 (2006)
- [j35]Yossi Azar, Amir Epstein, Leah Epstein: Load balancing of temporary tasks in the lp norm. Theor. Comput. Sci. 361(2-3): 314-328 (2006)
- [j34]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)
- [j33]Leah Epstein, Alexander Kesselman: On the remote server problem or more about TCP acknowledgments. Theor. Comput. Sci. 369(1-3): 285-299 (2006)
- [c52]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
- [c51]
- [c50]Leah Epstein, Asaf Levin: A Robust APTAS for the Classical Bin Packing Problem. ICALP (1) 2006: 214-225
- [c49]Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir: Transactional contention management as a non-clairvoyant scheduling problem. PODC 2006: 308-315
- [c48]Leah Epstein, Thomas Erlebach, Asaf Levin: Variable Sized Online Interval Coloring with Bandwidth. SWAT 2006: 29-40
- [c47]
- [c46]
- [c45]
- [i2]
- [i1]Leah Epstein, Rob van Stee: Improved results for a memory allocation problem. CoRR abs/cs/0612100 (2006)
- 2005
- [j32]
- [j31]Leah Epstein: Tight bounds for bandwidth allocation on two links. Discrete Applied Mathematics 148(2): 181-188 (2005)
- [j30]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)
- [j29]Leah Epstein, Lene M. Favrholdt: Optimal non-preemptive semi-online scheduling on two related machines. J. Algorithms 57(1): 49-73 (2005)
- [j28]Leah Epstein, Rob van Stee: Optimal Online Algorithms for Multidimensional Packing Problems. SIAM J. Comput. 35(2): 431-448 (2005)
- [j27]Leah Epstein, Asaf Levin: The chord version for SONET ADMs minimization. Theor. Comput. Sci. 349(3): 337-346 (2005)
- [c44]Leah Epstein, Asaf Levin: Tracking mobile users. Algorithms for Optimization with Incomplete Information 2005
- [c43]Leah Epstein, Rob van Stee: Online scheduling of splittable tasks. Algorithms for Optimization with Incomplete Information 2005
- [c42]
- [c41]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
- [c40]
- [c39]
- [c38]
- [c37]Leah Epstein, Asaf Levin: The Conference Call Search Problem in Wireless Networks. WAOA 2005: 133-146
- 2004
- [j26]Leah Epstein, Tamir Tassa: Approximation schemes for the Min-Max Starting Time Problem. Acta Inf. 40(9): 657-674 (2004)
- [j25]Leah Epstein, Jiri Sgall: Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines. Algorithmica 39(1): 43-57 (2004)
- [j24]Leah Epstein, Rob van Stee: Minimizing the maximum starting time on-line. Inf. Comput. 195(1-2): 53-65 (2004)
- [j23]Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger: All-norm approximation algorithms. J. Algorithms 52(2): 120-133 (2004)
- [j22]Yossi Azar, Leah Epstein: On-Line Load Balancing of Temporary Tasks on Identical Machines. SIAM J. Discrete Math. 18(2): 347-352 (2004)
- [c36]
- [c35]Leah Epstein, Tamir Tassa: Optimal Preemptive Scheduling for General Target Functions. MFCS 2004: 562-573
- [c34]Anat Bremler-Barr, Leah Epstein: Path Layout on Tree Networks: Bounds in Different Label Switching Models. SIROCCO 2004: 35-46
- [c33]Leah Epstein, Rob van Stee: Optimal online bounded space multidimensional packing. SODA 2004: 214-223
- [c32]Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga: Optimally Competitive List Batching. SWAT 2004: 77-89
- [c31]Leah Epstein, Rob van Stee: Online Scheduling of Splittable Tasks in Peer-to-Peer Networks. SWAT 2004: 408-419
- [c30]
- [c29]Leah Epstein, Asaf Levin: A PTAS for Delay Minimization in Establishing Wireless Conference Calls. WAOA 2004: 36-47
- [c28]
- [c27]
- 2003
- [j21]
- [j20]
- [j19]Leah Epstein, Lene M. Favrholdt: On-Line Maximizing the Number of Items Packed in Variable-Sized Bins. Acta Cybern. 16(1): 57-66 (2003)
- [j18]Amitai Armon, Yossi Azar, Leah Epstein: Temporary Tasks Assignment Resolved. Algorithmica 36(3): 295-314 (2003)
- [j17]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)
- [j16]Leah Epstein, Tamir Tassa: Vector assignment problems: a general framework. J. Algorithms 48(2): 360-384 (2003)
- [j15]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)
- [j14]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)
- [j13]Steven S. Seiden, Rob van Stee, Leah Epstein: New Bounds for Variable-Sized Online Bin Packing. SIAM J. Comput. 32(2): 455-469 (2003)
- [j12]Leah Epstein, Rob van Stee: Lower bounds for on-line single-machine scheduling. Theor. Comput. Sci. 1-3(299): 439-450 (2003)
- [j11]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)
- [c26]
- [c25]Leah Epstein, Tamir Tassa: Approximation Schemes for the Min-Max Starting Time Problem. MFCS 2003: 408-418
- [c24]Yossi Azar, Amir Epstein, Leah Epstein: Load Balancing of Temporary Tasks in the lp Norm. WAOA 2003: 53-66
- [c23]Leah Epstein, Arik Ganot: Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation. WAOA 2003: 109-122
- 2002
- [j10]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)
- [j9]Yossi Azar, Leah Epstein: On-line scheduling with precedence constraints. Discrete Applied Mathematics 119(1-2): 169-180 (2002)
- [j8]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)
- [j7]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)
- [c22]Leah Epstein, Lene M. Favrholdt: On-Line Maximizing the Number of Items Packed in Variable-Sized Bins. COCOON 2002: 467-475
- [c21]
- [c20]
- [c19]Leah Epstein, Steven S. Seiden, Rob van Stee: New Bounds for Variable-Sized and Resource Augmented Online Bin Packing. ICALP 2002: 306-317
- [c18]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
- [c17]Leah Epstein, Lene M. Favrholdt: Optimal Non-preemptive Semi-online Scheduling on Two Related Machines. MFCS 2002: 245-256
- [c16]Leah Epstein, Csanád Imreh, Rob van Stee: More on Weighted Servers or FIFO is Better than LRU. MFCS 2002: 257-268
- [c15]Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev: Temporary tasks assignment resolved. SODA 2002: 116-124
- [c14]Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger: All-Norm Approximation Algorithms. SWAT 2002: 288-297
- 2001
- [j6]
- [j5]Leah Epstein: Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios. Oper. Res. Lett. 29(2): 93-98 (2001)
- [c13]
- [c12]
- [c11]
- [c10]Leah Epstein: Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios. STACS 2001: 230-237
- 2000
- [j4]Leah Epstein: A note on on-line scheduling with precedence constraints on identical machines. Inf. Process. Lett. 76(4-6): 149-153 (2000)
- [j3]Leah Epstein, Jiri Sgall: A lower bound for on-line scheduling on uniformly related machines. Oper. Res. Lett. 26(1): 17-22 (2000)
- [c9]
- [c8]
1990 – 1999
- 1999
- [c7]Leah Epstein, Jiri Sgall: Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines. ESA 1999: 151-162
- [c6]Leah Epstein, John Noga, Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger: Randomized Online Scheduling on Two Uniform Machines. SODA 1999: 317-326
- 1998
- [j2]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)
- [c5]Yossi Azar, Leah Epstein: Approximation Schemes for Covering and Scheduling on Related Machines. APPROX 1998: 39-47
- [c4]Leah Epstein: Lower Bounds for On-line Scheduling with Precedence Constraints on Identical Machines. APPROX 1998: 89-98
- 1997
- [j1]
- [c3]
- [c2]Yossi Azar, Leah Epstein: On-Line Load Balancing of Temporary Tasks on Identical Machines. ISTCS 1997: 119-125
- 1996
- [c1]
Coauthor Index
[j108] [j106] [c84] [c83] [j104] [j103] [j100] [j98] [j97] [c80] [i11] [i9] [i8] [j95] [j94] [j93] [j90] [j89] [c78] [c77] [j84] [j83] [j82] [j79] [j78] [j75] [j73] [j72] [c75] [c74] [c73] [c72] [j71] [j70] [j68] [j67] [j65] [c70] [i6] [i5] [i4] [j62] [j61] [j60] [j57] [j54] [j53] [j52] [c66] [j50] [c59] [c58] [c56] [c54] [j36] [c52] [c51] [c50] [c48] [c45] [j27] [c44] [c38] [c37] [c29] [c27]
[j105] [c84] [j104] [j101] [c81] [i8] [j92] [j90] [j77] [j76] [c75] [j66] [c68] [j62] [j52] [c65] [c64] [j49] [j48] [j47] [j44] [c62] [c60] [c58] [c57] [c55] [c53] [j42] [j38] [j37] [c47] [i2] [i1] [j32] [j28] [c43] [j24] [c36] [c33] [c31] [c30] [c28] [j15] [j14] [j13] [j12] [j11] [c21] [c19] [c18] [c16] [c12] [c11] [c8]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-12 21:36 CEST by the dblp team