Leah Epstein

ORCID

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 86

Top Venues

Publications

Leah Epstein
Tighter bounds for the harmonic bin packing algorithm. Eur. J. Oper. Res. 316 (1) (2024)
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
Online cardinality constrained scheduling. Oper. Res. Lett. 51 (5) (2023)
Leah Epstein
Parallel solutions for preemptive makespan scheduling on two identical machines. J. Sched. 26 (1) (2023)
Leah Epstein
Several methods of analysis for cardinality constrained bin packing. Theor. Comput. Sci. 942 (2023)
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
Online bin covering with limited migration. J. Comput. Syst. Sci. 134 (2023)
Leah Epstein, Loay Mualem
Online Bin Packing of Squares and Cubes. Algorithmica 85 (5) (2023)
Leah Epstein
More on online weighted edge coloring. Discret. Optim. 50 (2023)
Islam Akaria, Leah Epstein
Bin stretching with migration on two hierarchical machines. Math. Methods Oper. Res. 98 (1) (2023)
Leah Epstein
Parallel solutions for ordinal scheduling with a small number of machines. J. Comb. Optim. 46 (1) (2023)
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
Cardinality Constrained Scheduling in Online Models. STACS (2022)
Leah Epstein
Parallel solutions for preemptive makespan scheduling on two identical machines. CoRR (2022)
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) (2022)
Leah Epstein
Open-end bin packing: New and old analysis approaches. Discret. Appl. Math. 321 (2022)
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
Cardinality Constrained Scheduling in Online Models. CoRR (2022)
János Balogh, György Dósa, Leah Epstein, Lukasz Jez
Lower bounds on the performance of online algorithms for relaxed packing problems. CoRR (2022)
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)
Islam Akaria, Leah Epstein
Bin stretching with migration on two hierarchical machines. CoRR (2022)
Islam Akaria, Leah Epstein
Online scheduling with migration on two hierarchical machines. J. Comb. Optim. 44 (5) (2022)
Leah Epstein
Parallel solutions for ordinal scheduling with a small number of machines. CoRR (2022)
Leah Epstein, Asaf Levin
Starting time minimization for the maximum job variant. Discret. Appl. Math. 307 (2022)
János Balogh, Leah Epstein, Asaf Levin
More on ordered open end bin packing. J. Sched. 24 (6) (2021)
Leah Epstein, Loay Mualem
Online Bin Packing of Squares and Cubes. WADS (2021)
János Balogh, Ilan Reuven Cohen, Leah Epstein, Asaf Levin
Truly Asymptotic Lower Bounds for Online Vector Bin Packing. APPROX-RANDOM (2021)
Leah Epstein, Loay Mualem
Online bin packing of squares and cubes. CoRR (2021)
Leah Epstein
Several Methods of Analysis for Cardinality Constrained Bin Packing. WAOA (2021)
Leah Epstein, Elena Kleiman
Selfish Vector Packing. Algorithmica 83 (9) (2021)
Leah Epstein
Several methods of analysis for cardinality constrained bin packing. CoRR (2021)
Leah Epstein
On bin packing with clustering and bin packing with delays. Discret. Optim. 41 (2021)
Leah Epstein
Open-end bin packing: new and old analysis approaches. CoRR (2021)
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) (2021)
Leah Epstein, Thomas Erlebach
Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 64 (4) (2020)
Leah Epstein, Asaf Levin
A note on a variant of the online open end bin packing problem. Oper. Res. Lett. 48 (6) (2020)
János Balogh, Leah Epstein, Asaf Levin
More on ordered open end bin packing. CoRR (2020)
Islam Akaria, Leah Epstein
An optimal online algorithm for scheduling with general machine cost functions. J. Sched. 23 (2) (2020)
János Balogh, Leah Epstein, Asaf Levin
Truly asymptotic lower bounds for online vector bin packing. CoRR (2020)
György Dósa, Leah Epstein
Quality of equilibria for selfish bin packing with cost sharing variants. Discret. Optim. 38 (2020)
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 (2020)
Leah Epstein, Thomas Erlebach
Correction to: Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 64 (4) (2020)
György Dósa, Leah Epstein
Quality of strong equilibria for selfish bin packing with uniform cost sharing. J. Sched. 22 (4) (2019)
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
Online Bin Covering with Limited Migration. CoRR (2019)
Leah Epstein
A lower bound for online rectangle packing. J. Comb. Optim. 38 (3) (2019)
János Balogh, Leah Epstein, Asaf Levin
Lower bounds for online bin covering-type problems. J. Sched. 22 (4) (2019)
Leah Epstein, Asaf Levin
Robust algorithms for total completion time. Discret. Optim. 33 (2019)
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) (2019)
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)
Leah Epstein, Asaf Levin
On the performance guarantee of First Fit for sum coloring. J. Comput. Syst. Sci. 99 (2019)
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
Online Bin Covering with Limited Migration. ESA (2019)
György Dósa, Leah Epstein
A new lower bound on the price of anarchy of selfish bin packing. Inf. Process. Lett. 150 (2019)
György Dósa, Leah Epstein
Pareto optimal equilibria for selfish bin packing with uniform cost sharing. J. Comb. Optim. 37 (3) (2019)
Leah Epstein
On bin packing with clustering and bin packing with delays. CoRR (2019)
Leah Epstein, Asaf Levin
The benefit of preemption with respect to the ℓp norm. Oper. Res. Lett. 46 (4) (2018)
Leah Epstein, David S. Johnson, Asaf Levin
Min-Sum Bin Packing. J. Comb. Optim. 36 (2) (2018)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Online-bounded analysis. J. Sched. 21 (4) (2018)
György Dósa, Leah Epstein
The Convergence Time for Selfish Bin Packing. Acta Cybern. 23 (3) (2018)
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 (2018)
Ron Adar, Leah Epstein
The Metric Dimension of Two-Dimensional Extended Meshes. Acta Cybern. 23 (3) (2018)
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)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Batch Coloring of Graphs. Algorithmica 80 (11) (2018)
Leah Epstein
A survey on makespan minimization in semi-online environments. J. Sched. 21 (3) (2018)
Leah Epstein
A lower bound for online rectangle packing. CoRR (2018)
Martin Böhm, György Dósa, Leah Epstein, Jirí Sgall, Pavel Veselý
Colored Bin Packing: Online Algorithms and Lower Bounds. Algorithmica 80 (1) (2018)
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 (2018)
Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
Improved bounds for randomized preemptive online matching. Inf. Comput. 259 (1) (2018)
Leah Epstein, Elena Kleiman
Scheduling selfish jobs on multidimensional parallel machines. Theor. Comput. Sci. 694 (2017)
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) (2017)
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)
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 (2017)
Ron Adar, Leah Epstein
The k-metric dimension. J. Comb. Optim. 34 (1) (2017)
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)
Leah Epstein, Asaf Levin
An AFPTAS for variable sized bin packing with general activation costs. J. Comput. Syst. Sci. 84 (2017)
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) (2017)
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 (2017)
Leah Epstein, Hanan Zebedat-Haider
Online scheduling of unit jobs on three machines with rejection: A tight result. Inf. Process. Lett. 116 (3) (2016)
Leah Epstein, Asaf Levin, Rob van Stee
A Unified Approach to Truthful Scheduling on Related Machines. Math. Oper. Res. 41 (1) (2016)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Online Bounded Analysis. CoRR (2016)
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) (2016)
Ron Adar, Leah Epstein
An algorithm for the weighted metric dimension of two-dimensional grids. CoRR (2016)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Online Bounded Analysis. CSR (2016)
József Békési, György Dósa, Leah Epstein
Bounds for online bin packing with cardinality constraints. Inf. Comput. 249 (2016)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Batch Coloring of Graphs. WAOA (2016)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Batch Coloring of Graphs. CoRR (2016)
Leah Epstein
More on batched bin packing. Oper. Res. Lett. 44 (2) (2016)
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
Online bin packing with cardinality constraints resolved. CoRR (2016)
Leah Epstein, Asaf Levin, Gerhard J. Woeginger
Vertex Cover Meets Scheduling. Algorithmica 74 (3) (2016)
Leah Epstein, Lukasz Jez, Jirí Sgall, Rob van Stee
Online Scheduling of Jobs with Fixed Start Times on Related Machines. Algorithmica 74 (1) (2016)
Leah Epstein, Elena Kleiman, Julián Mestre
Parametric Packing of Selfish Items and the Subset Sum Algorithm. Algorithmica 74 (1) (2016)
Leah Epstein, Asaf Levin, Gerhard J. Woeginger
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. Algorithmica 72 (4) (2015)
Ron Adar, Leah Epstein
The weighted 2-metric dimension of trees in the non-landmarks model. Discret. Optim. 17 (2015)
Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György
Online File Caching with Rejection Penalties. Algorithmica 71 (2) (2015)
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) (2015)
Leah Epstein, Hanan Zebedat-Haider
Rent or Buy Problems with a Fixed Time Horizon. Theory Comput. Syst. 56 (2) (2015)
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 (2015)
Leah Epstein, Elena Kleiman
Selfish Vector Packing. ESA (2015)
Ron Adar, Leah Epstein
The weighted 2-metric dimension of trees in the non-landmarks model. CoRR (2015)
Leah Epstein, Asaf Levin
Minimum total weighted completion time: Faster approximation schemes. CoRR (2014)
György Dósa, Leah Epstein
Online bin packing with cardinality constraints revisited. CoRR (2014)
György Dósa, Leah Epstein
Colorful Bin Packing. SWAT (2014)
Leah Epstein, Hanan Zebedat-Haider
Preemptive online scheduling with rejection of unit jobs on two uniformly related machines. J. Sched. 17 (1) (2014)
Leah Epstein, Asaf Levin
Robust Algorithms for Preemptive Scheduling. Algorithmica 69 (1) (2014)
Leah Epstein, Hanan Zebedat-Haider
Online scheduling with rejection and reordering: exact algorithms for unit size jobs. J. Comb. Optim. 28 (4) (2014)

Leah Epstein.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Leah Epstein