Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeah Epstein
Person information
- affiliation: University of Haifa, Israel
- affiliation: Tel Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2023
[j177]Leah Epstein
, Loay Mualem:
Online Bin Packing of Squares and Cubes. Algorithmica 85(5): 1415-1458 (2023)- [j176]Leah Epstein:
More on online weighted edge coloring. Discret. Optim. 50: 100803 (2023) - [j175]Leah Epstein:
Parallel solutions for ordinal scheduling with a small number of machines. J. Comb. Optim. 46(1): 3 (2023) - [j174]Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder:
Online bin covering with limited migration. J. Comput. Syst. Sci. 134: 42-72 (2023) - [j173]Islam Akaria, Leah Epstein:
Bin stretching with migration on two hierarchical machines. Math. Methods Oper. Res. 98(1): 111-153 (2023) - [j172]Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder:
Online cardinality constrained scheduling. Oper. Res. Lett. 51(5): 533-539 (2023) - [j171]Leah Epstein:
Parallel solutions for preemptive makespan scheduling on two identical machines. J. Sched. 26(1): 61-76 (2023) - [j170]Leah Epstein:
Several methods of analysis for cardinality constrained bin packing. Theor. Comput. Sci. 942: 213-229 (2023) - 2022
- [j169]Leah Epstein, Asaf Levin:
Starting time minimization for the maximum job variant. Discret. Appl. Math. 307: 79-87 (2022) - [j168]Leah Epstein:
Open-end bin packing: New and old analysis approaches. Discret. Appl. Math. 321: 220-239 (2022) - [j167]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Lower bounds for batched bin packing. J. Comb. Optim. 43(3): 613-629 (2022) - [j166]Islam Akaria, Leah Epstein:
Online scheduling with migration on two hierarchical machines. J. Comb. Optim. 44(5): 3535-3548 (2022) - 2021
- [j165]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
A New Lower Bound for Classic Online Bin Packing. Algorithmica 83(7): 2047-2062 (2021) - [j164]Leah Epstein, Elena Kleiman:
Selfish Vector Packing. Algorithmica 83(9): 2952-2988 (2021) - [j163]Leah Epstein:
On bin packing with clustering and bin packing with delays. Discret. Optim. 41: 100647 (2021) - [j162]János Balogh, Leah Epstein, Asaf Levin:
More on ordered open end bin packing. J. Sched. 24(6): 589-614 (2021) - 2020
- [j161]György Dósa, Leah Epstein:
Quality of equilibria for selfish bin packing with cost sharing variants. Discret. Optim. 38: 100556 (2020) - [j160]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Online bin packing with cardinality constraints resolved. J. Comput. Syst. Sci. 112: 34-49 (2020) - [j159]Leah Epstein, Thomas Erlebach:
Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 64(4): 569-570 (2020) - [j158]Leah Epstein, Thomas Erlebach:
Correction to: Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 64(4): 571 (2020) - [j157]Leah Epstein, Asaf Levin:
A note on a variant of the online open end bin packing problem. Oper. Res. Lett. 48(6): 844-849 (2020) - [j156]Islam Akaria, Leah Epstein:
An optimal online algorithm for scheduling with general machine cost functions. J. Sched. 23(2): 155-162 (2020) - 2019
- [j155]Leah Epstein, Asaf Levin:
Robust algorithms for total completion time. Discret. Optim. 33: 70-86 (2019) - [j154]György Dósa, Leah Epstein:
A new lower bound on the price of anarchy of selfish bin packing. Inf. Process. Lett. 150: 6-12 (2019) - [j153]György Dósa, Leah Epstein:
Pareto optimal equilibria for selfish bin packing with uniform cost sharing. J. Comb. Optim. 37(3): 827-847 (2019) - [j152]Leah Epstein:
A lower bound for online rectangle packing. J. Comb. Optim. 38(3): 846-866 (2019) - [j151]Leah Epstein, Asaf Levin:
On the performance guarantee of First Fit for sum coloring. J. Comput. Syst. Sci. 99: 91-105 (2019) - [j150]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Lower Bounds for Several Online Variants of Bin Packing. Theory Comput. Syst. 63(8): 1757-1780 (2019) - [j149]György Dósa, Leah Epstein:
Quality of strong equilibria for selfish bin packing with uniform cost sharing. J. Sched. 22(4): 473-485 (2019) - [j148]János Balogh, Leah Epstein, Asaf Levin:
Lower bounds for online bin covering-type problems. J. Sched. 22(4): 487-497 (2019) - 2018
- [j147]Ron Adar, Leah Epstein:
The Metric Dimension of Two-Dimensional Extended Meshes. Acta Cybern. 23(3): 761-772 (2018) - [j146]György Dósa, Leah Epstein:
The Convergence Time for Selfish Bin Packing. Acta Cybern. 23(3): 853-865 (2018) - [j145]Martin Böhm, György Dósa, Leah Epstein, Jirí Sgall, Pavel Veselý:
Colored Bin Packing: Online Algorithms and Lower Bounds. Algorithmica 80(1): 155-184 (2018) - [j144]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Batch Coloring of Graphs. Algorithmica 80(11): 3293-3315 (2018) - [j143]Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann:
Improved bounds for randomized preemptive online matching. Inf. Comput. 259(1): 31-40 (2018) - [j142]Leah Epstein, David S. Johnson, Asaf Levin:
Min-Sum Bin Packing. J. Comb. Optim. 36(2): 508-531 (2018) - [j141]György Dósa, Leah Epstein:
The tight asymptotic approximation ratio of First Fit for bin packing with cardinality constraints. J. Comput. Syst. Sci. 96: 33-49 (2018) - [j140]Leah Epstein, Asaf Levin:
The benefit of preemption with respect to the ℓp norm. Oper. Res. Lett. 46(4): 462-468 (2018) - [j139]Leah Epstein:
A survey on makespan minimization in semi-online environments. J. Sched. 21(3): 269-284 (2018) - [j138]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Online-bounded analysis. J. Sched. 21(4): 429-441 (2018) - 2017
- [j137]Ron Adar, Leah Epstein:
The k-metric dimension. J. Comb. Optim. 34(1): 1-30 (2017) - [j136]Leah Epstein, Asaf Levin:
An AFPTAS for variable sized bin packing with general activation costs. J. Comput. Syst. Sci. 84: 79-96 (2017) - [j135]Leah Epstein, Ido Yatsiv:
Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times. J. Sched. 20(2): 115-127 (2017) - [j134]Leah Epstein, Asaf Levin, Alan J. Soper, Vitaly A. Strusevich:
Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines. SIAM J. Discret. Math. 31(1): 101-123 (2017) - [j133]Leah Epstein, Elena Kleiman:
Scheduling selfish jobs on multidimensional parallel machines. Theor. Comput. Sci. 694: 42-59 (2017) - 2016
- [j132]Leah Epstein, Lukasz Jez, Jirí Sgall, Rob van Stee:
Online Scheduling of Jobs with Fixed Start Times on Related Machines. Algorithmica 74(1): 156-176 (2016) - [j131]Leah Epstein, Elena Kleiman, Julián Mestre:
Parametric Packing of Selfish Items and the Subset Sum Algorithm. Algorithmica 74(1): 177-207 (2016) - [j130]Leah Epstein, Asaf Levin, Gerhard J. Woeginger:
Vertex Cover Meets Scheduling. Algorithmica 74(3): 1148-1173 (2016) - [j129]József Békési, György Dósa, Leah Epstein:
Bounds for online bin packing with cardinality constraints. Inf. Comput. 249: 190-204 (2016) - [j128]Leah Epstein, Hanan Zebedat-Haider:
Online scheduling of unit jobs on three machines with rejection: A tight result. Inf. Process. Lett. 116(3): 252-255 (2016) - [j127]Leah Epstein, Asaf Levin, Rob van Stee:
A Unified Approach to Truthful Scheduling on Related Machines. Math. Oper. Res. 41(1): 332-351 (2016) - [j126]Leah Epstein:
More on batched bin packing. Oper. Res. Lett. 44(2): 273-277 (2016) - [j125]Leah Epstein, Asaf Levin:
The benefit of preemption for single machine scheduling so as to minimize total weighted completion time. Oper. Res. Lett. 44(6): 772-774 (2016) - 2015
- [j124]Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György:
Online File Caching with Rejection Penalties. Algorithmica 71(2): 279-306 (2015) - [j123]Leah Epstein, Asaf Levin, Gerhard J. Woeginger:
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. Algorithmica 72(4): 1130-1171 (2015) - [j122]Ron Adar, Leah Epstein:
The weighted 2-metric dimension of trees in the non-landmarks model. Discret. Optim. 17: 123-135 (2015) - [j121]János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Zsolt Tuza:
Online Results for Black and White Bin Packing. Theory Comput. Syst. 56(1): 137-155 (2015) - [j120]Leah Epstein, Hanan Zebedat-Haider:
Rent or Buy Problems with a Fixed Time Horizon. Theory Comput. Syst. 56(2): 309-329 (2015) - [j119]János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Asaf Levin, Zsolt Tuza:
Offline black and white bin packing. Theor. Comput. Sci. 596: 92-101 (2015) - 2014
- [j118]Leah Epstein, Asaf Levin:
Robust Algorithms for Preemptive Scheduling. Algorithmica 69(1): 26-57 (2014) - [j117]Leah Epstein, Paolo Ferragina:
Guest Editorial: Selected Papers of European Symposium of Algorithms. Algorithmica 70(3): 365-367 (2014) - [j116]Leah Epstein, Elena Kleiman, Rob van Stee:
The cost of selfishness for maximizing the minimum load on uniformly related machines. J. Comb. Optim. 27(4): 767-777 (2014) - [j115]Leah Epstein, Hanan Zebedat-Haider:
Online scheduling with rejection and reordering: exact algorithms for unit size jobs. J. Comb. Optim. 28(4): 875-892 (2014) - [j114]Leah Epstein, Asaf Levin:
An efficient polynomial time approximation scheme for load balancing on uniformly related machines. Math. Program. 147(1-2): 1-23 (2014) - [j113]Leah Epstein, Hanan Zebedat-Haider:
Preemptive online scheduling with rejection of unit jobs on two uniformly related machines. J. Sched. 17(1): 87-93 (2014) - [j112]Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir:
Packing resizable items with application to video delivery over wireless networks. Theor. Comput. Sci. 553: 91-105 (2014) - [j111]Sheng Zhang, Zhuzhong Qian, Jie Wu, Sanglu Lu, Leah Epstein:
Virtual Network Embedding with Opportunistic Resource Sharing. IEEE Trans. Parallel Distributed Syst. 25(3): 816-827 (2014) - 2013
- [j110]János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin:
Online Clustering with Variable Sized Clusters. Algorithmica 65(2): 251-274 (2013) - [j109]Leah Epstein, Michal Feldman, Tami Tamir, Lukasz Witkowski, Marcin Witkowski:
Approximate strong equilibria in job scheduling games with two uniformly related machines. Discret. Appl. Math. 161(13-14): 1843-1858 (2013) - [j108]Leah Epstein, Csanád Imreh, Asaf Levin:
Bin covering with cardinality constraints. Discret. Appl. Math. 161(13-14): 1975-1987 (2013) - [j107]Leah Epstein, Asaf Levin:
Robust Approximation Schemes for Cube Packing. SIAM J. Optim. 23(2): 1310-1343 (2013) - [j106]Xujin Chen, Leah Epstein, Elena Kleiman, Rob van Stee:
Maximizing the minimum load: The cost of selfishness. Theor. Comput. Sci. 482: 9-19 (2013) - [j105]Ron Adar, Leah Epstein:
Selfish bin packing with cardinality constraints. Theor. Comput. Sci. 495: 66-80 (2013) - 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. Discret. Appl. Math. 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. Sched. 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]Leah Epstein, Asaf Levin:
On the max coloring problem. Theor. Comput. Sci. 462: 23-38 (2012) - 2011
- [j96]Leah Epstein, Elena Kleiman:
Selfish Bin Packing. Algorithmica 60(2): 368-394 (2011) - [j95]Leah Epstein, Lene M. Favrholdt, Asaf Levin:
Online variable-sized bin packing with conflicts. Discret. Optim. 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. Discret. Math. 25(1): 21-49 (2011) - [j90]Leah Epstein, Asaf Levin, Rob van Stee:
Max-min Online Allocations with a Reordering Buffer. SIAM J. Discret. 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. Discret. 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) - 2010
- [j87]Leah Epstein:
Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy. Acta Informatica 47(7-8): 375-389 (2010) - [j86]Leah Epstein:
Bin Packing with Rejection Revisited. Algorithmica 56(4): 505-528 (2010) - [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. Discret. Appl. Math. 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 J. Optim. 20(6): 3121-3145 (2010) - [j77]Leah Epstein, Rob van Stee:
On the online unit clustering problem. ACM Trans. Algorithms 7(1): 7:1-7:18 (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) - 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. Discret. Appl. Math. 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. Discret. 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) - 2008
- [j62]Leah Epstein, Asaf Levin, Rob van Stee:
Two-dimensional packing with conflicts. Acta Informatica 45(3): 155-175 (2008) - [j61]Leah Epstein, Asaf Levin:
A PTAS for delay minimization in establishing wireless conference calls. Discret. Optim. 5(1): 88-96 (2008) - [j60]Leah Epstein, Asaf Levin:
More on online bin packing with two item sizes. Discret. Optim. 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 J. Optim. 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) - 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. Discret. Optim. 4(2): 185-197 (2007) - [j47]Leah Epstein, Rob van Stee:
Online bin packing with resource augmentation. Discret. Optim. 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, Jirí Sgall, Rob van Stee:
Paging with connections: FIFO strikes again. Theor. Comput. Sci. 377(1-3): 55-64 (2007) - 2006
- [j43]Leah Epstein, Tamir Tassa:
Vector assignment schemes for asymmetric settings. Acta Informatica 42(6-7): 501-514 (2006) - [j42]Leah Epstein, Rob van Stee:
Optimal on-line flow time with resource augmentation. Discret. Appl. Math. 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. Discret. Math. 20(4): 1015-1030 (2006) - [j38]Leah Epstein, Rob van Stee:
Online scheduling of splittable tasks. ACM Trans. Algorithms 2(1): 79-94 (2006) - [j37]Leah Epstein, Rob van Stee:
This side up! ACM Trans. Algorithms 2(2): 228-243 (2006) - [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) - 2005
- [j32]Leah Epstein, Rob van Stee:
Online square and cube packing. Acta Informatica 41(9): 595-606 (2005) - [j31]Leah Epstein:
Tight bounds for bandwidth allocation on two links. Discret. Appl. Math. 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) - 2004
- [j26]Leah Epstein, Tamir Tassa:
Approximation schemes for the Min-Max Starting Time Problem. Acta Informatica 40(9): 657-674 (2004) - [j25]Leah Epstein, Jirí 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. Discret. Math. 18(2): 347-352 (2004) - 2003
- [j21]Leah Epstein:
Bin stretching revisited. Acta Informatica 39(2): 97-117 (2003) - [j20]Leah Epstein:
On variable sized vector packing. Acta Cybern. 16(1): 47-56 (2003) - [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, Jirí 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. Sched. 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. 299(1-3): 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) - 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. Discret. Appl. Math. 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) - 2001
- [j6]Leah Epstein:
Online Variable Sized Covering. Inf. Comput. 171(2): 294-305 (2001) - [j5]Leah Epstein:
Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios. Oper. Res. Lett. 29(2): 93-98 (2001) - 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, Jirí Sgall:
A lower bound for on-line scheduling on uniformly related machines. Oper. Res. Lett. 26(1): 17-22 (2000) - 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) - 1997
- [j1]Yossi Azar, Leah Epstein:
On Two Dimensional Packing. J. Algorithms 25(2): 290-310 (1997)
Conference and Workshop Papers
- 2022
- [c98]János Balogh, György Dósa, Leah Epstein, Lukasz Jez:
Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems. IWOCA 2022: 101-113 - [c97]Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder:
Cardinality Constrained Scheduling in Online Models. STACS 2022: 28:1-28:15 - 2021
- [c96]János Balogh, Ilan Reuven Cohen, Leah Epstein, Asaf Levin:
Truly Asymptotic Lower Bounds for Online Vector Bin Packing. APPROX-RANDOM 2021: 8:1-8:18 - [c95]Leah Epstein, Loay Mualem:
Online Bin Packing of Squares and Cubes. WADS 2021: 357-370 - [c94]Leah Epstein:
Several Methods of Analysis for Cardinality Constrained Bin Packing. WAOA 2021: 117-129 - 2019
- [c93]Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder:
Online Bin Covering with Limited Migration. ESA 2019: 18:1-18:14 - [c92]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
A New Lower Bound for Classic Online Bin Packing. WAOA 2019: 18-28 - 2018
- [c91]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
A New and Improved Algorithm for Online Bin Packing. ESA 2018: 5:1-5:14 - 2017
- [c90]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Online Bin Packing with Cardinality Constraints Resolved. ESA 2017: 10:1-10:14 - [c89]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Lower Bounds for Several Online Variants of Bin Packing. WAOA 2017: 102-117 - 2016
- [c88]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Online Bounded Analysis. CSR 2016: 131-145 - [c87]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Batch Coloring of Graphs. WAOA 2016: 52-64 - 2015
- [c86]Leah Epstein, Elena Kleiman:
Selfish Vector Packing. ESA 2015: 471-482 - 2014
- [c85]György Dósa, Leah Epstein:
The Convergence Time for Selfish Bin Packing. SAGT 2014: 37-48 - [c84]Leah Epstein, Elena Kleiman:
Scheduling selfish jobs on multidimensional parallel machines. SPAA 2014: 108-117 - [c83]György Dósa, Leah Epstein:
Colorful Bin Packing. SWAT 2014: 170-181 - 2013
- [c82]Leah Epstein:
Bin Packing Games with Selfish Items. MFCS 2013: 8-21 - [c81]Leah Epstein, Hanan Zebedat-Haider:
Rent or Buy Problems with a Fixed Time Horizon. MFCS 2013: 361-372 - [c80]Leah Epstein, Asaf Levin, Rob van Stee:
A unified approach to truthful scheduling on related machines. SODA 2013: 1243-1252 - [c79]Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann:
Improved Bounds for Online Preemptive Matching. STACS 2013: 389-399 - 2012
- [c78]Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir:
Packing Resizable Items with Application to Video Delivery over Wireless Networks. ALGOSENSORS 2012: 6-17 - [c77]Leah Epstein, Lukasz Jez, Jirí Sgall, Rob van Stee:
Online Scheduling of Jobs with Fixed Start Times on Related Machines. APPROX-RANDOM 2012: 134-145 - [c76]Leah Epstein, Asaf Levin, Gerhard J. Woeginger:
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. WG 2012: 114-125 - 2011
- [c75]Leah Epstein, Elena Kleiman:
On the quality and complexity of pareto equilibria in the job scheduling game. AAMAS 2011: 525-532 - [c74]Leah Epstein, Asaf Levin:
Robust Algorithms for Preemptive Scheduling. ESA 2011: 567-578 - [c73]Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György:
On Variants of File Caching. ICALP (1) 2011: 195-206 - 2010
- [c72]Ramin Yahyapour, Raffaele Perego, Frédéric Desprez, Leah Epstein, Francesc Guim Bernat:
Scheduling and Load Balancing. Euro-Par (1) 2010: 156 - [c71]Leah Epstein, Asaf Levin, Rob van Stee:
Max-min Online Allocations with a Reordering Buffer. ICALP (1) 2010: 336-347 - [c70]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 - [c69]János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin:
Online Clustering with Variable Sized Clusters. MFCS 2010: 282-293 - [c68]Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev:
Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. STACS 2010: 347-358 - 2009
- [c67]György Dósa, Leah Epstein:
Preemptive Online Scheduling with Reordering. ESA 2009: 456-467 - [c66]Leah Epstein, Asaf Levin:
On Equilibria for ADM Minimization Games. SAGT 2009: 347-358 - [c65]Leah Epstein, Elena Kleiman, Julián Mestre:
Parametric Packing of Selfish Items and the Subset Sum Algorithm. WINE 2009: 67-78 - [c64]Leah Epstein, Elena Kleiman, Rob van Stee:
Maximizing the Minimum Load: The Cost of Selfishness. WINE 2009: 232-243 - 2008
- [c63]Leah Epstein, Elena Kleiman:
Selfish Bin Packing. ESA 2008: 368-380 - [c62]Leah Epstein, Asaf Levin:
Improved Randomized Results for That Interval Selection Problem. ESA 2008: 381-392 - [c61]Leah Epstein, Rob van Stee:
Maximizing the Minimum Load for Selfish Agents. LATIN 2008: 264-275 - [c60]Leah Epstein, Rob van Stee:
The Price of Anarchy on Uniformly Related Machines Revisited. SAGT 2008: 46-57 - [c59]Leah Epstein, Amos Fiat, Meital Levy:
Caching Content under Digital Rights Management. WAOA 2008: 188-200 - 2007
- [c58]Leah Epstein, Rob van Stee:
Preemptive Scheduling on Selfish Machines. CAAN 2007: 57-70 - [c57]Leah Epstein, Thomas Erlebach, Asaf Levin:
Online Capacitated Interval Coloring. ESCAPE 2007: 243-254 - [c56]Leah Epstein, Asaf Levin, Rob van Stee:
Multi-dimensional Packing with Conflicts. FCT 2007: 288-299 - [c55]Leah Epstein, Rob van Stee:
Improved Results for a Memory Allocation Problem. WADS 2007: 362-373 - [c54]Leah Epstein, Asaf Levin:
On the Max Coloring Problem. WAOA 2007: 142-155 - [c53]Leah Epstein, Rob van Stee:
On the Online Unit Clustering Problem. WAOA 2007: 193-206 - [c52]Leah Epstein, Asaf Levin:
Minimum Weighted Sum Bin Packing. WAOA 2007: 218-231 - [c51]Leah Epstein, Rob van Stee:
Approximation Schemes for Packing Splittable Items with Cardinality Constraints. WAOA 2007: 232-245 - 2006
- [c50]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 - [c49]Leah Epstein, Asaf Levin, Gerhard J. Woeginger:
Graph Coloring with Rejection. ESA 2006: 364-375 - [c48]Leah Epstein, Asaf Levin:
A Robust APTAS for the Classical Bin Packing Problem. ICALP (1) 2006: 214-225 - [c47]Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir:
Transactional contention management as a non-clairvoyant scheduling problem. PODC 2006: 308-315 - [c46]Leah Epstein, Thomas Erlebach, Asaf Levin:
Variable Sized Online Interval Coloring with Bandwidth. SWAT 2006: 29-40 - [c45]Leah Epstein, Rob van Stee, Tami Tamir:
Paging with Request Sets. SWAT 2006: 124-135 - [c44]Leah Epstein:
Bin Packing with Rejection Revisited. WAOA 2006: 146-159 - [c43]Leah Epstein, Asaf Levin:
On Bin Packing with Conflicts. WAOA 2006: 160-173 - 2005
- [c42]Leah Epstein:
Online Bin Packing with Cardinality Constraints. ESA 2005: 604-615 - [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]Leah Epstein, Meital Levy:
Online Interval Coloring and Variants. ICALP 2005: 602-613 - [c39]Leah Epstein, Meital Levy:
Online Interval Coloring with Packing Constraints. MFCS 2005: 295-307 - [c38]Leah Epstein, Asaf Levin:
SONET ADMs Minimization with Divisible Paths. WAOA 2005: 119-132 - [c37]Leah Epstein, Asaf Levin:
The Conference Call Search Problem in Wireless Networks. WAOA 2005: 133-146 - 2004
- [c36]Leah Epstein, Rob van Stee:
On Variable-Sized Multidimensional Packing. ESA 2004: 287-298 - [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]Leah Epstein, Rob van Stee:
Online Bin Packing with Resource Augmentation. WAOA 2004: 23-35 - [c29]Leah Epstein, Asaf Levin:
A PTAS for Delay Minimization in Establishing Wireless Conference Calls. WAOA 2004: 36-47 - [c28]Leah Epstein, Rob van Stee:
This Side Up! WAOA 2004: 48-60 - [c27]Leah Epstein, Asaf Levin:
Better Bounds for Minimizing SONET ADMs. WAOA 2004: 281-294 - 2003
- [c26]Leah Epstein:
Two Dimensional Packing: The Power of Rotation. MFCS 2003: 398-407 - [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
- [c22]Leah Epstein, Lene M. Favrholdt:
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins. COCOON 2002: 467-475 - [c21]Leah Epstein, Rob van Stee:
Minimizing the Maximum Starting Time On-line. ESA 2002: 449-460 - [c20]Leah Epstein, Tamir Tassa:
Vector Assignment Problems: A General Framework. ESA 2002: 461-472 - [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, Jirí 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
- [c13]Leah Epstein:
On-Line Variable Sized Covering. COCOON 2001: 463-472 - [c12]Leah Epstein, Rob van Stee:
Optimal Online Flow Time with Resource Augmentation. FCT 2001: 472-482 - [c11]Leah Epstein, Rob van Stee:
Lower Bounds for On-Line Single-Machine Scheduling. MFCS 2001: 338-350 - [c10]Leah Epstein:
Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios. STACS 2001: 230-237 - 2000
- [c9]Yossi Azar, Leah Epstein:
On-Line Scheduling with Precedence Constraints. SWAT 2000: 164-174 - [c8]Yossi Azar, Leah Epstein, Rob van Stee:
Resource Augmentation in Load Balancing. SWAT 2000: 189-199 - 1999
- [c7]Leah Epstein, Jirí Sgall:
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines. ESA 1999: 151-162 - [c6]Leah Epstein, John Noga, Steven S. Seiden, Jirí Sgall, Gerhard J. Woeginger:
Randomized Online Scheduling on Two Uniform Machines. SODA 1999: 317-326 - 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
- [c3]Yossi Azar, Leah Epstein:
On-Line Machine Covering. ESA 1997: 23-36 - [c2]Yossi Azar, Leah Epstein:
On-Line Load Balancing of Temporary Tasks on Identical Machines. ISTCS 1997: 119-125 - 1996
- [c1]Yossi Azar, Leah Epstein:
On Two Dimensional Packing. SWAT 1996: 321-332
Parts in Books or Collections
- 2018
- [p1]Leah Epstein, Rob van Stee:
Multidimensional Packing Problems. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 553-570
Editorship
- 2018
- [e2]Leah Epstein, Thomas Erlebach:
Approximation and Online Algorithms - 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers. Lecture Notes in Computer Science 11312, Springer 2018, ISBN 978-3-030-04692-7 [contents] - 2012
- [e1]Leah Epstein, Paolo Ferragina:
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 [contents]
Reference Works
- 2016
- [r10]Leah Epstein:
Bin Packing, Variants. Encyclopedia of Algorithms 2016: 214-216 - [r9]Leah Epstein:
Harmonic Algorithm for Online Bin Packing. Encyclopedia of Algorithms 2016: 900-902 - [r8]Leah Epstein:
List Scheduling. Encyclopedia of Algorithms 2016: 1121-1124 - [r7]Leah Epstein:
Online Interval Coloring. Encyclopedia of Algorithms 2016: 1439-1443 - [r6]Leah Epstein:
Online Load Balancing of Temporary Tasks. Encyclopedia of Algorithms 2016: 1452-1455 - [r5]Leah Epstein:
Selfish Bin Packing Problems. Encyclopedia of Algorithms 2016: 1927-1930 - 2008
- [r4]Leah Epstein:
List Scheduling. Encyclopedia of Algorithms 2008 - [r3]Leah Epstein:
Load Balancing. Encyclopedia of Algorithms 2008 - [r2]Leah Epstein:
Online Interval Coloring. Encyclopedia of Algorithms 2008 - 2007
- [r1]Leah Epstein, Rob van Stee:
Multidimensional Packing Problems. Handbook of Approximation Algorithms and Metaheuristics 2007
Informal and Other Publications
- 2022
- [i40]Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder:
Cardinality Constrained Scheduling in Online Models. CoRR abs/2201.05113 (2022) - [i39]János Balogh, György Dósa, Leah Epstein, Lukasz Jez:
Lower bounds on the performance of online algorithms for relaxed packing problems. CoRR abs/2201.05999 (2022) - [i38]Islam Akaria, Leah Epstein:
Bin stretching with migration on two hierarchical machines. CoRR abs/2206.06102 (2022) - [i37]Leah Epstein:
Parallel solutions for preemptive makespan scheduling on two identical machines. CoRR abs/2210.05543 (2022) - [i36]Leah Epstein:
Parallel solutions for ordinal scheduling with a small number of machines. CoRR abs/2210.07639 (2022) - 2021
- [i35]Leah Epstein:
Open-end bin packing: new and old analysis approaches. CoRR abs/2105.05923 (2021) - [i34]Leah Epstein, Loay Mualem:
Online bin packing of squares and cubes. CoRR abs/2105.08763 (2021) - [i33]Leah Epstein:
Several methods of analysis for cardinality constrained bin packing. CoRR abs/2107.08725 (2021) - 2020
- [i32]János Balogh, Leah Epstein, Asaf Levin:
Truly asymptotic lower bounds for online vector bin packing. CoRR abs/2008.00811 (2020) - [i31]János Balogh, Leah Epstein, Asaf Levin:
More on ordered open end bin packing. CoRR abs/2010.07119 (2020) - 2019
- [i30]Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder:
Online Bin Covering with Limited Migration. CoRR abs/1904.06543 (2019) - [i29]Leah Epstein:
On bin packing with clustering and bin packing with delays. CoRR abs/1908.06727 (2019) - 2018
- [i28]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
A new lower bound for classic online bin packing. CoRR abs/1807.05554 (2018) - [i27]Leah Epstein:
A lower bound for online rectangle packing. CoRR abs/1811.09573 (2018) - 2017
- [i26]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
A new and improved algorithm for online bin packing. CoRR abs/1707.01728 (2017) - [i25]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Lower bounds for several online variants of bin packing. CoRR abs/1708.03228 (2017) - 2016
- [i24]Ron Adar, Leah Epstein:
An algorithm for the weighted metric dimension of two-dimensional grids. CoRR abs/1602.05899 (2016) - [i23]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Online Bounded Analysis. CoRR abs/1602.06708 (2016) - [i22]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Online bin packing with cardinality constraints resolved. CoRR abs/1608.06415 (2016) - [i21]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Batch Coloring of Graphs. CoRR abs/1610.02997 (2016) - 2015
- [i20]Ron Adar, Leah Epstein:
The weighted 2-metric dimension of trees in the non-landmarks model. CoRR abs/1501.05197 (2015) - 2014
- [i19]György Dósa, Leah Epstein:
Online bin packing with cardinality constraints revisited. CoRR abs/1404.1056 (2014) - [i18]Leah Epstein, Asaf Levin:
Minimum total weighted completion time: Faster approximation schemes. CoRR abs/1404.1059 (2014) - [i17]György Dósa, Leah Epstein:
Colorful bin packing. CoRR abs/1404.3990 (2014) - [i16]Ron Adar, Leah Epstein:
Models for the k-metric dimension. CoRR abs/1410.4209 (2014) - 2012
- [i15]Leah Epstein, Asaf Levin:
An efficient polynomial time approximation scheme for load balancing on uniformly related machines. CoRR abs/1202.4072 (2012) - [i14]György Dósa, Leah Epstein:
Generalized selfish bin packing. CoRR abs/1202.4080 (2012) - [i13]Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann:
Improved Bounds for Online Preemptive Matching. CoRR abs/1207.1788 (2012) - [i12]Leah Epstein, Asaf Levin, Rob van Stee:
A unified approach to truthful scheduling on related machines. CoRR abs/1207.3523 (2012) - 2009
- [i11]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) - [i10]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) - [i9]Leah Epstein, Asaf Levin:
Bin packing with general cost structures. CoRR abs/0906.5051 (2009) - [i8]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) - [i7]Leah Epstein, Elena Kleiman, Julián Mestre:
Parametric packing of selfish items and the subset sum algorithm. CoRR abs/0907.4311 (2009) - 2007
- [i6]Leah Epstein:
Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy. Fair Division 2007 - [i5]Leah Epstein, Rob van Stee:
Maximizing the Minimum Load for Selfisch Agents. Fair Division 2007 - 2006
- [i4]Leah Epstein, Rob van Stee:
Covering selfish machines. CoRR abs/cs/0610026 (2006) - [i3]Leah Epstein, Rob van Stee:
Improved results for a memory allocation problem. CoRR abs/cs/0612100 (2006) - 2005
- [i2]Leah Epstein, Asaf Levin:
Tracking mobile users. Algorithms for Optimization with Incomplete Information 2005 - [i1]Leah Epstein, Rob van Stee:
Online scheduling of splittable tasks. Algorithms for Optimization with Incomplete Information 2005
Coauthor Index
[j174] [j172] [j169] [j167] [j165] [j162] [j160] [j157] [j155] [j151] [j150] [j148] [j144] [j143] [j142] [j140] [j138] [j136] [j134] [j130] [j127] [j125] [j124] [j123] [j119] [j118] [j114] [j110] [j108] [j107] [j104] [j103] [j100] [j98] [j97] [j95] [j94] [j93] [j90] [j89] [j84] [j83] [j82] [j79] [j78] [j75] [j73] [j72] [j71] [j70] [j68] [j67] [j65] [j62] [j61] [j60] [j57] [j54] [j53] [j52] [j50] [j36] [j27] [c97] [c96] [c93] [c92] [c91] [c90] [c89] [c88] [c87] [c80] [c79] [c76] [c74] [c73] [c71] [c70] [c69] [c68] [c66] [c62] [c57] [c56] [c54] [c52] [c50] [c49] [c48] [c46] [c43] [c38] [c37] [c29] [c27] [i40] [i32] [i31] [i30] [i28] [i26] [i25] [i23] [i22] [i21] [i18] [i15] [i13] [i12] [i10] [i9] [i8] [i2]
[j132] [j127] [j116] [j106] [j104] [j101] [j92] [j90] [j77] [j76] [j66] [j62] [j52] [j49] [j48] [j47] [j44] [j42] [j38] [j37] [j32] [j28] [j24] [j15] [j14] [j13] [j12] [j11] [c80] [c77] [c71] [c64] [c61] [c60] [c58] [c56] [c55] [c53] [c51] [c45] [c36] [c33] [c31] [c30] [c28] [c21] [c19] [c18] [c16] [c12] [c11] [c8] [p1] [r1] [i12] [i5] [i4] [i3] [i1]
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-01-14 23:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
