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
2020 – today
- 2024
[j178]Leah Epstein
:
Tighter bounds for the harmonic bin packing algorithm. Eur. J. Oper. Res. 316(1): 72-84 (2024)- 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) - [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 - [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
- [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) - [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 - [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
- [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) - [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)
2010 – 2019
- 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) - [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 - [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
- [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) - [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 - [p1]Leah Epstein, Rob van Stee:
Multidimensional Packing Problems. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 553-570 - [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] - [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
- [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) - [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 - [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
- [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) - [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 - [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 - [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
- [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) - [c86]Leah Epstein, Elena Kleiman:
Selfish Vector Packing. ESA 2015: 471-482 - [i20]Ron Adar, Leah Epstein:
The weighted 2-metric dimension of trees in the non-landmarks model. CoRR abs/1501.05197 (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) - [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 - [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) - 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