On-Line Machine Covering. - Yossi Azar; Leah Epstein (ESA, 1997)

On Two Dimensional Packing. - Yossi Azar; Leah Epstein (J. Algorithms, 1997)

Approximation Schemes for Covering and Scheduling on Related Machines. - Yossi Azar; Leah Epstein (APPROX, 1998)

Lower Bounds for On-line Scheduling with Precedence Constraints on Identical Machines. - Leah Epstein (APPROX, 1998)

On-Line and Off-Line Approximation Algorithms for Vector Covering Problems. - Noga Alon; Yossi Azar; János Csirik; Leah Epstein; Sergey V. Sevastianov; Arjen P. A. Vestjens; Gerhard J. Woeginger (Algorithmica, 1998)

Randomized Online Scheduling on Two Uniform Machines. - Leah Epstein; John Noga; Steven S. Seiden; Jirí Sgall; Gerhard J. Woeginger (SODA, 1999)

Resource Augmentation in Load Balancing. - Yossi Azar; Leah Epstein; Rob van Stee (SWAT, 2000)

A note on on-line scheduling with precedence constraints on identical machines. - Leah Epstein (Inf. Process. Lett., 2000)

A lower bound for on-line scheduling on uniformly related machines. - Leah Epstein; Jirí Sgall (Oper. Res. Lett., 2000)

On-Line Variable Sized Covering. - Leah Epstein (COCOON, 2001)

Optimal Online Flow Time with Resource Augmentation. - Leah Epstein; Rob van Stee (FCT, 2001)

Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios. - Leah Epstein (STACS, 2001)

Online Variable Sized Covering. - Leah Epstein (Inf. Comput., 2001)

Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios. - Leah Epstein (Oper. Res. Lett., 2001)

New Bounds for Variable-Sized and Resource Augmented Online Bin Packing. - Leah Epstein; Steven S. Seiden; Rob van Stee (ICALP, 2002)

Temporary tasks assignment resolved. - Amitai Armon; Yossi Azar; Leah Epstein; Oded Regev 001 (SODA, 2002)

Fair versus Unrestricted Bin Packing. - Yossi Azar; Joan Boyar; Lene M. Favrholdt; Kim S. Larsen; Morten N. Nielsen; Leah Epstein (Algorithmica, 2002)

On-line scheduling with precedence constraints. - Yossi Azar; Leah Epstein (Discret. Appl. Math., 2002)

Optimal preemptive semi-online scheduling to minimize makespan on two related machines. - Leah Epstein; Lene M. Favrholdt (Oper. Res. Lett., 2002)

On-line scheduling of unit time jobs with rejection: minimizing the total completion time. - Leah Epstein; John Noga; Gerhard J. Woeginger (Oper. Res. Lett., 2002)

Two Dimensional Packing: The Power of Rotation. - Leah Epstein (MFCS, 2003)

Load Balancing of Temporary Tasks in the lp Norm. - Yossi Azar; Amir Epstein; Leah Epstein (WAOA, 2003)

Bin stretching revisited. - Leah Epstein (Acta Informatica, 2003)

On variable sized vector packing. - Leah Epstein (Acta Cybern., 2003)

On-Line Maximizing the Number of Items Packed in Variable-Sized Bins. - Leah Epstein; Lene M. Favrholdt (Acta Cybern., 2003)

Temporary Tasks Assignment Resolved. - Amitai Armon; Yossi Azar; Leah Epstein (Algorithmica, 2003)

On-line restricted assignment of temporary tasks with unknown durations. - Amitai Armon; Yossi Azar; Leah Epstein; Oded Regev 001 (Inf. Process. Lett., 2003)

Vector assignment problems: a general framework. - Leah Epstein; Tamir Tassa (J. Algorithms, 2003)

Preemptive scheduling in overloaded systems. - Marek Chrobak; Leah Epstein; John Noga; Jirí Sgall; Rob van Stee; Tomás Tichý; Nodari Vakhania (J. Comput. Syst. Sci., 2003)

Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem. - Eric Bach 001; Joan Boyar; Leah Epstein; Lene M. Favrholdt; Tao Jiang 001; Kim S. Larsen; Guo-Hui Lin; Rob van Stee (J. Sched., 2003)

New Bounds for Variable-Sized Online Bin Packing. - Steven S. Seiden; Rob van Stee; Leah Epstein (SIAM J. Comput., 2003)

More on weighted servers or FIFO is better than LRU. - Leah Epstein; Csanád Imreh; Rob van Stee (Theor. Comput. Sci., 2003)

Lower bounds for on-line single-machine scheduling. - Leah Epstein; Rob van Stee (Theor. Comput. Sci., 2003)

On Variable-Sized Multidimensional Packing. - Leah Epstein; Rob van Stee (ESA, 2004)

Optimal online bounded space multidimensional packing. - Leah Epstein; Rob van Stee (SODA, 2004)

Online Scheduling of Splittable Tasks in Peer-to-Peer Networks. - Leah Epstein; Rob van Stee (SWAT, 2004)

Approximation schemes for the Min-Max Starting Time Problem. - Leah Epstein; Tamir Tassa (Acta Informatica, 2004)

Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines. - Leah Epstein; Jirí Sgall (Algorithmica, 2004)

Minimizing the maximum starting time on-line. - Leah Epstein; Rob van Stee (Inf. Comput., 2004)

All-norm approximation algorithms. - Yossi Azar; Leah Epstein; Yossi Richter; Gerhard J. Woeginger (J. Algorithms, 2004)

On-Line Load Balancing of Temporary Tasks on Identical Machines. - Yossi Azar; Leah Epstein (SIAM J. Discret. Math., 2004)

Tracking mobile users. - Leah Epstein; Asaf Levin (Algorithms for Optimization with Incomplete Information, 2005)

Online Interval Coloring and Variants. - Leah Epstein; Meital Levy (ICALP, 2005)

Online square and cube packing. - Leah Epstein; Rob van Stee (Acta Informatica, 2005)

Tight bounds for bandwidth allocation on two links. - Leah Epstein (Discret. Appl. Math., 2005)

Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data. - Zhiyi Tan 001; Yong He 014; Leah Epstein (Inf. Comput., 2005)

Optimal non-preemptive semi-online scheduling on two related machines. - Leah Epstein; Lene M. Favrholdt (J. Algorithms, 2005)

Optimal Online Algorithms for Multidimensional Packing Problems. - Leah Epstein; Rob van Stee (SIAM J. Comput., 2005)

The chord version for SONET ADMs minimization. - Leah Epstein; Asaf Levin (Theor. Comput. Sci., 2005)

Vector assignment schemes for asymmetric settings. - Leah Epstein; Tamir Tassa (Acta Informatica, 2006)

Covering selfish machines - Leah Epstein; Rob van Stee (CoRR, 2006)

Optimal on-line flow time with resource augmentation. - Leah Epstein; Rob van Stee (Discret. Appl. Math., 2006)

Separating online scheduling algorithms with the relative worst order ratio. - Leah Epstein; Lene M. Favrholdt; Jens S. Kohrt (J. Comb. Optim., 2006)

Optimal preemptive scheduling for general target functions. - Leah Epstein; Tamir Tassa (J. Comput. Syst. Sci., 2006)

Online Bin Packing with Cardinality Constraints. - Leah Epstein (SIAM J. Discret. Math., 2006)

Online scheduling of splittable tasks. - Leah Epstein; Rob van Stee (ACM Trans. Algorithms, 2006)

This side up! - Leah Epstein; Rob van Stee (ACM Trans. Algorithms, 2006)

Load balancing of temporary tasks in the lp norm. - Yossi Azar; Amir Epstein; Leah Epstein (Theor. Comput. Sci., 2006)

The maximum resource bin packing problem. - Joan Boyar; Leah Epstein; Lene M. Favrholdt; Jens S. Kohrt; Kim S. Larsen; Morten Monrad Pedersen; Sanne Wøhlk (Theor. Comput. Sci., 2006)

On the remote server problem or more about TCP acknowledgments. - Leah Epstein; Alexander Kesselman (Theor. Comput. Sci., 2006)

The conference call search problem in wireless networks. - Leah Epstein; Asaf Levin (Theor. Comput. Sci., 2006)

Preemptive Scheduling on Selfish Machines. - Leah Epstein; Rob van Stee (CAAN, 2007)

Maximizing the Minimum Load for Selfisch Agents. - Leah Epstein; Rob van Stee (Fair Division, 2007)

Multi-dimensional Packing with Conflicts. - Leah Epstein; Asaf Levin; Rob van Stee (FCT, 2007)

Minimum Weighted Sum Bin Packing. - Leah Epstein; Asaf Levin (WAOA, 2007)

Approximation Schemes for Packing Splittable Items with Cardinality Constraints. - Leah Epstein; Rob van Stee (WAOA, 2007)

SONET ADMs Minimization with Divisible Paths. - Leah Epstein; Asaf Levin (Algorithmica, 2007)

Calculating lower bounds for caching problems. - Leah Epstein; Rob van Stee (Computing, 2007)

Bounds for online bounded space hypercube packing. - Leah Epstein; Rob van Stee (Discret. Optim., 2007)

Online bin packing with resource augmentation. - Leah Epstein; Rob van Stee (Discret. Optim., 2007)

Semi-online scheduling with "end of sequence" information. - Leah Epstein; Deshi Ye (J. Comb. Optim., 2007)

Path layout on tree networks: Bounds in different label switching models. - Anat Bremler-Barr; Leah Epstein (Nord. J. Comput., 2007)

Paging with connections: FIFO strikes again. - Leah Epstein; Yanir Kleiman; Jirí Sgall; Rob van Stee (Theor. Comput. Sci., 2007)

Multidimensional Packing Problems. - Leah Epstein; Rob van Stee (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Improved Randomized Results for That Interval Selection Problem. - Leah Epstein; Asaf Levin (ESA, 2008)

Caching Content under Digital Rights Management. - Leah Epstein; Amos Fiat; Meital Levy (WAOA, 2008)

Two-dimensional packing with conflicts. - Leah Epstein; Asaf Levin; Rob van Stee (Acta Informatica, 2008)

A PTAS for delay minimization in establishing wireless conference calls. - Leah Epstein; Asaf Levin (Discret. Optim., 2008)

More on online bin packing with two item sizes. - Leah Epstein; Asaf Levin (Discret. Optim., 2008)

Bin packing with controllable item sizes. - José R. Correa; Leah Epstein (Inf. Comput., 2008)

Preemptive scheduling on a small number of hierarchical machines. - György Dósa; Leah Epstein (Inf. Comput., 2008)

Asymptotic fully polynomial approximation schemes for variants of open-end bin packing. - Leah Epstein; Asaf Levin (Inf. Process. Lett., 2008)

The hierarchical model for load balancing on two machines. - Orion Chassid; Leah Epstein (J. Comb. Optim., 2008)

Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation. - Leah Epstein; Arik Ganot (Theory Comput. Syst., 2008)

An APTAS for Generalized Cost Variable-Sized Bin Packing. - Leah Epstein; Asaf Levin (SIAM J. Comput., 2008)

On Bin Packing with Conflicts. - Leah Epstein; Asaf Levin (SIAM J. Optim., 2008)

Online interval coloring with packing constraints. - Leah Epstein; Meital Levy (Theor. Comput. Sci., 2008)

Online unit clustering: Variations on a theme. - Leah Epstein; Asaf Levin; Rob van Stee (Theor. Comput. Sci., 2008)

List Scheduling. - Leah Epstein (Encyclopedia of Algorithms, 2008)

Load Balancing. - Leah Epstein (Encyclopedia of Algorithms, 2008)

Online Interval Coloring. - Leah Epstein (Encyclopedia of Algorithms, 2008)

Maximizing the Minimum Load: The Cost of Selfishness. - Leah Epstein; Elena Kleiman; Rob van Stee (WINE, 2009)

Variable Sized Online Interval Coloring with Bandwidth. - Leah Epstein; Thomas Erlebach; Asaf Levin (Algorithmica, 2009)

Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. - Leah Epstein; Magnús M. Halldórsson; Asaf Levin; Hadas Shachnai (Algorithmica, 2009)

A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs - Wolfgang W. Bein; Leah Epstein; Lawrence L. Larmore; John Noga (CoRR, 2009)

AFPTAS results for common variants of bin packing: A new method to handle the small items - Leah Epstein; Asaf Levin (CoRR, 2009)

Resource augmented semi-online bounded space bin packing. - Leah Epstein; Elena Kleiman (Discret. Appl. Math., 2009)

Better bounds for minimizing SONET ADMs. - Leah Epstein; Asaf Levin (J. Comput. Syst. Sci., 2009)

A robust APTAS for the classical bin packing problem. - Leah Epstein; Asaf Levin (Math. Program., 2009)

Paging with Request Sets. - Leah Epstein; Rob van Stee; Tami Tamir (Theory Comput. Syst., 2009)

Online Capacitated Interval Coloring. - Leah Epstein; Thomas Erlebach; Asaf Levin (SIAM J. Discret. Math., 2009)

Optimally competitive list batching. - Wolfgang W. Bein; Leah Epstein; Lawrence L. Larmore; John Noga (Theor. Comput. Sci., 2009)

Semi-online machine covering for two uniform machines. - Xingyu Chen; Leah Epstein; Zhiyi Tan 001 (Theor. Comput. Sci., 2009)

Scheduling and Load Balancing. - Ramin Yahyapour; Raffaele Perego 001; Frédéric Desprez; Leah Epstein; Francesc Guim Bernat (Euro-Par (1), 2010)

Universal Sequencing on a Single Machine. - Leah Epstein; Asaf Levin; Alberto Marchetti-Spaccamela; Nicole Megow; Julián Mestre; Martin Skutella; Leen Stougie (IPCO, 2010)

Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy. - Leah Epstein (Acta Informatica, 2010)

Transactional Contention Management as a Non-Clairvoyant Scheduling Problem. - Hagit Attiya; Leah Epstein; Hadas Shachnai; Tami Tamir (Algorithmica, 2010)

Bin Packing with Rejection Revisited. - Leah Epstein (Algorithmica, 2010)

Minimization of SONET ADMs in ring networks revisited. - Leah Epstein; Asaf Levin; Betzalel Menahem (Computing, 2010)

On the sum minimization version of the online bin covering problem. - János Csirik; Leah Epstein; Csanád Imreh; Asaf Levin (Discret. Appl. Math., 2010)

Randomized algorithms for online bounded bidding. - Leah Epstein; Asaf Levin (Inf. Process. Lett., 2010)

Online scheduling with a buffer on related machines. - György Dósa; Leah Epstein (J. Comb. Optim., 2010)

Dynamic multi-dimensional bin packing. - Leah Epstein; Meital Levy (J. Discrete Algorithms, 2010)

Class Constrained Bin Covering. - Leah Epstein; Csanád Imreh; Asaf Levin (Theory Comput. Syst., 2010)

AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items. - Leah Epstein; Asaf Levin (SIAM J. Optim., 2010)

On the online unit clustering problem. - Leah Epstein; Rob van Stee (ACM Trans. Algorithms, 2010)

Tight results for Next Fit and Worst Fit with resource augmentation. - Joan Boyar; Leah Epstein; Asaf Levin (Theor. Comput. Sci., 2010)

Two-dimensional online bin packing with rotation. - Leah Epstein (Theor. Comput. Sci., 2010)

Class constrained bin packing revisited. - Leah Epstein; Csanád Imreh; Asaf Levin (Theor. Comput. Sci., 2010)

Improved randomized results for the interval selection problem. - Leah Epstein; Asaf Levin (Theor. Comput. Sci., 2010)

Maximizing the minimum load for selfish agents. - Leah Epstein; Rob van Stee (Theor. Comput. Sci., 2010)

On the quality and complexity of pareto equilibria in the job scheduling game. - Leah Epstein; Elena Kleiman (AAMAS, 2011)

On Variants of File Caching. - Leah Epstein; Csanád Imreh; Asaf Levin; Judit Nagy-György (ICALP (1), 2011)

Selfish Bin Packing. - Leah Epstein; Elena Kleiman (Algorithmica, 2011)

Online variable-sized bin packing with conflicts. - Leah Epstein; Lene M. Favrholdt; Asaf Levin (Discret. Optim., 2011)

Selfish bin coloring. - Leah Epstein; Sven Oliver Krumke; Asaf Levin; Heike Sperber (J. Comb. Optim., 2011)

Graph coloring with rejection. - Leah Epstein; Asaf Levin; Gerhard J. Woeginger (J. Comput. Syst. Sci., 2011)

Improved Results for a Memory Allocation Problem. - Leah Epstein; Rob van Stee (Theory Comput. Syst., 2011)

Preemptive Online Scheduling with Reordering. - György Dósa; Leah Epstein (SIAM J. Discret. Math., 2011)

Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model. - Leah Epstein; Asaf Levin; Julián Mestre; Danny Segev (SIAM J. Discret. Math., 2011)

Max-min Online Allocations with a Reordering Buffer. - Leah Epstein; Asaf Levin; Rob van Stee (SIAM J. Discret. Math., 2011)

Online scheduling with rejection and withdrawal. - Leah Epstein; Hanan Zebedat-Haider (Theor. Comput. Sci., 2011)

On Equilibria for ADM Minimization Games. - Leah Epstein; Asaf Levin (Algorithmica, 2012)

Approximation Schemes for Packing Splittable Items with Cardinality Constraints. - Leah Epstein; Asaf Levin; Rob van Stee (Algorithmica, 2012)

Generalized selfish bin packing - György Dósa; Leah Epstein (CoRR, 2012)

On the absolute approximation ratio for First Fit and related results. - Joan Boyar; György Dósa; Leah Epstein (Discret. Appl. Math., 2012)

The price of anarchy on uniformly related machines revisited. - Leah Epstein; Rob van Stee (Inf. Comput., 2012)

Bin packing with general cost structures. - Leah Epstein; Asaf Levin (Math. Program., 2012)

Comparing online algorithms for bin packing problems. - Leah Epstein; Lene M. Favrholdt; Jens S. Kohrt (J. Sched., 2012)

Universal Sequencing on an Unreliable Machine. - Leah Epstein; Asaf Levin; Alberto Marchetti-Spaccamela; Nicole Megow; Julián Mestre; Martin Skutella; Leen Stougie (SIAM J. Comput., 2012)

On the max coloring problem. - Leah Epstein; Asaf Levin (Theor. Comput. Sci., 2012)

Bin Packing Games with Selfish Items. - Leah Epstein (MFCS, 2013)

Improved Bounds for Online Preemptive Matching. - Leah Epstein; Asaf Levin; Danny Segev; Oren Weimann (STACS, 2013)

Online Clustering with Variable Sized Clusters. - János Csirik; Leah Epstein; Csanád Imreh; Asaf Levin (Algorithmica, 2013)

Approximate strong equilibria in job scheduling games with two uniformly related machines. - Leah Epstein; Michal Feldman; Tami Tamir; Lukasz Witkowski; Marcin Witkowski (Discret. Appl. Math., 2013)

Bin covering with cardinality constraints. - Leah Epstein; Csanád Imreh; Asaf Levin (Discret. Appl. Math., 2013)

Robust Approximation Schemes for Cube Packing. - Leah Epstein; Asaf Levin (SIAM J. Optim., 2013)

Selfish bin packing with cardinality constraints. - Ron Adar; Leah Epstein (Theor. Comput. Sci., 2013)

Maximizing the minimum load: The cost of selfishness. - Xujin Chen; Leah Epstein; Elena Kleiman; Rob van Stee (Theor. Comput. Sci., 2013)

Colorful Bin Packing. - György Dósa; Leah Epstein (SWAT, 2014)

Guest Editorial: Selected Papers of European Symposium of Algorithms. - Leah Epstein; Paolo Ferragina (Algorithmica, 2014)

Robust Algorithms for Preemptive Scheduling. - Leah Epstein; Asaf Levin (Algorithmica, 2014)

Models for the k-metric dimension. - Ron Adar; Leah Epstein (CoRR, 2014)

Online bin packing with cardinality constraints revisited. - György Dósa; Leah Epstein (CoRR, 2014)

Minimum total weighted completion time: Faster approximation schemes. - Leah Epstein; Asaf Levin (CoRR, 2014)

The cost of selfishness for maximizing the minimum load on uniformly related machines. - Leah Epstein; Elena Kleiman; Rob van Stee (J. Comb. Optim., 2014)

Online scheduling with rejection and reordering: exact algorithms for unit size jobs. - Leah Epstein; Hanan Zebedat-Haider (J. Comb. Optim., 2014)

An efficient polynomial time approximation scheme for load balancing on uniformly related machines. - Leah Epstein; Asaf Levin (Math. Program., 2014)

Preemptive online scheduling with rejection of unit jobs on two uniformly related machines. - Leah Epstein; Hanan Zebedat-Haider (J. Sched., 2014)

Packing resizable items with application to video delivery over wireless networks. - Sivan Albagli-Kim; Leah Epstein; Hadas Shachnai; Tami Tamir (Theor. Comput. Sci., 2014)

Virtual Network Embedding with Opportunistic Resource Sharing. - Sheng Zhang 001; Zhuzhong Qian; Jie Wu 001; Sanglu Lu; Leah Epstein (IEEE Trans. Parallel Distributed Syst., 2014)

Online File Caching with Rejection Penalties. - Leah Epstein; Csanád Imreh; Asaf Levin; Judit Nagy-György (Algorithmica, 2015)

The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. - Leah Epstein; Asaf Levin; Gerhard J. Woeginger (Algorithmica, 2015)

The weighted 2-metric dimension of trees in the non-landmarks model. - Ron Adar; Leah Epstein (Discret. Optim., 2015)

Online Results for Black and White Bin Packing. - János Balogh; József Békési; György Dósa; Leah Epstein; Hans Kellerer; Zsolt Tuza (Theory Comput. Syst., 2015)

Rent or Buy Problems with a Fixed Time Horizon. - Leah Epstein; Hanan Zebedat-Haider (Theory Comput. Syst., 2015)

Offline black and white bin packing. - János Balogh; József Békési; György Dósa; Leah Epstein; Hans Kellerer; Asaf Levin; Zsolt Tuza (Theor. Comput. Sci., 2015)

Online Scheduling of Jobs with Fixed Start Times on Related Machines. - Leah Epstein; Lukasz Jez; Jirí Sgall; Rob van Stee (Algorithmica, 2016)

Parametric Packing of Selfish Items and the Subset Sum Algorithm. - Leah Epstein; Elena Kleiman; Julián Mestre (Algorithmica, 2016)

Vertex Cover Meets Scheduling. - Leah Epstein; Asaf Levin; Gerhard J. Woeginger (Algorithmica, 2016)

An algorithm for the weighted metric dimension of two-dimensional grids. - Ron Adar; Leah Epstein (CoRR, 2016)

Bounds for online bin packing with cardinality constraints. - József Békési; György Dósa; Leah Epstein (Inf. Comput., 2016)

Online scheduling of unit jobs on three machines with rejection: A tight result. - Leah Epstein; Hanan Zebedat-Haider (Inf. Process. Lett., 2016)

A Unified Approach to Truthful Scheduling on Related Machines. - Leah Epstein; Asaf Levin; Rob van Stee (Math. Oper. Res., 2016)

More on batched bin packing. - Leah Epstein (Oper. Res. Lett., 2016)

The benefit of preemption for single machine scheduling so as to minimize total weighted completion time. - Leah Epstein; Asaf Levin (Oper. Res. Lett., 2016)

Bin Packing, Variants. - Leah Epstein (Encyclopedia of Algorithms, 2016)

Harmonic Algorithm for Online Bin Packing. - Leah Epstein (Encyclopedia of Algorithms, 2016)

List Scheduling. - Leah Epstein (Encyclopedia of Algorithms, 2016)

Online Interval Coloring. - Leah Epstein (Encyclopedia of Algorithms, 2016)

Online Load Balancing of Temporary Tasks. - Leah Epstein (Encyclopedia of Algorithms, 2016)

Selfish Bin Packing Problems. - Leah Epstein (Encyclopedia of Algorithms, 2016)

The k-metric dimension. - Ron Adar; Leah Epstein (J. Comb. Optim., 2017)

An AFPTAS for variable sized bin packing with general activation costs. - Leah Epstein; Asaf Levin (J. Comput. Syst. Sci., 2017)

Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times. - Leah Epstein; Ido Yatsiv (J. Sched., 2017)

Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines. - Leah Epstein; Asaf Levin; Alan J. Soper; Vitaly A. Strusevich (SIAM J. Discret. Math., 2017)

Scheduling selfish jobs on multidimensional parallel machines. - Leah Epstein; Elena Kleiman (Theor. Comput. Sci., 2017)

Multidimensional Packing Problems. - Leah Epstein; Rob van Stee (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

A New and Improved Algorithm for Online Bin Packing. - János Balogh; József Békési; György Dósa; Leah Epstein; Asaf Levin (ESA, 2018)

The Metric Dimension of Two-Dimensional Extended Meshes. - Ron Adar; Leah Epstein (Acta Cybern., 2018)

The Convergence Time for Selfish Bin Packing. - György Dósa; Leah Epstein (Acta Cybern., 2018)

Colored Bin Packing: Online Algorithms and Lower Bounds. - Martin Böhm 001; György Dósa; Leah Epstein; Jirí Sgall; Pavel Veselý 001 (Algorithmica, 2018)

Batch Coloring of Graphs. - Joan Boyar; Leah Epstein; Lene M. Favrholdt; Kim S. Larsen; Asaf Levin (Algorithmica, 2018)

Improved bounds for randomized preemptive online matching. - Leah Epstein; Asaf Levin; Danny Segev; Oren Weimann (Inf. Comput., 2018)

Min-Sum Bin Packing. - Leah Epstein; David S. Johnson 001; Asaf Levin (J. Comb. Optim., 2018)

The tight asymptotic approximation ratio of First Fit for bin packing with cardinality constraints. - György Dósa; Leah Epstein (J. Comput. Syst. Sci., 2018)

The benefit of preemption with respect to the ℓp norm. - Leah Epstein; Asaf Levin (Oper. Res. Lett., 2018)

Online-bounded analysis. - Joan Boyar; Leah Epstein; Lene M. Favrholdt; Kim S. Larsen; Asaf Levin (J. Sched., 2018)

A survey on makespan minimization in semi-online environments. - Leah Epstein (J. Sched., 2018)

Robust algorithms for total completion time. - Leah Epstein; Asaf Levin (Discret. Optim., 2019)

A new lower bound on the price of anarchy of selfish bin packing. - György Dósa; Leah Epstein (Inf. Process. Lett., 2019)

Pareto optimal equilibria for selfish bin packing with uniform cost sharing. - György Dósa; Leah Epstein (J. Comb. Optim., 2019)

A lower bound for online rectangle packing. - Leah Epstein (J. Comb. Optim., 2019)

On the performance guarantee of First Fit for sum coloring. - Leah Epstein; Asaf Levin (J. Comput. Syst. Sci., 2019)

Lower Bounds for Several Online Variants of Bin Packing. - János Balogh; József Békési; György Dósa; Leah Epstein; Asaf Levin (Theory Comput. Syst., 2019)

Lower bounds for online bin covering-type problems. - János Balogh; Leah Epstein; Asaf Levin (J. Sched., 2019)

Quality of strong equilibria for selfish bin packing with uniform cost sharing. - György Dósa; Leah Epstein (J. Sched., 2019)

Truly asymptotic lower bounds for online vector bin packing. - János Balogh; Leah Epstein; Asaf Levin (CoRR, 2020)

Quality of equilibria for selfish bin packing with cost sharing variants. - György Dósa; Leah Epstein (Discret. Optim., 2020)

Online bin packing with cardinality constraints resolved. - János Balogh; József Békési; György Dósa; Leah Epstein; Asaf Levin (J. Comput. Syst. Sci., 2020)

Special Issue on Approximation and Online Algorithms. - Leah Epstein; Thomas Erlebach (Theory Comput. Syst., 2020)

Correction to: Special Issue on Approximation and Online Algorithms. - Leah Epstein; Thomas Erlebach (Theory Comput. Syst., 2020)

A note on a variant of the online open end bin packing problem. - Leah Epstein; Asaf Levin (Oper. Res. Lett., 2020)

An optimal online algorithm for scheduling with general machine cost functions. - Islam Akaria; Leah Epstein (J. Sched., 2020)

Truly Asymptotic Lower Bounds for Online Vector Bin Packing. - János Balogh; Ilan Reuven Cohen; Leah Epstein; Asaf Levin (APPROX-RANDOM, 2021)

A New Lower Bound for Classic Online Bin Packing. - János Balogh; József Békési; György Dósa; Leah Epstein; Asaf Levin (Algorithmica, 2021)

Selfish Vector Packing. - Leah Epstein; Elena Kleiman (Algorithmica, 2021)

On bin packing with clustering and bin packing with delays. - Leah Epstein (Discret. Optim., 2021)

More on ordered open end bin packing. - János Balogh; Leah Epstein; Asaf Levin (J. Sched., 2021)

Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems. - János Balogh; György Dósa; Leah Epstein; Lukasz Jez (IWOCA, 2022)

Cardinality Constrained Scheduling in Online Models. - Leah Epstein; Alexandra Lassota; Asaf Levin; Marten Maack; Lars Rohwedder (STACS, 2022)

Open-end bin packing: New and old analysis approaches. - Leah Epstein (Discret. Appl. Math., 2022)

Starting time minimization for the maximum job variant. - Leah Epstein; Asaf Levin (Discret. Appl. Math., 2022)

Online scheduling with migration on two hierarchical machines. - Islam Akaria; Leah Epstein (J. Comb. Optim., 2022)

Lower bounds for batched bin packing. - János Balogh; József Békési; György Dósa; Leah Epstein; Asaf Levin (J. Comb. Optim., 2022)

Several methods of analysis for cardinality constrained bin packing. - Leah Epstein (Theor. Comput. Sci., 2023)

Parallel solutions for preemptive makespan scheduling on two identical machines. - Leah Epstein (J. Sched., 2023)

Online Bin Packing of Squares and Cubes. - Leah Epstein; Loay Mualem (Algorithmica, 2023)

Online bin covering with limited migration. - Sebastian Berndt 001; Leah Epstein; Klaus Jansen; Asaf Levin; Marten Maack; Lars Rohwedder (J. Comput. Syst. Sci., 2023)

Parallel solutions for ordinal scheduling with a small number of machines. - Leah Epstein (J. Comb. Optim., 2023)

Bin stretching with migration on two hierarchical machines. - Islam Akaria; Leah Epstein (Math. Methods Oper. Res., 2023)

Online cardinality constrained scheduling. - Leah Epstein; Alexandra Lassota; Asaf Levin; Marten Maack; Lars Rohwedder (Oper. Res. Lett., 2023)

More on online weighted edge coloring. - Leah Epstein (Discret. Optim., 2023)

Tighter bounds for the harmonic bin packing algorithm. - Leah Epstein (Eur. J. Oper. Res., 2024)

An EPTAS for Minimizing the Total Weighted Completion Time of Jobs with Release Dates on Uniformly Related Machines. - Leah Epstein; Asaf Levin (MFCS, 2025)

Efficient Approximation Schemes for Scheduling on a Stochastic Number of Machines. - Leah Epstein; Asaf Levin (STACS, 2025)

An Efficient Polynomial Time Approximation Scheme for Minimizing the Total Weighted Completion Time on Uniformly Related Machines. - Leah Epstein; Asaf Levin (WADS, 2025)

Lower Bounds for Several Standard Bin Packing Algorithms in the Random Order Model. - Leah Epstein; Asaf Levin (WADS, 2025)

Semi-online scheduling with non-increasing job sizes and a buffer. - Leah Epstein; Hanan Zebedat-Haider (J. Comb. Optim., 2025)