| Virtual network embedding with opportunistic resource sharing S Zhang, Z Qian, J Wu, S Lu, L Epstein IEEE Transactions on Parallel and Distributed Systems 25 (3), 816-827, 2013 | 129 | 2013 |
| Improved approximation guarantees for weighted matching in the semi-streaming model L Epstein, A Levin, J Mestre, D Segev SIAM Journal on Discrete Mathematics 25 (3), 1251-1265, 2011 | 111 | 2011 |
| Randomized on‐line scheduling on two uniform machines L Epstein, J Noga, S Seiden, J Sgall, G Woeginger Journal of Scheduling 4 (2), 71-92, 2001 | 103 | 2001 |
| Approximation schemes for scheduling on uniformly related and identical parallel machines L Epstein, J Sgall Algorithmica 39 (1), 43-57, 2004 | 90 | 2004 |
| Transactional contention management as a non-clairvoyant scheduling problem H Attiya, L Epstein, H Shachnai, T Tamir Algorithmica 57 (1), 44-61, 2010 | 86 | 2010 |
| On-line scheduling of unit time jobs with rejection: minimizing the total completion time L Epstein, J Noga, GJ Woeginger Operations Research Letters 30 (6), 415-420, 2002 | 85 | 2002 |
| All-norm approximation algorithms Y Azar, L Epstein, Y Richter, GJ Woeginger Journal of Algorithms 52 (2), 120-133, 2004 | 78 | 2004 |
| New bounds for variable-sized online bin packing SS Seiden, R Van Stee, L Epstein SIAM Journal on Computing 32 (2), 455-469, 2003 | 70 | 2003 |
| The (weighted) metric dimension of graphs: hard and easy cases L Epstein, A Levin, GJ Woeginger Algorithmica 72 (4), 1130-1171, 2015 | 65 | 2015 |
| On bin packing with conflicts L Epstein, A Levin SIAM Journal on Optimization 19 (3), 1270-1298, 2008 | 65 | 2008 |
| Bin stretching revisited L Epstein Acta Informatica 39 (2), 97-117, 2003 | 63 | 2003 |
| A new and improved algorithm for online bin packing J Balogh, J Békési, G Dósa, L Epstein, A Levin arXiv preprint arXiv:1707.01728, 2017 | 62 | 2017 |
| Universal sequencing on an unreliable machine L Epstein, A Levin, A Marchetti-Spaccamela, N Megow, J Mestre, ... SIAM Journal on Computing 41 (3), 565-586, 2012 | 62* | 2012 |
| Selfish bin packing L Epstein, E Kleiman Algorithmica 60 (2), 368-394, 2011 | 59 | 2011 |
| Optimal online algorithms for multidimensional packing problems L Epstein, R Van Stee SIAM Journal on Computing 35 (2), 431-448, 2005 | 59 | 2005 |
| A lower bound for on-line scheduling on uniformly related machines L Epstein, J Sgall Operations Research Letters 26 (1), 17-22, 2000 | 58 | 2000 |
| Approximation schemes for scheduling on uniformly related and identical parallel machines L Epstein, J Sgall European Symposium on Algorithms, 151-162, 1999 | 56 | 1999 |
| Online square and cube packing L Epstein, R van Stee Acta Informatica 41 (9), 595-606, 2005 | 53 | 2005 |
| Preemptive scheduling in overloaded systems M Chrobak, L Epstein, J Noga, J Sgall, R van Stee, T Tichý, N Vakhania Journal of Computer and System Sciences 67 (1), 183-197, 2003 | 52 | 2003 |
| Online bin packing with cardinality constraints L Epstein SIAM Journal on Discrete Mathematics 20 (4), 1015-1030, 2006 | 51 | 2006 |
Asaf LevinAssociate Professor in Operations Research, The TechnionVerified email at technion.ac.il
