| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Leah Epstein, Asaf Levin, Rob van Stee |
Approximation Schemes for Packing Splittable Items with Cardinality Constraints.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
On Equilibria for ADM Minimization Games. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Rob van Stee |
The price of anarchy on uniformly related machines revisited. |
Inf. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt |
Comparing online algorithms for bin packing problems. |
J. Scheduling |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
An efficient polynomial time approximation scheme for load balancing on uniformly related machines |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | György Dósa, Leah Epstein |
Generalized selfish bin packing |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
Bin packing with general cost structures. |
Math. Program. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Sven Oliver Krumke, Asaf Levin, Heike Sperber |
Selfish bin coloring. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Lene M. Favrholdt, Asaf Levin |
Online variable-sized bin packing with conflicts. |
Discrete Optimization |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Hanan Zebedat-Haider |
Online scheduling with rejection and withdrawal. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Elena Kleiman |
Selfish Bin Packing. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev |
Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | György Dósa, Leah Epstein |
Preemptive Online Scheduling with Reordering. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Rob van Stee |
Max-min Online Allocations with a Reordering Buffer. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Rob van Stee |
Improved Results for a Memory Allocation Problem. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Gerhard J. Woeginger |
Graph coloring with rejection. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
Robust Algorithms for Preemptive Scheduling. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György |
On Variants of File Caching. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Elena Kleiman |
On the quality and complexity of pareto equilibria in the job scheduling game. |
AAMAS |
2011 |
DBLP BibTeX RDF |
|
| 1 | György Dósa, Leah Epstein |
Online scheduling with a buffer on related machines. |
J. Comb. Optim. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
Randomized algorithms for online bounded bidding. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items. |
SIAM Journal on Optimization |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Joan Boyar, Leah Epstein, Asaf Levin |
Tight results for Next Fit and Worst Fit with resource augmentation. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
Improved randomized results for the interval selection problem. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Csanád Imreh, Asaf Levin |
Class constrained bin packing revisited. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein |
Two-dimensional online bin packing with rotation. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Rob van Stee |
Maximizing the minimum load for selfish agents. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein |
Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy. |
Acta Inf. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein |
Bin Packing with Rejection Revisited. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir |
Transactional Contention Management as a Non-Clairvoyant Scheduling Problem. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Betzalel Menahem |
Minimization of SONET ADMs in ring networks revisited. |
Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Rob van Stee |
On the online unit clustering problem. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Csanád Imreh, Asaf Levin |
Class Constrained Bin Covering. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin |
On the sum minimization version of the online bin covering problem. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Meital Levy |
Dynamic multi-dimensional bin packing. |
J. Discrete Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramin Yahyapour, Raffaele Perego, Frédéric Desprez, Leah Epstein, Francesc Guim Bernat |
Scheduling and Load Balancing. |
Euro-Par |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Rob van Stee |
Max-min Online Allocations with a Reordering Buffer. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin |
Online Clustering with Variable Sized Clusters. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev |
Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie |
Universal Sequencing on a Single Machine. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga |
Optimally competitive list batching. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Xingyu Chen, Leah Epstein, Zhiyi Tan |
Semi-online machine covering for two uniform machines. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai |
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Geometric partitioning, Approximation algorithms, Batch scheduling |
| 1 | Leah Epstein, Thomas Erlebach, Asaf Levin |
Variable Sized Online Interval Coloring with Bandwidth. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Interval coloring, Approximation algorithm, Lower bound, Competitive analysis |
| 1 | Leah Epstein, Elena Kleiman, Julián Mestre |
Parametric packing of selfish items and the subset sum algorithm |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
AFPTAS results for common variants of bin packing: A new method to handle the small items |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga |
A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev |
Improved approximation guarantees for weighted matching in the semi-streaming model |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
Bin packing with general cost structures |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Leah Epstein, Thomas Erlebach, Asaf Levin |
Online Capacitated Interval Coloring. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Rob van Stee, Tami Tamir |
Paging with Request Sets. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Online algorithms, Competitive analysis, Paging |
| 1 | Leah Epstein, Elena Kleiman |
Resource augmented semi-online bounded space bin packing. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
Better bounds for minimizing SONET ADMs. |
J. Comput. Syst. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
A robust APTAS for the classical bin packing problem. |
Math. Program. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | György Dósa, Leah Epstein |
Preemptive Online Scheduling with Reordering. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Elena Kleiman, Julián Mestre |
Parametric Packing of Selfish Items and the Subset Sum Algorithm. |
WINE |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Elena Kleiman, Rob van Stee |
Maximizing the Minimum Load: The Cost of Selfishness. |
WINE |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
On Equilibria for ADM Minimization Games. |
SAGT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Orion Chassid, Leah Epstein |
The hierarchical model for load balancing on two machines. |
J. Comb. Optim. |
2008 |
DBLP DOI BibTeX RDF |
Restricted assignment, Hierarchical machines, Scheduling, Online algorithms |
| 1 | Leah Epstein, Asaf Levin |
More on online bin packing with two item sizes. |
Discrete Optimization |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
A PTAS for delay minimization in establishing wireless conference calls. |
Discrete Optimization |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
On Bin Packing with Conflicts. |
SIAM Journal on Optimization |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Meital Levy |
Online interval coloring with packing constraints. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Rob van Stee |
Online unit clustering: Variations on a theme. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Rob van Stee |
Two-dimensional packing with conflicts. |
Acta Inf. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | José R. Correa, Leah Epstein |
Bin packing with controllable item sizes. |
Inf. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | György Dósa, Leah Epstein |
Preemptive scheduling on a small number of hierarchical machines. |
Inf. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Arik Ganot |
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Scheduling, Load balancing, Online algorithms, Resource augmentation |
| 1 | Leah Epstein, Asaf Levin |
An APTAS for Generalized Cost Variable-Sized Bin Packing. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein |
Load Balancing. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein |
Online Interval Coloring. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein |
List Scheduling. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Elena Kleiman |
Selfish Bin Packing. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
Improved Randomized Results for That Interval Selection Problem. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Rob van Stee |
Maximizing the Minimum Load for Selfish Agents. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Rob van Stee |
The Price of Anarchy on Uniformly Related Machines Revisited. |
SAGT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Amos Fiat, Meital Levy |
Caching Content under Digital Rights Management. |
WAOA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Deshi Ye |
Semi-online scheduling with "end of sequence" information. |
J. Comb. Optim. |
2007 |
DBLP DOI BibTeX RDF |
Uniformly related machines, Online algorithms, Competitive analysis, Machine scheduling |
| 1 | Leah Epstein, Rob van Stee |
Bounds for online bounded space hypercube packing. |
Discrete Optimization |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Rob van Stee |
Online bin packing with resource augmentation. |
Discrete Optimization |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Yanir Kleiman, Jiri Sgall, Rob van Stee |
Paging with connections: FIFO strikes again. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
SONET ADMs Minimization with Divisible Paths. |
Algorithmica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Rob van Stee |
Calculating lower bounds for caching problems. |
Computing |
2007 |
DBLP DOI BibTeX RDF |
caching, Paging, on-line |
| 1 | Anat Bremler-Barr, Leah Epstein |
Path layout on tree networks: Bounds in different label switching models. |
Nord. J. Comput. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Leah Epstein, Rob van Stee |
Maximizing the Minimum Load for Selfisch Agents. |
Fair Division |
2007 |
DBLP BibTeX RDF |
|
| 1 | Leah Epstein |
Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy. |
Fair Division |
2007 |
DBLP BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Rob van Stee |
Multi-dimensional Packing with Conflicts. |
FCT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Rob van Stee |
Improved Results for a Memory Allocation Problem. |
WADS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Rob van Stee |
Preemptive Scheduling on Selfish Machines. |
CAAN |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
On the Max Coloring Problem. |
WAOA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
Minimum Weighted Sum Bin Packing. |
WAOA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Rob van Stee |
On the Online Unit Clustering Problem. |
WAOA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Rob van Stee |
Approximation Schemes for Packing Splittable Items with Cardinality Constraints. |
WAOA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Thomas Erlebach, Asaf Levin |
Online Capacitated Interval Coloring. |
ESCAPE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt |
Separating online scheduling algorithms with the relative worst order ratio. |
J. Comb. Optim. |
2006 |
DBLP DOI BibTeX RDF |
Relative worst order ratio, Scheduling, Online algorithms |
| 1 | Yossi Azar, Amir Epstein, Leah Epstein |
Load balancing of temporary tasks in the lp norm. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
The conference call search problem in wireless networks. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Alexander Kesselman |
On the remote server problem or more about TCP acknowledgments. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk |
The maximum resource bin packing problem. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")