Leah Epstein

339 papers A* 8A 22B 46C 2Misc 3Journal 220Unranked 27
YearRankTypeTitle / Venue / Authors
2026 J jnl
Lower bounds on the performance of online algorithms for relaxed packing problems.
Discret. Optim.
János Balogh, György Dósa, Leah Epstein, Lukasz Jez
2026 J jnl
Makespan minimization for ordinal cardinality constrained scheduling.
Discret. Appl. Math.
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
2026 J jnl
More on online cardinality constrained bin packing with small cardinality bounds.
Theor. Comput. Sci.
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2026 J jnl
Semi-online models for cardinality constrained bin packing.
J. Sched.
Leah Epstein, Asaf Levin
2025 B conf
An EPTAS for Minimizing the Total Weighted Completion Time of Jobs with Release Dates on Uniformly Related Machines.
MFCS
Leah Epstein, Asaf Levin
2025 B conf
An Efficient Polynomial Time Approximation Scheme for Minimizing the Total Weighted Completion Time on Uniformly Related Machines.
WADS
Leah Epstein, Asaf Levin
2025 A conf
Efficient Approximation Schemes for Scheduling on a Stochastic Number of Machines.
STACS
Leah Epstein, Asaf Levin
2025 B conf
Lower Bounds for Several Standard Bin Packing Algorithms in the Random Order Model.
WADS
Leah Epstein, Asaf Levin
2025 J jnl
Semi-online scheduling with non-increasing job sizes and a buffer.
J. Comb. Optim.
Leah Epstein, Hanan Zebedat-Haider
2024 J jnl
Efficient approximation schemes for scheduling on a stochastic number of machines.
CoRR
Leah Epstein, Asaf Levin
2024 J jnl
Tighter bounds for the harmonic bin packing algorithm.
Eur. J. Oper. Res.
Leah Epstein
2023 J jnl
Bin stretching with migration on two hierarchical machines.
Math. Methods Oper. Res.
Islam Akaria, Leah Epstein
2023 J jnl
More on online weighted edge coloring.
Discret. Optim.
Leah Epstein
2023 J jnl
Online Bin Packing of Squares and Cubes.
Algorithmica
Leah Epstein, Loay Mualem
2023 J jnl
Online bin covering with limited migration.
J. Comput. Syst. Sci.
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
2023 J jnl
Online cardinality constrained scheduling.
Oper. Res. Lett.
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
2023 J jnl
Parallel solutions for ordinal scheduling with a small number of machines.
J. Comb. Optim.
Leah Epstein
2023 J jnl
Parallel solutions for preemptive makespan scheduling on two identical machines.
J. Sched.
Leah Epstein
2023 J jnl
Several methods of analysis for cardinality constrained bin packing.
Theor. Comput. Sci.
Leah Epstein
2022 J jnl
Bin stretching with migration on two hierarchical machines.
CoRR
Islam Akaria, Leah Epstein
2022 A conf
Cardinality Constrained Scheduling in Online Models.
STACS
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
2022 J jnl
Cardinality Constrained Scheduling in Online Models.
CoRR
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
2022 C conf
Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems.
IWOCA
János Balogh, György Dósa, Leah Epstein, Lukasz Jez
2022 J jnl
Lower bounds for batched bin packing.
J. Comb. Optim.
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2022 J jnl
Lower bounds on the performance of online algorithms for relaxed packing problems.
CoRR
János Balogh, György Dósa, Leah Epstein, Lukasz Jez
2022 J jnl
Online scheduling with migration on two hierarchical machines.
J. Comb. Optim.
Islam Akaria, Leah Epstein
2022 J jnl
Open-end bin packing: New and old analysis approaches.
Discret. Appl. Math.
Leah Epstein
2022 J jnl
Parallel solutions for ordinal scheduling with a small number of machines.
CoRR
Leah Epstein
2022 J jnl
Parallel solutions for preemptive makespan scheduling on two identical machines.
CoRR
Leah Epstein
2022 J jnl
Starting time minimization for the maximum job variant.
Discret. Appl. Math.
Leah Epstein, Asaf Levin
2021 J jnl
A New Lower Bound for Classic Online Bin Packing.
Algorithmica
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2021 J jnl
More on ordered open end bin packing.
J. Sched.
János Balogh, Leah Epstein, Asaf Levin
2021 J jnl
On bin packing with clustering and bin packing with delays.
Discret. Optim.
Leah Epstein
2021 B conf
Online Bin Packing of Squares and Cubes.
WADS
Leah Epstein, Loay Mualem
2021 J jnl
Online bin packing of squares and cubes.
CoRR
Leah Epstein, Loay Mualem
2021 J jnl
Open-end bin packing: new and old analysis approaches.
CoRR
Leah Epstein
2021 J jnl
Selfish Vector Packing.
Algorithmica
Leah Epstein, Elena Kleiman
2021 B conf
Several Methods of Analysis for Cardinality Constrained Bin Packing.
WAOA
Leah Epstein
2021 J jnl
Several methods of analysis for cardinality constrained bin packing.
CoRR
Leah Epstein
2021 — conf
Truly Asymptotic Lower Bounds for Online Vector Bin Packing.
APPROX-RANDOM
János Balogh, Ilan Reuven Cohen, Leah Epstein, Asaf Levin
2020 J jnl
A note on a variant of the online open end bin packing problem.
Oper. Res. Lett.
Leah Epstein, Asaf Levin
2020 J jnl
An optimal online algorithm for scheduling with general machine cost functions.
J. Sched.
Islam Akaria, Leah Epstein
2020 J jnl
Correction to: Special Issue on Approximation and Online Algorithms.
Theory Comput. Syst.
Leah Epstein, Thomas Erlebach
2020 J jnl
More on ordered open end bin packing.
CoRR
János Balogh, Leah Epstein, Asaf Levin
2020 J jnl
Online bin packing with cardinality constraints resolved.
J. Comput. Syst. Sci.
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2020 J jnl
Quality of equilibria for selfish bin packing with cost sharing variants.
Discret. Optim.
György Dósa, Leah Epstein
2020 J jnl
Special Issue on Approximation and Online Algorithms.
Theory Comput. Syst.
Leah Epstein, Thomas Erlebach
2020 J jnl
Truly asymptotic lower bounds for online vector bin packing.
CoRR
János Balogh, Leah Epstein, Asaf Levin
2019 B conf
A New Lower Bound for Classic Online Bin Packing.
WAOA
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2019 J jnl
A lower bound for online rectangle packing.
J. Comb. Optim.
Leah Epstein
2019 J jnl
A new lower bound on the price of anarchy of selfish bin packing.
Inf. Process. Lett.
György Dósa, Leah Epstein
2019 J jnl
Lower Bounds for Several Online Variants of Bin Packing.
Theory Comput. Syst.
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2019 J jnl
Lower bounds for online bin covering-type problems.
J. Sched.
János Balogh, Leah Epstein, Asaf Levin
2019 J jnl
On bin packing with clustering and bin packing with delays.
CoRR
Leah Epstein
2019 J jnl
On the performance guarantee of First Fit for sum coloring.
J. Comput. Syst. Sci.
Leah Epstein, Asaf Levin
2019 A conf
Online Bin Covering with Limited Migration.
ESA
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
2019 J jnl
Online Bin Covering with Limited Migration.
CoRR
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
2019 J jnl
Pareto optimal equilibria for selfish bin packing with uniform cost sharing.
J. Comb. Optim.
György Dósa, Leah Epstein
2019 J jnl
Quality of strong equilibria for selfish bin packing with uniform cost sharing.
J. Sched.
György Dósa, Leah Epstein
2019 J jnl
Robust algorithms for total completion time.
Discret. Optim.
Leah Epstein, Asaf Levin
2018 A conf
A New and Improved Algorithm for Online Bin Packing.
ESA
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2018 J jnl
A lower bound for online rectangle packing.
CoRR
Leah Epstein
2018 J jnl
A new lower bound for classic online bin packing.
CoRR
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2018 J jnl
A survey on makespan minimization in semi-online environments.
J. Sched.
Leah Epstein
2018 B ed.
Approximation and Online Algorithms - 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers
WAOA
Leah Epstein, Thomas Erlebach
2018 J jnl
Batch Coloring of Graphs.
Algorithmica
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2018 J jnl
Colored Bin Packing: Online Algorithms and Lower Bounds.
Algorithmica
Martin Böhm, György Dósa, Leah Epstein, Jirí Sgall, Pavel Veselý
2018 J jnl
Improved bounds for randomized preemptive online matching.
Inf. Comput.
Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
2018 J jnl
Min-Sum Bin Packing.
J. Comb. Optim.
Leah Epstein, David S. Johnson, Asaf Levin
2018 — ch.
Multidimensional Packing Problems.
Handbook of Approximation Algorithms and Metaheuristics (1)
Leah Epstein, Rob van Stee
2018 J jnl
Online-bounded analysis.
J. Sched.
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2018 J jnl
The Convergence Time for Selfish Bin Packing.
Acta Cybern.
György Dósa, Leah Epstein
2018 J jnl
The Metric Dimension of Two-Dimensional Extended Meshes.
Acta Cybern.
Ron Adar, Leah Epstein
2018 J jnl
The benefit of preemption with respect to the ℓp norm.
Oper. Res. Lett.
Leah Epstein, Asaf Levin
2018 J jnl
The tight asymptotic approximation ratio of First Fit for bin packing with cardinality constraints.
J. Comput. Syst. Sci.
György Dósa, Leah Epstein
2017 J jnl
A new and improved algorithm for online bin packing.
CoRR
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2017 J jnl
An AFPTAS for variable sized bin packing with general activation costs.
J. Comput. Syst. Sci.
Leah Epstein, Asaf Levin
2017 B conf
Lower Bounds for Several Online Variants of Bin Packing.
WAOA
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2017 J jnl
Lower bounds for several online variants of bin packing.
CoRR
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2017 A conf
Online Bin Packing with Cardinality Constraints Resolved.
ESA
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2017 J jnl
Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines.
SIAM J. Discret. Math.
Leah Epstein, Asaf Levin, Alan J. Soper, Vitaly A. Strusevich
2017 J jnl
Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times.
J. Sched.
Leah Epstein, Ido Yatsiv
2017 J jnl
Scheduling selfish jobs on multidimensional parallel machines.
Theor. Comput. Sci.
Leah Epstein, Elena Kleiman
2017 J jnl
The k-metric dimension.
J. Comb. Optim.
Ron Adar, Leah Epstein
2016 J jnl
A Unified Approach to Truthful Scheduling on Related Machines.
Math. Oper. Res.
Leah Epstein, Asaf Levin, Rob van Stee
2016 J jnl
An algorithm for the weighted metric dimension of two-dimensional grids.
CoRR
Ron Adar, Leah Epstein
2016 B conf
Batch Coloring of Graphs.
WAOA
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016 J jnl
Batch Coloring of Graphs.
CoRR
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016 — ch.
Bin Packing, Variants.
Encyclopedia of Algorithms
Leah Epstein
2016 J jnl
Bounds for online bin packing with cardinality constraints.
Inf. Comput.
József Békési, György Dósa, Leah Epstein
2016 — ch.
Harmonic Algorithm for Online Bin Packing.
Encyclopedia of Algorithms
Leah Epstein
2016 — ch.
List Scheduling.
Encyclopedia of Algorithms
Leah Epstein
2016 J jnl
More on batched bin packing.
Oper. Res. Lett.
Leah Epstein
2016 Misc conf
Online Bounded Analysis.
CSR
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016 J jnl
Online Bounded Analysis.
CoRR
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016 — ch.
Online Interval Coloring.
Encyclopedia of Algorithms
Leah Epstein
2016 — ch.
Online Load Balancing of Temporary Tasks.
Encyclopedia of Algorithms
Leah Epstein
2016 J jnl
Online Scheduling of Jobs with Fixed Start Times on Related Machines.
Algorithmica
Leah Epstein, Lukasz Jez, Jirí Sgall, Rob van Stee
2016 J jnl
Online bin packing with cardinality constraints resolved.
CoRR
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2016 J jnl
Online scheduling of unit jobs on three machines with rejection: A tight result.
Inf. Process. Lett.
Leah Epstein, Hanan Zebedat-Haider
2016 J jnl
Parametric Packing of Selfish Items and the Subset Sum Algorithm.
Algorithmica
Leah Epstein, Elena Kleiman, Julián Mestre
2016 — ch.
Selfish Bin Packing Problems.
Encyclopedia of Algorithms
Leah Epstein
2016 J jnl
The benefit of preemption for single machine scheduling so as to minimize total weighted completion time.
Oper. Res. Lett.
Leah Epstein, Asaf Levin
2016 J jnl
Vertex Cover Meets Scheduling.
Algorithmica
Leah Epstein, Asaf Levin, Gerhard J. Woeginger
2015 J jnl
Offline black and white bin packing.
Theor. Comput. Sci.
János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Asaf Levin, Zsolt Tuza
2015 J jnl
Online File Caching with Rejection Penalties.
Algorithmica
Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György
2015 J jnl
Online Results for Black and White Bin Packing.
Theory Comput. Syst.
János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Zsolt Tuza
2015 J jnl
Rent or Buy Problems with a Fixed Time Horizon.
Theory Comput. Syst.
Leah Epstein, Hanan Zebedat-Haider
2015 A conf
Selfish Vector Packing.
ESA
Leah Epstein, Elena Kleiman
2015 J jnl
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases.
Algorithmica
Leah Epstein, Asaf Levin, Gerhard J. Woeginger
2015 J jnl
The weighted 2-metric dimension of trees in the non-landmarks model.
CoRR
Ron Adar, Leah Epstein
2015 J jnl
The weighted 2-metric dimension of trees in the non-landmarks model.
Discret. Optim.
Ron Adar, Leah Epstein
2014 J jnl
An efficient polynomial time approximation scheme for load balancing on uniformly related machines.
Math. Program.
Leah Epstein, Asaf Levin
2014 — conf
Colorful Bin Packing.
SWAT
György Dósa, Leah Epstein
2014 J jnl
Colorful bin packing.
CoRR
György Dósa, Leah Epstein
2014 J jnl
Guest Editorial: Selected Papers of European Symposium of Algorithms.
Algorithmica
Leah Epstein, Paolo Ferragina
2014 J jnl
Minimum total weighted completion time: Faster approximation schemes.
CoRR
Leah Epstein, Asaf Levin
2014 J jnl
Models for the k-metric dimension.
CoRR
Ron Adar, Leah Epstein
2014 J jnl
Online bin packing with cardinality constraints revisited.
CoRR
György Dósa, Leah Epstein
2014 J jnl
Online scheduling with rejection and reordering: exact algorithms for unit size jobs.
J. Comb. Optim.
Leah Epstein, Hanan Zebedat-Haider
2014 J jnl
Packing resizable items with application to video delivery over wireless networks.
Theor. Comput. Sci.
Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir
2014 J jnl
Preemptive online scheduling with rejection of unit jobs on two uniformly related machines.
J. Sched.
Leah Epstein, Hanan Zebedat-Haider
2014 J jnl
Robust Algorithms for Preemptive Scheduling.
Algorithmica
Leah Epstein, Asaf Levin
2014 B conf
Scheduling selfish jobs on multidimensional parallel machines.
SPAA
Leah Epstein, Elena Kleiman
2014 B conf
The Convergence Time for Selfish Bin Packing.
SAGT
György Dósa, Leah Epstein
2014 J jnl
The cost of selfishness for maximizing the minimum load on uniformly related machines.
J. Comb. Optim.
Leah Epstein, Elena Kleiman, Rob van Stee
2014 J jnl
Virtual Network Embedding with Opportunistic Resource Sharing.
IEEE Trans. Parallel Distributed Syst.
Sheng Zhang, Zhuzhong Qian, Jie Wu, Sanglu Lu, Leah Epstein
2013 A* conf
A unified approach to truthful scheduling on related machines.
SODA
Leah Epstein, Asaf Levin, Rob van Stee
2013 J jnl
Approximate strong equilibria in job scheduling games with two uniformly related machines.
Discret. Appl. Math.
Leah Epstein, Michal Feldman, Tami Tamir, Lukasz Witkowski, Marcin Witkowski
2013 B conf
Bin Packing Games with Selfish Items.
MFCS
Leah Epstein
2013 J jnl
Bin covering with cardinality constraints.
Discret. Appl. Math.
Leah Epstein, Csanád Imreh, Asaf Levin
2013 A conf
Improved Bounds for Online Preemptive Matching.
STACS
Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
2013 J jnl
Maximizing the minimum load: The cost of selfishness.
Theor. Comput. Sci.
Xujin Chen, Leah Epstein, Elena Kleiman, Rob van Stee
2013 J jnl
Online Clustering with Variable Sized Clusters.
Algorithmica
János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin
2013 B conf
Rent or Buy Problems with a Fixed Time Horizon.
MFCS
Leah Epstein, Hanan Zebedat-Haider
2013 J jnl
Robust Approximation Schemes for Cube Packing.
SIAM J. Optim.
Leah Epstein, Asaf Levin
2013 J jnl
Selfish bin packing with cardinality constraints.
Theor. Comput. Sci.
Ron Adar, Leah Epstein
2012 J jnl
A unified approach to truthful scheduling on related machines
CoRR
Leah Epstein, Asaf Levin, Rob van Stee
2012 A ed.
Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings
ESA
Leah Epstein, Paolo Ferragina
2012 J jnl
An efficient polynomial time approximation scheme for load balancing on uniformly related machines
CoRR
Leah Epstein, Asaf Levin
2012 J jnl
Approximation Schemes for Packing Splittable Items with Cardinality Constraints.
Algorithmica
Leah Epstein, Asaf Levin, Rob van Stee
2012 J jnl
Bin packing with general cost structures.
Math. Program.
Leah Epstein, Asaf Levin
2012 J jnl
Comparing online algorithms for bin packing problems.
J. Sched.
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt
2012 J jnl
Generalized selfish bin packing
CoRR
György Dósa, Leah Epstein
2012 J jnl
Improved Bounds for Online Preemptive Matching
CoRR
Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
2012 J jnl
On Equilibria for ADM Minimization Games.
Algorithmica
Leah Epstein, Asaf Levin
2012 J jnl
On the absolute approximation ratio for First Fit and related results.
Discret. Appl. Math.
Joan Boyar, György Dósa, Leah Epstein
2012 J jnl
On the max coloring problem.
Theor. Comput. Sci.
Leah Epstein, Asaf Levin
2012 — conf
Online Scheduling of Jobs with Fixed Start Times on Related Machines.
APPROX-RANDOM
Leah Epstein, Lukasz Jez, Jirí Sgall, Rob van Stee
2012 C conf
Packing Resizable Items with Application to Video Delivery over Wireless Networks.
ALGOSENSORS
Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir
2012 B conf
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases.
WG
Leah Epstein, Asaf Levin, Gerhard J. Woeginger
2012 J jnl
The price of anarchy on uniformly related machines revisited.
Inf. Comput.
Leah Epstein, Rob van Stee
2012 J jnl
Universal Sequencing on an Unreliable Machine.
SIAM J. Comput.
Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie
2011 J jnl
Graph coloring with rejection.
J. Comput. Syst. Sci.
Leah Epstein, Asaf Levin, Gerhard J. Woeginger
2011 J jnl
Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model.
SIAM J. Discret. Math.
Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev
2011 J jnl
Improved Results for a Memory Allocation Problem.
Theory Comput. Syst.
Leah Epstein, Rob van Stee
2011 J jnl
Max-min Online Allocations with a Reordering Buffer.
SIAM J. Discret. Math.
Leah Epstein, Asaf Levin, Rob van Stee
2011 — conf
On Variants of File Caching.
ICALP (1)
Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György
2011 A conf
On the quality and complexity of pareto equilibria in the job scheduling game.
AAMAS
Leah Epstein, Elena Kleiman
2011 J jnl
Online scheduling with rejection and withdrawal.
Theor. Comput. Sci.
Leah Epstein, Hanan Zebedat-Haider
2011 J jnl
Online variable-sized bin packing with conflicts.
Discret. Optim.
Leah Epstein, Lene M. Favrholdt, Asaf Levin
2011 J jnl
Preemptive Online Scheduling with Reordering.
SIAM J. Discret. Math.
György Dósa, Leah Epstein
2011 A conf
Robust Algorithms for Preemptive Scheduling.
ESA
Leah Epstein, Asaf Levin
2011 J jnl
Selfish Bin Packing.
Algorithmica
Leah Epstein, Elena Kleiman
2011 J jnl
Selfish bin coloring.
J. Comb. Optim.
Leah Epstein, Sven Oliver Krumke, Asaf Levin, Heike Sperber
2010 J jnl
AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items.
SIAM J. Optim.
Leah Epstein, Asaf Levin
2010 J jnl
Bin Packing with Rejection Revisited.
Algorithmica
Leah Epstein
2010 J jnl
Class Constrained Bin Covering.
Theory Comput. Syst.
Leah Epstein, Csanád Imreh, Asaf Levin
2010 J jnl
Class constrained bin packing revisited.
Theor. Comput. Sci.
Leah Epstein, Csanád Imreh, Asaf Levin
2010 J jnl
Dynamic multi-dimensional bin packing.
J. Discrete Algorithms
Leah Epstein, Meital Levy
2010 J jnl
Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy.
Acta Informatica
Leah Epstein
2010 A conf
Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model.
STACS
Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev
2010 J jnl
Improved randomized results for the interval selection problem.
Theor. Comput. Sci.
Leah Epstein, Asaf Levin
2010 — conf
Max-min Online Allocations with a Reordering Buffer.
ICALP (1)
Leah Epstein, Asaf Levin, Rob van Stee
2010 J jnl
Maximizing the minimum load for selfish agents.
Theor. Comput. Sci.
Leah Epstein, Rob van Stee
2010 J jnl
Minimization of SONET ADMs in ring networks revisited.
Computing
Leah Epstein, Asaf Levin, Betzalel Menahem
2010 J jnl
On the online unit clustering problem.
ACM Trans. Algorithms
Leah Epstein, Rob van Stee
2010 J jnl
On the sum minimization version of the online bin covering problem.
Discret. Appl. Math.
János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin
2010 B conf
Online Clustering with Variable Sized Clusters.
MFCS
János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin
2010 J jnl
Online scheduling with a buffer on related machines.
J. Comb. Optim.
György Dósa, Leah Epstein
2010 J jnl
Randomized algorithms for online bounded bidding.
Inf. Process. Lett.
Leah Epstein, Asaf Levin
2010 — conf
Scheduling and Load Balancing.
Euro-Par (1)
Ramin Yahyapour, Raffaele Perego, Frédéric Desprez, Leah Epstein, Francesc Guim Bernat
2010 J jnl
Tight results for Next Fit and Worst Fit with resource augmentation.
Theor. Comput. Sci.
Joan Boyar, Leah Epstein, Asaf Levin
2010 J jnl
Transactional Contention Management as a Non-Clairvoyant Scheduling Problem.
Algorithmica
Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir
2010 J jnl
Two-dimensional online bin packing with rotation.
Theor. Comput. Sci.
Leah Epstein
2010 B conf
Universal Sequencing on a Single Machine.
IPCO
Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie
2009 J jnl
A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs
CoRR
Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
2009 J jnl
A robust APTAS for the classical bin packing problem.
Math. Program.
Leah Epstein, Asaf Levin
2009 J jnl
AFPTAS results for common variants of bin packing: A new method to handle the small items
CoRR
Leah Epstein, Asaf Levin
2009 J jnl
Better bounds for minimizing SONET ADMs.
J. Comput. Syst. Sci.
Leah Epstein, Asaf Levin
2009 J jnl
Bin packing with general cost structures
CoRR
Leah Epstein, Asaf Levin
2009 J jnl
Improved approximation guarantees for weighted matching in the semi-streaming model
CoRR
Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev
2009 — conf
Maximizing the Minimum Load: The Cost of Selfishness.
WINE
Leah Epstein, Elena Kleiman, Rob van Stee
2009 B conf
On Equilibria for ADM Minimization Games.
SAGT
Leah Epstein, Asaf Levin
2009 J jnl
Online Capacitated Interval Coloring.
SIAM J. Discret. Math.
Leah Epstein, Thomas Erlebach, Asaf Levin
2009 J jnl
Optimally competitive list batching.
Theor. Comput. Sci.
Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
2009 J jnl
Paging with Request Sets.
Theory Comput. Syst.
Leah Epstein, Rob van Stee, Tami Tamir
2009 — conf
Parametric Packing of Selfish Items and the Subset Sum Algorithm.
WINE
Leah Epstein, Elena Kleiman, Julián Mestre
2009 J jnl
Parametric packing of selfish items and the subset sum algorithm
CoRR
Leah Epstein, Elena Kleiman, Julián Mestre
2009 A conf
Preemptive Online Scheduling with Reordering.
ESA
György Dósa, Leah Epstein
2009 J jnl
Resource augmented semi-online bounded space bin packing.
Discret. Appl. Math.
Leah Epstein, Elena Kleiman
2009 J jnl
Semi-online machine covering for two uniform machines.
Theor. Comput. Sci.
Xingyu Chen, Leah Epstein, Zhiyi Tan
2009 J jnl
Variable Sized Online Interval Coloring with Bandwidth.
Algorithmica
Leah Epstein, Thomas Erlebach, Asaf Levin
2009 J jnl
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs.
Algorithmica
Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai
2008 J jnl
A PTAS for delay minimization in establishing wireless conference calls.
Discret. Optim.
Leah Epstein, Asaf Levin
2008 J jnl
An APTAS for Generalized Cost Variable-Sized Bin Packing.
SIAM J. Comput.
Leah Epstein, Asaf Levin
2008 J jnl
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing.
Inf. Process. Lett.
Leah Epstein, Asaf Levin
2008 J jnl
Bin packing with controllable item sizes.
Inf. Comput.
José R. Correa, Leah Epstein
2008 B conf
Caching Content under Digital Rights Management.
WAOA
Leah Epstein, Amos Fiat, Meital Levy
2008 A conf
Improved Randomized Results for That Interval Selection Problem.
ESA
Leah Epstein, Asaf Levin
2008 — ch.
List Scheduling.
Encyclopedia of Algorithms
Leah Epstein
2008 — ch.
Load Balancing.
Encyclopedia of Algorithms
Leah Epstein
2008 B conf
Maximizing the Minimum Load for Selfish Agents.
LATIN
Leah Epstein, Rob van Stee
2008 J jnl
More on online bin packing with two item sizes.
Discret. Optim.
Leah Epstein, Asaf Levin
2008 J jnl
On Bin Packing with Conflicts.
SIAM J. Optim.
Leah Epstein, Asaf Levin
2008 — ch.
Online Interval Coloring.
Encyclopedia of Algorithms
Leah Epstein
2008 J jnl
Online interval coloring with packing constraints.
Theor. Comput. Sci.
Leah Epstein, Meital Levy
2008 J jnl
Online unit clustering: Variations on a theme.
Theor. Comput. Sci.
Leah Epstein, Asaf Levin, Rob van Stee
2008 J jnl
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation.
Theory Comput. Syst.
Leah Epstein, Arik Ganot
2008 J jnl
Preemptive scheduling on a small number of hierarchical machines.
Inf. Comput.
György Dósa, Leah Epstein
2008 A conf
Selfish Bin Packing.
ESA
Leah Epstein, Elena Kleiman
2008 B conf
The Price of Anarchy on Uniformly Related Machines Revisited.
SAGT
Leah Epstein, Rob van Stee
2008 J jnl
The hierarchical model for load balancing on two machines.
J. Comb. Optim.
Orion Chassid, Leah Epstein
2008 J jnl
Two-dimensional packing with conflicts.
Acta Informatica
Leah Epstein, Asaf Levin, Rob van Stee
2007 B conf
Approximation Schemes for Packing Splittable Items with Cardinality Constraints.
WAOA
Leah Epstein, Rob van Stee
2007 J jnl
Bounds for online bounded space hypercube packing.
Discret. Optim.
Leah Epstein, Rob van Stee
2007 J jnl
Calculating lower bounds for caching problems.
Computing
Leah Epstein, Rob van Stee
2007 — conf
Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy.
Fair Division
Leah Epstein
2007 B conf
Improved Results for a Memory Allocation Problem.
WADS
Leah Epstein, Rob van Stee
2007 — conf
Maximizing the Minimum Load for Selfisch Agents.
Fair Division
Leah Epstein, Rob van Stee
2007 B conf
Minimum Weighted Sum Bin Packing.
WAOA
Leah Epstein, Asaf Levin
2007 B conf
Multi-dimensional Packing with Conflicts.
FCT
Leah Epstein, Asaf Levin, Rob van Stee
2007 — ch.
Multidimensional Packing Problems.
Handbook of Approximation Algorithms and Metaheuristics
Leah Epstein, Rob van Stee
2007 B conf
On the Max Coloring Problem.
WAOA
Leah Epstein, Asaf Levin
2007 B conf
On the Online Unit Clustering Problem.
WAOA
Leah Epstein, Rob van Stee
2007 — conf
Online Capacitated Interval Coloring.
ESCAPE
Leah Epstein, Thomas Erlebach, Asaf Levin
2007 J jnl
Online bin packing with resource augmentation.
Discret. Optim.
Leah Epstein, Rob van Stee
2007 J jnl
Paging with connections: FIFO strikes again.
Theor. Comput. Sci.
Leah Epstein, Yanir Kleiman, Jirí Sgall, Rob van Stee
2007 J jnl
Path layout on tree networks: Bounds in different label switching models.
Nord. J. Comput.
Anat Bremler-Barr, Leah Epstein
2007 — conf
Preemptive Scheduling on Selfish Machines.
CAAN
Leah Epstein, Rob van Stee
2007 J jnl
SONET ADMs Minimization with Divisible Paths.
Algorithmica
Leah Epstein, Asaf Levin
2007 J jnl
Semi-online scheduling with "end of sequence" information.
J. Comb. Optim.
Leah Epstein, Deshi Ye
2006 — conf
A Robust APTAS for the Classical Bin Packing Problem.
ICALP (1)
Leah Epstein, Asaf Levin
2006 B conf
Bin Packing with Rejection Revisited.
WAOA
Leah Epstein
2006 J jnl
Covering selfish machines
CoRR
Leah Epstein, Rob van Stee
2006 A conf
Graph Coloring with Rejection.
ESA
Leah Epstein, Asaf Levin, Gerhard J. Woeginger
2006 J jnl
Improved results for a memory allocation problem
CoRR
Leah Epstein, Rob van Stee
2006 J jnl
Load balancing of temporary tasks in the
Theor. Comput. Sci.
Yossi Azar, Amir Epstein, Leah Epstein
2006 B conf
On Bin Packing with Conflicts.
WAOA
Leah Epstein, Asaf Levin
2006 J jnl
On the remote server problem or more about TCP acknowledgments.
Theor. Comput. Sci.
Leah Epstein, Alexander Kesselman
2006 J jnl
Online Bin Packing with Cardinality Constraints.
SIAM J. Discret. Math.
Leah Epstein
2006 J jnl
Online scheduling of splittable tasks.
ACM Trans. Algorithms
Leah Epstein, Rob van Stee
2006 J jnl
Optimal on-line flow time with resource augmentation.
Discret. Appl. Math.
Leah Epstein, Rob van Stee
2006 J jnl
Optimal preemptive scheduling for general target functions.
J. Comput. Syst. Sci.
Leah Epstein, Tamir Tassa
2006 — conf
Paging with Request Sets.
SWAT
Leah Epstein, Rob van Stee, Tami Tamir
2006 J jnl
Separating online scheduling algorithms with the relative worst order ratio.
J. Comb. Optim.
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt
2006 J jnl
The conference call search problem in wireless networks.
Theor. Comput. Sci.
Leah Epstein, Asaf Levin
2006 J jnl
The maximum resource bin packing problem.
Theor. Comput. Sci.
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk
2006 J jnl
This side up!
ACM Trans. Algorithms
Leah Epstein, Rob van Stee
2006 A* conf
Transactional contention management as a non-clairvoyant scheduling problem.
PODC
Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir
2006 — conf
Variable Sized Online Interval Coloring with Bandwidth.
SWAT
Leah Epstein, Thomas Erlebach, Asaf Levin
2006 J jnl
Vector assignment schemes for asymmetric settings.
Acta Informatica
Leah Epstein, Tamir Tassa
2006 — conf
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs.
APPROX-RANDOM
Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai
2005 A conf
Online Bin Packing with Cardinality Constraints.
ESA
Leah Epstein
2005 A* conf
Online Interval Coloring and Variants.
ICALP
Leah Epstein, Meital Levy
2005 B conf
Online Interval Coloring with Packing Constraints.
MFCS
Leah Epstein, Meital Levy
2005 — conf
Online scheduling of splittable tasks.
Algorithms for Optimization with Incomplete Information
Leah Epstein, Rob van Stee
2005 J jnl
Online square and cube packing.
Acta Informatica
Leah Epstein, Rob van Stee
2005 J jnl
Optimal Online Algorithms for Multidimensional Packing Problems.
SIAM J. Comput.
Leah Epstein, Rob van Stee
2005 J jnl
Optimal non-preemptive semi-online scheduling on two related machines.
J. Algorithms
Leah Epstein, Lene M. Favrholdt
2005 J jnl
Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data.
Inf. Comput.
Zhiyi Tan, Yong He, Leah Epstein
2005 B conf
SONET ADMs Minimization with Divisible Paths.
WAOA
Leah Epstein, Asaf Levin
2005 B conf
The Conference Call Search Problem in Wireless Networks.
WAOA
Leah Epstein, Asaf Levin
2005 B conf
The Maximum Resource Bin Packing Problem.
FCT
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk
2005 J jnl
The chord version for SONET ADMs minimization.
Theor. Comput. Sci.
Leah Epstein, Asaf Levin
2005 J jnl
Tight bounds for bandwidth allocation on two links.
Discret. Appl. Math.
Leah Epstein
2005 — conf
Tracking mobile users.
Algorithms for Optimization with Incomplete Information
Leah Epstein, Asaf Levin
2004 B conf
A PTAS for Delay Minimization in Establishing Wireless Conference Calls.
WAOA
Leah Epstein, Asaf Levin
2004 J jnl
All-norm approximation algorithms.
J. Algorithms
Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger
2004 J jnl
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines.
Algorithmica
Leah Epstein, Jirí Sgall
2004 J jnl
Approximation schemes for the Min-Max Starting Time Problem.
Acta Informatica
Leah Epstein, Tamir Tassa
2004 B conf
Better Bounds for Minimizing SONET ADMs.
WAOA
Leah Epstein, Asaf Levin
2004 J jnl
Minimizing the maximum starting time on-line.
Inf. Comput.
Leah Epstein, Rob van Stee
2004 A conf
On Variable-Sized Multidimensional Packing.
ESA
Leah Epstein, Rob van Stee
2004 J jnl
On-Line Load Balancing of Temporary Tasks on Identical Machines.
SIAM J. Discret. Math.
Yossi Azar, Leah Epstein
2004 B conf
Online Bin Packing with Resource Augmentation.
WAOA
Leah Epstein, Rob van Stee
2004 — conf
Online Scheduling of Splittable Tasks in Peer-to-Peer Networks.
SWAT
Leah Epstein, Rob van Stee
2004 B conf
Optimal Preemptive Scheduling for General Target Functions.
MFCS
Leah Epstein, Tamir Tassa
2004 A* conf
Optimal online bounded space multidimensional packing.
SODA
Leah Epstein, Rob van Stee
2004 — conf
Optimally Competitive List Batching.
SWAT
Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
2004 B conf
Path Layout on Tree Networks: Bounds in Different Label Switching Models.
SIROCCO
Anat Bremler-Barr, Leah Epstein
2004 B conf
This Side Up!
WAOA
Leah Epstein, Rob van Stee
2003 B conf
Approximation Schemes for the Min-Max Starting Time Problem.
MFCS
Leah Epstein, Tamir Tassa
2003 J jnl
Bin stretching revisited.
Acta Informatica
Leah Epstein
2003 B conf
Load Balancing of Temporary Tasks in the l
WAOA
Yossi Azar, Amir Epstein, Leah Epstein
2003 J jnl
Lower bounds for on-line single-machine scheduling.
Theor. Comput. Sci.
Leah Epstein, Rob van Stee
2003 J jnl
More on weighted servers or FIFO is better than LRU.
Theor. Comput. Sci.
Leah Epstein, Csanád Imreh, Rob van Stee
2003 J jnl
New Bounds for Variable-Sized Online Bin Packing.
SIAM J. Comput.
Steven S. Seiden, Rob van Stee, Leah Epstein
2003 J jnl
On variable sized vector packing.
Acta Cybern.
Leah Epstein
2003 J jnl
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.
Acta Cybern.
Leah Epstein, Lene M. Favrholdt
2003 J jnl
On-line restricted assignment of temporary tasks with unknown durations.
Inf. Process. Lett.
Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev
2003 B conf
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation.
WAOA
Leah Epstein, Arik Ganot
2003 J jnl
Preemptive scheduling in overloaded systems.
J. Comput. Syst. Sci.
Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
2003 J jnl
Temporary Tasks Assignment Resolved.
Algorithmica
Amitai Armon, Yossi Azar, Leah Epstein
2003 J jnl
Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.
J. Sched.
Eric Bach, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Tao Jiang, Kim S. Larsen, Guo-Hui Lin, Rob van Stee
2003 B conf
Two Dimensional Packing: The Power of Rotation.
MFCS
Leah Epstein
2003 J jnl
Vector assignment problems: a general framework.
J. Algorithms
Leah Epstein, Tamir Tassa
2002 — conf
All-Norm Approximation Algorithms.
SWAT
Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger
2002 J jnl
Fair versus Unrestricted Bin Packing.
Algorithmica
Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen, Leah Epstein
2002 A conf
Minimizing the Maximum Starting Time On-line.
ESA
Leah Epstein, Rob van Stee
2002 B conf
More on Weighted Servers or FIFO is Better than LRU.
MFCS
Leah Epstein, Csanád Imreh, Rob van Stee
2002 A* conf
New Bounds for Variable-Sized and Resource Augmented Online Bin Packing.
ICALP
Leah Epstein, Steven S. Seiden, Rob van Stee
2002 Misc conf
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.
COCOON
Leah Epstein, Lene M. Favrholdt
2002 J jnl
On-line scheduling of unit time jobs with rejection: minimizing the total completion time.
Oper. Res. Lett.
Leah Epstein, John Noga, Gerhard J. Woeginger
2002 J jnl
On-line scheduling with precedence constraints.
Discret. Appl. Math.
Yossi Azar, Leah Epstein
2002 B conf
Optimal Non-preemptive Semi-online Scheduling on Two Related Machines.
MFCS
Leah Epstein, Lene M. Favrholdt
2002 J jnl
Optimal preemptive semi-online scheduling to minimize makespan on two related machines.
Oper. Res. Lett.
Leah Epstein, Lene M. Favrholdt
2002 A* conf
Preemptive Scheduling in Overloaded Systems.
ICALP
Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
2002 A* conf
Temporary tasks assignment resolved.
SODA
Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev
2002 A conf
Vector Assignment Problems: A General Framework.
ESA
Leah Epstein, Tamir Tassa
2001 B conf
Lower Bounds for On-Line Single-Machine Scheduling.
MFCS
Leah Epstein, Rob van Stee
2001 Misc conf
On-Line Variable Sized Covering.
COCOON
Leah Epstein
2001 J jnl
Online Variable Sized Covering.
Inf. Comput.
Leah Epstein
2001 B conf
Optimal Online Flow Time with Resource Augmentation.
FCT
Leah Epstein, Rob van Stee
2001 A conf
Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios.
STACS
Leah Epstein
2001 J jnl
Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios.
Oper. Res. Lett.
Leah Epstein
2000 J jnl
A lower bound for on-line scheduling on uniformly related machines.
Oper. Res. Lett.
Leah Epstein, Jirí Sgall
2000 J jnl
A note on on-line scheduling with precedence constraints on identical machines.
Inf. Process. Lett.
Leah Epstein
2000 — conf
On-Line Scheduling with Precedence Constraints.
SWAT
Yossi Azar, Leah Epstein
2000 — conf
Resource Augmentation in Load Balancing.
SWAT
Yossi Azar, Leah Epstein, Rob van Stee
1999 A conf
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines.
ESA
Leah Epstein, Jirí Sgall
1999 A* conf
Randomized Online Scheduling on Two Uniform Machines.
SODA
Leah Epstein, John Noga, Steven S. Seiden, Jirí Sgall, Gerhard J. Woeginger
1998 — conf
Approximation Schemes for Covering and Scheduling on Related Machines.
APPROX
Yossi Azar, Leah Epstein
1998 — conf
Lower Bounds for On-line Scheduling with Precedence Constraints on Identical Machines.
APPROX
Leah Epstein
1998 J jnl
On-Line and Off-Line Approximation Algorithms for Vector Covering Problems.
Algorithmica
Noga Alon, Yossi Azar, János Csirik, Leah Epstein, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger
1997 J jnl
On Two Dimensional Packing.
J. Algorithms
Yossi Azar, Leah Epstein
1997 — conf
On-Line Load Balancing of Temporary Tasks on Identical Machines.
ISTCS
Yossi Azar, Leah Epstein
1997 A conf
On-Line Machine Covering.
ESA
Yossi Azar, Leah Epstein
1996 — conf
On Two Dimensional Packing.
SWAT
Yossi Azar, Leah Epstein