Leah Epstein

According to our database1, Leah Epstein authored at least 215 papers between 1997 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
An optimal online algorithm for scheduling with general machine cost functions.
J. Sched., 2020

Correction to: Special Issue on Approximation and Online Algorithms.
Theory Comput. Syst., 2020

Special Issue on Approximation and Online Algorithms.
Theory Comput. Syst., 2020

Online bin packing with cardinality constraints resolved.
J. Comput. Syst. Sci., 2020

2019
Quality of strong equilibria for selfish bin packing with uniform cost sharing.
J. Sched., 2019

Lower bounds for online bin covering-type problems.
J. Sched., 2019

Lower Bounds for Several Online Variants of Bin Packing.
Theory Comput. Syst., 2019

On the performance guarantee of First Fit for sum coloring.
J. Comput. Syst. Sci., 2019

A lower bound for online rectangle packing.
J. Comb. Optim., 2019

Pareto optimal equilibria for selfish bin packing with uniform cost sharing.
J. Comb. Optim., 2019

A new lower bound on the price of anarchy of selfish bin packing.
Inf. Process. Lett., 2019

Robust algorithms for total completion time.
Discret. Optim., 2019

On bin packing with clustering and bin packing with delays.
CoRR, 2019

A New Lower Bound for Classic Online Bin Packing.
Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019

Online Bin Covering with Limited Migration.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
A survey on makespan minimization in semi-online environments.
J. Sched., 2018

Online-bounded analysis.
J. Sched., 2018

The benefit of preemption with respect to the ℓp norm.
Oper. Res. Lett., 2018

The tight asymptotic approximation ratio of First Fit for bin packing with cardinality constraints.
J. Comput. Syst. Sci., 2018

Min-Sum Bin Packing.
J. Comb. Optim., 2018

Improved bounds for randomized preemptive online matching.
Inf. Comput., 2018

Batch Coloring of Graphs.
Algorithmica, 2018

Colored Bin Packing: Online Algorithms and Lower Bounds.
Algorithmica, 2018

The Convergence Time for Selfish Bin Packing.
Acta Cybern., 2018

The Metric Dimension of Two-Dimensional Extended Meshes.
Acta Cybern., 2018

A New and Improved Algorithm for Online Bin Packing.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Multidimensional Packing Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Scheduling selfish jobs on multidimensional parallel machines.
Theor. Comput. Sci., 2017

Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines.
SIAM J. Discret. Math., 2017

Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times.
J. Sched., 2017

An AFPTAS for variable sized bin packing with general activation costs.
J. Comput. Syst. Sci., 2017

The k-metric dimension.
J. Comb. Optim., 2017

2016
Selfish Bin Packing Problems.
Encyclopedia of Algorithms, 2016

Online Load Balancing of Temporary Tasks.
Encyclopedia of Algorithms, 2016

Online Interval Coloring.
Encyclopedia of Algorithms, 2016

List Scheduling.
Encyclopedia of Algorithms, 2016

Harmonic Algorithm for Online Bin Packing.
Encyclopedia of Algorithms, 2016

Bin Packing, Variants.
Encyclopedia of Algorithms, 2016

The benefit of preemption for single machine scheduling so as to minimize total weighted completion time.
Oper. Res. Lett., 2016

More on batched bin packing.
Oper. Res. Lett., 2016

A Unified Approach to Truthful Scheduling on Related Machines.
Math. Oper. Res., 2016

Online scheduling of unit jobs on three machines with rejection: A tight result.
Inf. Process. Lett., 2016

Bounds for online bin packing with cardinality constraints.
Inf. Comput., 2016

An algorithm for the weighted metric dimension of two-dimensional grids.
CoRR, 2016

Vertex Cover Meets Scheduling.
Algorithmica, 2016

Parametric Packing of Selfish Items and the Subset Sum Algorithm.
Algorithmica, 2016

Online Scheduling of Jobs with Fixed Start Times on Related Machines.
Algorithmica, 2016

2015
Offline black and white bin packing.
Theor. Comput. Sci., 2015

Rent or Buy Problems with a Fixed Time Horizon.
Theory Comput. Syst., 2015

Online Results for Black and White Bin Packing.
Theory Comput. Syst., 2015

The weighted 2-metric dimension of trees in the non-landmarks model.
Discret. Optim., 2015

The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases.
Algorithmica, 2015

Online File Caching with Rejection Penalties.
Algorithmica, 2015

Selfish Vector Packing.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Virtual Network Embedding with Opportunistic Resource Sharing.
IEEE Trans. Parallel Distrib. Syst., 2014

Packing resizable items with application to video delivery over wireless networks.
Theor. Comput. Sci., 2014

Preemptive online scheduling with rejection of unit jobs on two uniformly related machines.
J. Sched., 2014

An efficient polynomial time approximation scheme for load balancing on uniformly related machines.
Math. Program., 2014

Online scheduling with rejection and reordering: exact algorithms for unit size jobs.
J. Comb. Optim., 2014

The cost of selfishness for maximizing the minimum load on uniformly related machines.
J. Comb. Optim., 2014

Minimum total weighted completion time: Faster approximation schemes.
CoRR, 2014

Online bin packing with cardinality constraints revisited.
CoRR, 2014

Models for the k-metric dimension.
CoRR, 2014

Robust Algorithms for Preemptive Scheduling.
Algorithmica, 2014

Guest Editorial: Selected Papers of European Symposium of Algorithms.
Algorithmica, 2014

Colorful Bin Packing.
Proceedings of the Algorithm Theory - SWAT 2014, 2014

2013
Maximizing the minimum load: The cost of selfishness.
Theor. Comput. Sci., 2013

Selfish bin packing with cardinality constraints.
Theor. Comput. Sci., 2013

Robust Approximation Schemes for Cube Packing.
SIAM J. Optim., 2013

Bin covering with cardinality constraints.
Discret. Appl. Math., 2013

Approximate strong equilibria in job scheduling games with two uniformly related machines.
Discret. Appl. Math., 2013

Online Clustering with Variable Sized Clusters.
Algorithmica, 2013

Improved Bounds for Online Preemptive Matching.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Bin Packing Games with Selfish Items.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012
On the max coloring problem.
Theor. Comput. Sci., 2012

Universal Sequencing on an Unreliable Machine.
SIAM J. Comput., 2012

Comparing online algorithms for bin packing problems.
J. Sched., 2012

Bin packing with general cost structures.
Math. Program., 2012

The price of anarchy on uniformly related machines revisited.
Inf. Comput., 2012

On the absolute approximation ratio for First Fit and related results.
Discret. Appl. Math., 2012

Generalized selfish bin packing
CoRR, 2012

Approximation Schemes for Packing Splittable Items with Cardinality Constraints.
Algorithmica, 2012

On Equilibria for ADM Minimization Games.
Algorithmica, 2012

2011
Online scheduling with rejection and withdrawal.
Theor. Comput. Sci., 2011

Max-min Online Allocations with a Reordering Buffer.
SIAM J. Discret. Math., 2011

Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model.
SIAM J. Discret. Math., 2011

Preemptive Online Scheduling with Reordering.
SIAM J. Discret. Math., 2011

Improved Results for a Memory Allocation Problem.
Theory Comput. Syst., 2011

Graph coloring with rejection.
J. Comput. Syst. Sci., 2011

Selfish bin coloring.
J. Comb. Optim., 2011

Online variable-sized bin packing with conflicts.
Discret. Optim., 2011

Selfish Bin Packing.
Algorithmica, 2011

On Variants of File Caching.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

On the quality and complexity of pareto equilibria in the job scheduling game.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

2010
Maximizing the minimum load for selfish agents.
Theor. Comput. Sci., 2010

Improved randomized results for the interval selection problem.
Theor. Comput. Sci., 2010

Class constrained bin packing revisited.
Theor. Comput. Sci., 2010

Two-dimensional online bin packing with rotation.
Theor. Comput. Sci., 2010

Tight results for Next Fit and Worst Fit with resource augmentation.
Theor. Comput. Sci., 2010

On the online unit clustering problem.
ACM Trans. Algorithms, 2010

AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items.
SIAM J. Optim., 2010

Class Constrained Bin Covering.
Theory Comput. Syst., 2010

Dynamic multi-dimensional bin packing.
J. Discrete Algorithms, 2010

Online scheduling with a buffer on related machines.
J. Comb. Optim., 2010

Randomized algorithms for online bounded bidding.
Inf. Process. Lett., 2010

On the sum minimization version of the online bin covering problem.
Discret. Appl. Math., 2010

Minimization of SONET ADMs in ring networks revisited.
Computing, 2010

Bin Packing with Rejection Revisited.
Algorithmica, 2010

Transactional Contention Management as a Non-Clairvoyant Scheduling Problem.
Algorithmica, 2010

Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy.
Acta Informatica, 2010

Universal Sequencing on a Single Machine.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Scheduling and Load Balancing.
Proceedings of the Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31, 2010

2009
Semi-online machine covering for two uniform machines.
Theor. Comput. Sci., 2009

Optimally competitive list batching.
Theor. Comput. Sci., 2009

Online Capacitated Interval Coloring.
SIAM J. Discret. Math., 2009

Paging with Request Sets.
Theory Comput. Syst., 2009

A robust APTAS for the classical bin packing problem.
Math. Program., 2009

Better bounds for minimizing SONET ADMs.
J. Comput. Syst. Sci., 2009

Resource augmented semi-online bounded space bin packing.
Discret. Appl. Math., 2009

AFPTAS results for common variants of bin packing: A new method to handle the small items
CoRR, 2009

A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs
CoRR, 2009

Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs.
Algorithmica, 2009

Variable Sized Online Interval Coloring with Bandwidth.
Algorithmica, 2009

Maximizing the Minimum Load: The Cost of Selfishness.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

2008
Online Interval Coloring.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Load Balancing.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

List Scheduling.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Online unit clustering: Variations on a theme.
Theor. Comput. Sci., 2008

Online interval coloring with packing constraints.
Theor. Comput. Sci., 2008

On Bin Packing with Conflicts.
SIAM J. Optim., 2008

An APTAS for Generalized Cost Variable-Sized Bin Packing.
SIAM J. Comput., 2008

Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation.
Theory Comput. Syst., 2008

The hierarchical model for load balancing on two machines.
J. Comb. Optim., 2008

Asymptotic fully polynomial approximation schemes for variants of open-end bin packing.
Inf. Process. Lett., 2008

Preemptive scheduling on a small number of hierarchical machines.
Inf. Comput., 2008

Bin packing with controllable item sizes.
Inf. Comput., 2008

More on online bin packing with two item sizes.
Discret. Optim., 2008

A PTAS for delay minimization in establishing wireless conference calls.
Discret. Optim., 2008

Two-dimensional packing with conflicts.
Acta Informatica, 2008

Caching Content under Digital Rights Management.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Improved Randomized Results for That Interval Selection Problem.
Proceedings of the Algorithms, 2008

2007
Multidimensional Packing Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Paging with connections: FIFO strikes again.
Theor. Comput. Sci., 2007

Path layout on tree networks: Bounds in different label switching models.
Nord. J. Comput., 2007

Semi-online scheduling with "end of sequence" information.
J. Comb. Optim., 2007

Online bin packing with resource augmentation.
Discret. Optim., 2007

Bounds for online bounded space hypercube packing.
Discret. Optim., 2007

Calculating lower bounds for caching problems.
Computing, 2007

SONET ADMs Minimization with Divisible Paths.
Algorithmica, 2007

Approximation Schemes for Packing Splittable Items with Cardinality Constraints.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Minimum Weighted Sum Bin Packing.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Multi-dimensional Packing with Conflicts.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Maximizing the Minimum Load for Selfisch Agents.
Proceedings of the Fair Division, 24.06. - 29.06.2007, 2007

Preemptive Scheduling on Selfish Machines.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

2006
The conference call search problem in wireless networks.
Theor. Comput. Sci., 2006

On the remote server problem or more about TCP acknowledgments.
Theor. Comput. Sci., 2006

The maximum resource bin packing problem.
Theor. Comput. Sci., 2006

Load balancing of temporary tasks in the lp norm.
Theor. Comput. Sci., 2006

This side up!
ACM Trans. Algorithms, 2006

Online scheduling of splittable tasks.
ACM Trans. Algorithms, 2006

Online Bin Packing with Cardinality Constraints.
SIAM J. Discret. Math., 2006

Optimal preemptive scheduling for general target functions.
J. Comput. Syst. Sci., 2006

Separating online scheduling algorithms with the relative worst order ratio.
J. Comb. Optim., 2006

Optimal on-line flow time with resource augmentation.
Discret. Appl. Math., 2006

Covering selfish machines
CoRR, 2006

Vector assignment schemes for asymmetric settings.
Acta Informatica, 2006

2005
The chord version for SONET ADMs minimization.
Theor. Comput. Sci., 2005

Optimal Online Algorithms for Multidimensional Packing Problems.
SIAM J. Comput., 2005

Optimal non-preemptive semi-online scheduling on two related machines.
J. Algorithms, 2005

Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data.
Inf. Comput., 2005

Tight bounds for bandwidth allocation on two links.
Discret. Appl. Math., 2005

Online square and cube packing.
Acta Informatica, 2005

Online Interval Coloring and Variants.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Tracking mobile users.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

2004
On-Line Load Balancing of Temporary Tasks on Identical Machines.
SIAM J. Discret. Math., 2004

All-norm approximation algorithms.
J. Algorithms, 2004

Minimizing the maximum starting time on-line.
Inf. Comput., 2004

Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines.
Algorithmica, 2004

Approximation schemes for the Min-Max Starting Time Problem.
Acta Informatica, 2004

Online Scheduling of Splittable Tasks in Peer-to-Peer Networks.
Proceedings of the Algorithm Theory, 2004

Optimal online bounded space multidimensional packing.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

On Variable-Sized Multidimensional Packing.
Proceedings of the Algorithms, 2004

2003
Lower bounds for on-line single-machine scheduling.
Theor. Comput. Sci., 2003

More on weighted servers or FIFO is better than LRU.
Theor. Comput. Sci., 2003

New Bounds for Variable-Sized Online Bin Packing.
SIAM J. Comput., 2003

Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.
J. Sched., 2003

Preemptive scheduling in overloaded systems.
J. Comput. Syst. Sci., 2003

Vector assignment problems: a general framework.
J. Algorithms, 2003

On-line restricted assignment of temporary tasks with unknown durations.
Inf. Process. Lett., 2003

Temporary Tasks Assignment Resolved.
Algorithmica, 2003

On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.
Acta Cybern., 2003

On variable sized vector packing.
Acta Cybern., 2003

Bin stretching revisited.
Acta Informatica, 2003

Load Balancing of Temporary Tasks in the lp Norm.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Two Dimensional Packing: The Power of Rotation.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002
On-line scheduling of unit time jobs with rejection: minimizing the total completion time.
Oper. Res. Lett., 2002

Optimal preemptive semi-online scheduling to minimize makespan on two related machines.
Oper. Res. Lett., 2002

On-line scheduling with precedence constraints.
Discret. Appl. Math., 2002

Fair versus Unrestricted Bin Packing.
Algorithmica, 2002

Temporary tasks assignment resolved.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

New Bounds for Variable-Sized and Resource Augmented Online Bin Packing.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

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

Online Variable Sized Covering.
Inf. Comput., 2001

Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios.
Proceedings of the STACS 2001, 2001

Optimal Online Flow Time with Resource Augmentation.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

On-Line Variable Sized Covering.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
A lower bound for on-line scheduling on uniformly related machines.
Oper. Res. Lett., 2000

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

Resource Augmentation in Load Balancing.
Proceedings of the Algorithm Theory, 2000

1999
Randomized Online Scheduling on Two Uniform Machines.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
On-Line and Off-Line Approximation Algorithms for Vector Covering Problems.
Algorithmica, 1998

Lower Bounds for On-line Scheduling with Precedence Constraints on Identical Machines.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998

Approximation Schemes for Covering and Scheduling on Related Machines.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998

1997
On Two Dimensional Packing.
J. Algorithms, 1997

On-Line Machine Covering.
Proceedings of the Algorithms, 1997


  Loading...