| Select a publication |
| Show |
Title |
Venue |
Rating |
Date |
|
Conference paper
János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin.
Online Clustering with Variable Sized Clusters.
|
Algorithmica 2013, Volume 65 |
 (0)
|
2013 |
|
|
Journal article
Xujin Chen, Leah Epstein, Elena Kleiman, Rob van Stee.
Maximizing the minimum load: The cost of selfishness.
|
Theor. Comput. Sci. 2013, Volume 482 |
(0)
|
2013 |
|
|
Conference paper
Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann.
Improved Bounds for Online Preemptive Matching.
|
30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013 |
(0)
|
2013 |
|
|
Conference paper
Leah Epstein, Asaf Levin, Rob van Stee.
A unified approach to truthful scheduling on related machines.
|
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013 2013 |
(0)
|
2013 |
|
|
Journal article
Leah Epstein, Asaf Levin, Rob van Stee.
Approximation Schemes for Packing Splittable Items with Cardinality Constraints.
|
Algorithmica 2012, Volume 62 |
(0)
|
2012 |
|
|
Journal article
Leah Epstein, Asaf Levin.
On Equilibria for ADM Minimization Games.
|
Algorithmica 2012, Volume 63 |
(0)
|
2012 |
|
|
Journal article
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt.
Comparing online algorithms for bin packing problems.
|
J. Scheduling 2012, Volume 15 |
(0)
|
2012 |
|
|
Journal article
Leah Epstein, Asaf Levin.
Bin packing with general cost structures.
|
Math. Program. 2012, Volume 132 |
(0)
|
2012 |
|
|
Journal article
Leah Epstein, Rob van Stee.
The price of anarchy on uniformly related machines revisited.
|
Inf. Comput. 2012, Volume 212 |
(0)
|
2012 |
|
|
Conference paper
Joan Boyar, György Dósa, Leah Epstein.
On the absolute approximation ratio for First Fit and related results.
|
Discrete Applied Mathematics 2012, Volume 160 |
(0)
|
2012 |
|
|
Conference paper
Leah Epstein, Lukasz Jez, Jiri Sgall, Rob van Stee.
Online Scheduling of Jobs with Fixed Start Times on Related Machines.
|
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings 2012 |
(0)
|
2012 |
|
|
Conference paper
Leah Epstein, Asaf Levin.
An efficient polynomial time approximation scheme for load balancing on uniformly related machines
|
CoRR 2012, Volume 0 |
(0)
|
2012 |
|
|
Conference paper
Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann.
Improved Bounds for Online Preemptive Matching
|
CoRR 2012, Volume 0 |
(0)
|
2012 |
|
|
Conference paper
György Dósa, Leah Epstein.
Generalized selfish bin packing
|
CoRR 2012, Volume 0 |
(0)
|
2012 |
|
|
Conference paper
Leah Epstein, Asaf Levin, Rob van Stee.
A unified approach to truthful scheduling on related machines
|
CoRR 2012, Volume 0 |
(0)
|
2012 |
|
|
Conference paper
Leah Epstein, Asaf Levin, Gerhard J. Woeginger.
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases.
|
Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers 2012 |
(0)
|
2012 |
|
|
Journal article
Leah Epstein, Asaf Levin.
On the max coloring problem.
|
Theor. Comput. Sci. 2012, Volume 462 |
(0)
|
2012 |
|
|
Conference paper
Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie.
Universal Sequencing on an Unreliable Machine.
|
SIAM J. Comput. 2012, Volume 41 |
(0)
|
2012 |
|
|
Conference paper
Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir.
Packing Resizable Items with Application to Video Delivery over Wireless Networks.
|
Algorithms for Sensor Systems, 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2012, Ljubljana, Slovenia, September 13-14, 2012. Revised Selected Papers 2013 |
(0)
|
2012 |
|
|
Journal article
Leah Epstein, Rob van Stee.
Improved Results for a Memory Allocation Problem.
|
Theory Comput. Syst. 2011, Volume 48 |
(0)
|
2011 |
|
|
Conference paper
Leah Epstein, Asaf Levin, Gerhard J. Woeginger.
Graph coloring with rejection.
|
J. Comput. Syst. Sci. 2011, Volume 77 |
(0)
|
2011 |
|
|
Journal article
György Dósa, Leah Epstein.
Preemptive Online Scheduling with Reordering.
|
SIAM J. Discrete Math. 2011, Volume 25 |
(0)
|
2011 |
|
|
Conference paper
Leah Epstein, Elena Kleiman.
Selfish Bin Packing.
|
Algorithmica 2011, Volume 60 |
(0)
|
2011 |
|
|
Conference paper
Leah Epstein, Lene M. Favrholdt, Asaf Levin.
Online variable-sized bin packing with conflicts.
|
Discrete Optimization 2011, Volume 8 |
(0)
|
2011 |
|
|
Conference paper
Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György.
On Variants of File Caching.
|
Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I 2011 |
(0)
|
2011 |
|
|
Conference paper
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, Volume 25 |
(0)
|
2011 |
|
|
Conference paper
Leah Epstein, Asaf Levin, Rob van Stee.
Max-min Online Allocations with a Reordering Buffer.
|
SIAM J. Discrete Math. 2011, Volume 25 |
(0)
|
2011 |
|
|
Conference paper
Leah Epstein, Asaf Levin.
Robust Algorithms for Preemptive Scheduling.
|
Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings 2011 |
(0)
|
2011 |
|
|
Conference paper
Leah Epstein, Hanan Zebedat-Haider.
Online scheduling with rejection and withdrawal.
|
Theor. Comput. Sci. 2011, Volume 412 |
(0)
|
2011 |
|
|
Conference paper
Leah Epstein, Sven Oliver Krumke, Asaf Levin, Heike Sperber.
Selfish bin coloring.
|
J. Comb. Optim. 2011, Volume 22 |
(0)
|
2011 |
|
|
Conference paper
Leah Epstein, Elena Kleiman.
On the quality and complexity of pareto equilibria in the job scheduling game.
|
10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), Taipei, Taiwan, May 2-6, 2011, Volume 1-3 2011 |
(0)
|
2011 |
|
|
Conference paper
Joan Boyar, Leah Epstein, Asaf Levin.
Tight results for Next Fit and Worst Fit with resource augmentation.
|
Theor. Comput. Sci. 2010, Volume 411 |
(0)
|
2010 |
|
|
Conference paper
Leah Epstein.
Two-dimensional online bin packing with rotation.
|
Theor. Comput. Sci. 2010, Volume 411 |
(0)
|
2010 |
|
|
Conference paper
Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie.
Universal Sequencing on a Single Machine.
|
Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings 2010 |
(0)
|
2010 |
|
|
Conference paper
Leah Epstein, Asaf Levin, Rob van Stee.
Max-min Online Allocations with a Reordering Buffer.
|
Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I 2010 |
(0)
|
2010 |
|
|
Conference paper
János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin.
Online Clustering with Variable Sized Clusters.
|
Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings 2010 |
(0)
|
2010 |
|
|
Conference paper
Leah Epstein, Csanád Imreh, Asaf Levin.
Class constrained bin packing revisited.
|
Theor. Comput. Sci. 2010, Volume 411 |
(0)
|
2010 |
|
|
Conference paper
Leah Epstein, Asaf Levin.
Improved randomized results for the interval selection problem.
|
Theor. Comput. Sci. 2010, Volume 411 |
(0)
|
2010 |
|
|
Conference paper
Ramin Yahyapour, Raffaele Perego, Frédéric Desprez, Leah Epstein, Francesc Guim Bernat.
Scheduling and Load Balancing.
|
Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31 - September 3, 2010, Proceedings, Part I 2010 |
(0)
|
2010 |
|
|
Conference paper
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, Volume 158 |
(0)
|
2010 |
|
|
Journal article
György Dósa, Leah Epstein.
Online scheduling with a buffer on related machines.
|
J. Comb. Optim. 2010, Volume 20 |
(0)
|
2010 |
|
|
Conference paper
Leah Epstein, Asaf Levin.
Randomized algorithms for online bounded bidding.
|
Inf. Process. Lett. 2009, Volume 110 |
(0)
|
2010 |
|
|
Conference paper
Leah Epstein, Meital Levy.
Dynamic multi-dimensional bin packing.
|
J. Discrete Algorithms 2010, Volume 8 |
(0)
|
2010 |
|
|
Conference paper
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, Volume 20 |
(0)
|
2010 |
|
|
Journal article
Leah Epstein, Rob van Stee.
On the online unit clustering problem.
|
ACM Transactions on Algorithms 2010, Volume 7 |
(0)
|
2010 |
|
|
Conference paper
Leah Epstein.
Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy.
|
Acta Inf. 2010, Volume 47 |
(0)
|
2010 |
|
|
Journal article
Leah Epstein, Asaf Levin, Betzalel Menahem.
Minimization of SONET ADMs in ring networks revisited.
|
Computing 2010, Volume 87 |
(0)
|
2010 |
|
|
Conference paper
Leah Epstein, Rob van Stee.
Maximizing the minimum load for selfish agents.
|
Theor. Comput. Sci. 2010, Volume 411 |
(0)
|
2010 |
|
|
Journal article
Leah Epstein.
Bin Packing with Rejection Revisited.
|
Algorithmica 2010, Volume 56 |
(0)
|
2010 |
|
|
Journal article
Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir.
Transactional Contention Management as a Non-Clairvoyant Scheduling Problem.
|
Algorithmica 2010, Volume 57 |
(0)
|
2010 |
|
|
Journal article
Leah Epstein, Csanád Imreh, Asaf Levin.
Class Constrained Bin Covering.
|
Theory Comput. Syst. 2010, Volume 46 |
(0)
|
2010 |
|
|
Conference paper
Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev.
Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model.
|
27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France 2010 |
(0)
|
2010 |
|
|
Conference paper
György Dósa, Leah Epstein.
Preemptive Online Scheduling with Reordering.
|
Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings 2009 |
(0)
|
2009 |
|
|
Conference paper
Leah Epstein, Elena Kleiman, Julián Mestre.
Parametric Packing of Selfish Items and the Subset Sum Algorithm.
|
Internet and Network Economics, 5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009. Proceedings 2009 |
(0)
|
2009 |
|
|
Conference paper
Leah Epstein, Elena Kleiman, Rob van Stee.
Maximizing the Minimum Load: The Cost of Selfishness.
|
Internet and Network Economics, 5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009. Proceedings 2009 |
(0)
|
2009 |
|
|
Conference paper
Leah Epstein, Asaf Levin.
On Equilibria for ADM Minimization Games.
|
Algorithmic Game Theory, Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings 2009 |
(0)
|
2009 |
|
|
Conference paper
Leah Epstein, Thomas Erlebach, Asaf Levin.
Variable Sized Online Interval Coloring with Bandwidth.
|
Algorithmica 2009, Volume 53 |
(0)
|
2009 |
|
|
Conference paper
Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai.
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs.
|
Algorithmica 2009, Volume 55 |
(0)
|
2009 |
|
|
Conference paper
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, Volume 0 |
(0)
|
2009 |
|
|
Conference paper
Leah Epstein, Asaf Levin.
AFPTAS results for common variants of bin packing: A new method to handle the small items
|
CoRR 2009, Volume 0 |
(0)
|
2009 |
|
|
Conference paper
Leah Epstein, Asaf Levin.
Bin packing with general cost structures
|
CoRR 2009, Volume 0 |
(0)
|
2009 |
|
|
Conference paper
Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev.
Improved approximation guarantees for weighted matching in the semi-streaming model
|
CoRR 2009, Volume 0 |
(0)
|
2009 |
|
|
Conference paper
Leah Epstein, Elena Kleiman, Julián Mestre.
Parametric packing of selfish items and the subset sum algorithm
|
CoRR 2009, Volume 0 |
(0)
|
2009 |
|
|
Conference paper
Leah Epstein, Elena Kleiman.
Resource augmented semi-online bounded space bin packing.
|
Discrete Applied Mathematics 2009, Volume 157 |
(0)
|
2009 |
|
|
Conference paper
Leah Epstein, Asaf Levin.
Better bounds for minimizing SONET ADMs.
|
J. Comput. Syst. Sci. 2009, Volume 75 |
(0)
|
2009 |
|
|
Conference paper
Leah Epstein, Asaf Levin.
A robust APTAS for the classical bin packing problem.
|
Math. Program. 2009, Volume 119 |
(0)
|
2009 |
|
|
Conference paper
Leah Epstein, Rob van Stee, Tami Tamir.
Paging with Request Sets.
|
Theory Comput. Syst. 2009, Volume 44 |
(0)
|
2009 |
|
|
Conference paper
Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga.
Optimally competitive list batching.
|
Theor. Comput. Sci. 2009, Volume 410 |
(0)
|
2009 |
|
|
Conference paper
Xingyu Chen, Leah Epstein, Zhiyi Tan.
Semi-online machine covering for two uniform machines.
|
Theor. Comput. Sci. 2009, Volume 410 |
(0)
|
2009 |
|
|
Journal article
Leah Epstein, Thomas Erlebach, Asaf Levin.
Online Capacitated Interval Coloring.
|
SIAM J. Discrete Math. 2009, Volume 23 |
(0)
|
2009 |
|
|
Journal article
Leah Epstein, Asaf Levin.
On Bin Packing with Conflicts.
|
SIAM Journal on Optimization 2008, Volume 19 |
(0)
|
2008 |
|
|
Conference paper
Leah Epstein, Asaf Levin.
Improved Randomized Results for That Interval Selection Problem.
|
Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings 2008 |
(0)
|
2008 |
|
|
Conference paper
Leah Epstein, Elena Kleiman.
Selfish Bin Packing.
|
Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings 2008 |
(0)
|
2008 |
|
|
Conference paper
Leah Epstein, Rob van Stee.
Maximizing the Minimum Load for Selfish Agents.
|
LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings 2008 |
(0)
|
2008 |
|
|
Conference paper
Leah Epstein, Amos Fiat, Meital Levy.
Caching Content under Digital Rights Management.
|
Approximation and Online Algorithms, 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers 2009 |
(0)
|
2008 |
|
|
Conference paper
Leah Epstein, Rob van Stee.
The Price of Anarchy on Uniformly Related Machines Revisited.
|
Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings 2008 |
(0)
|
2008 |
|
|
Conference paper
Leah Epstein, Asaf Levin, Rob van Stee.
Two-dimensional packing with conflicts.
|
Acta Inf. 2008, Volume 45 |
(0)
|
2008 |
|
|
Conference paper
José R. Correa, Leah Epstein.
Bin packing with controllable item sizes.
|
Inf. Comput. 2008, Volume 206 |
(0)
|
2008 |
|
|
Conference paper
György Dósa, Leah Epstein.
Preemptive scheduling on a small number of hierarchical machines.
|
Inf. Comput. 2008, Volume 206 |
(0)
|
2008 |
|
|
Conference paper
Leah Epstein, Asaf Levin.
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing.
|
Inf. Process. Lett. 2009, Volume 109 |
(0)
|
2008 |
|
|
Conference paper
Orion Chassid, Leah Epstein.
The hierarchical model for load balancing on two machines.
|
J. Comb. Optim. 2008, Volume 15 |
(0)
|
2008 |
|
|
Conference paper
Leah Epstein, Arik Ganot.
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation.
|
Theory Comput. Syst. 2008, Volume 42 |
(0)
|
2008 |
|
|
Conference paper
Leah Epstein, Asaf Levin.
An APTAS for Generalized Cost Variable-Sized Bin Packing.
|
SIAM J. Comput. 2008, Volume 38 |
(0)
|
2008 |
|
|
Conference paper
Leah Epstein, Meital Levy.
Online interval coloring with packing constraints.
|
Theor. Comput. Sci. 2008, Volume 407 |
(0)
|
2008 |
|
|
Conference paper
Leah Epstein, Asaf Levin, Rob van Stee.
Online unit clustering: Variations on a theme.
|
Theor. Comput. Sci. 2008, Volume 407 |
(0)
|
2008 |
|
|
Conference paper
Leah Epstein, Asaf Levin.
A PTAS for delay minimization in establishing wireless conference calls.
|
Discrete Optimization 2008, Volume 5 |
(0)
|
2008 |
|
|
Conference paper
Leah Epstein, Asaf Levin.
More on online bin packing with two item sizes.
|
Discrete Optimization 2008, Volume 5 |
(0)
|
2008 |
|
|
Book chapter
Leah Epstein.
Online Interval Coloring.
|
Encyclopedia of Algorithms 2008 |
(0)
|
2008 |
|
|
Book chapter
Leah Epstein.
List Scheduling.
|
Encyclopedia of Algorithms 2008 |
(0)
|
2008 |
|
|
Book chapter
Leah Epstein.
Load Balancing.
|
Encyclopedia of Algorithms 2008 |
(0)
|
2008 |
|
|
Journal article
Anat Bremler-Barr, Leah Epstein.
Path layout on tree networks: Bounds in different label switching models.
|
Nord. J. Comput. 2007, Volume 14 |
(0)
|
2007 |
|
|
Conference paper
Leah Epstein, Rob van Stee.
Preemptive Scheduling on Selfish Machines.
|
Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers 2007 |
(0)
|
2007 |
|
|
Conference paper
Leah Epstein, Rob van Stee.
Maximizing the Minimum Load for Selfisch Agents.
|
Fair Division, 24.06. - 29.06.2007 2007 |
(0)
|
2007 |
|
|
Conference paper
Leah Epstein.
Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy.
|
Fair Division, 24.06. - 29.06.2007 2007 |
(0)
|
2007 |
|
|
Conference paper
Leah Epstein, Asaf Levin, Rob van Stee.
Multi-dimensional Packing with Conflicts.
|
Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings 2007 |
(0)
|
2007 |
|
|
Conference paper
Leah Epstein, Rob van Stee.
Improved Results for a Memory Allocation Problem.
|
Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings 2007 |
(0)
|
2007 |
|
|
Conference paper
Leah Epstein, Asaf Levin.
Minimum Weighted Sum Bin Packing.
|
Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers 2008 |
(0)
|
2007 |
|
|
Conference paper
Leah Epstein, Rob van Stee.
On the Online Unit Clustering Problem.
|
Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers 2008 |
(0)
|
2007 |
|
|
Conference paper
Leah Epstein, Rob van Stee.
Approximation Schemes for Packing Splittable Items with Cardinality Constraints.
|
Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers 2008 |
(0)
|
2007 |
|
|
Conference paper
Leah Epstein, Asaf Levin.
On the Max Coloring Problem.
|
Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers 2008 |
(0)
|
2007 |
e/LeahEpstein