אודות
theoretical computer science
פרסומים
- Variants and objectives for ordinal scheduling, Epstein, L., Sep 2026, In: Central European Journal of Operations Research. 34, 3, p. 951-986 36 p.
- Online speed-robust scheduling, Epstein, L., Aug 2026, In: Discrete Optimization. 61, 100954.
- Makespan minimization for ordinal cardinality constrained scheduling, Epstein, L., Lassota, A., Levin, A., Maack, M. & Rohwedder, L., 15 Jul 2026, In: Discrete Applied Mathematics. 387, p. 234-250 17 p.
- An EPTAS for minimizing the total weighted completion time of jobs with release dates on uniformly related machines, Epstein, L. & Levin, A., Jun 2026, In: Information and Computation. 311, 105454.
- Lower bounds on the performance of online algorithms for relaxed packing problems, Balogh, J., Dósa, G., Epstein, L. & Jeż, Ł., May 2026, In: Discrete Optimization. 60, 100941.
- More on online cardinality constrained bin packing with small cardinality bounds, Balogh, J., Békési, J., Dósa, G., Epstein, L. & Levin, A., 13 Apr 2026, In: Theoretical Computer Science. 1068, 115774.
- Semi-online models for cardinality constrained bin packing, Epstein, L. & Levin, A., Feb 2026, In: Journal of Scheduling. 29, 1, p. 51-66 16 p.
- Lower Bounds for Several Standard Bin Packing Algorithms in the Random Order Model, Epstein, L. & Levin, A., 29 Aug 2025, 19th International Symposium on Algorithms and Data Structures, WADS 2025. Morin, P. & Oh, E. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 26. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 349).
- An Efficient Polynomial Time Approximation Scheme for Minimizing the Total Weighted Completion Time on Uniformly Related Machines, Epstein, L. & Levin, A., 29 Aug 2025, 19th International Symposium on Algorithms and Data Structures, WADS 2025. Morin, P. & Oh, E. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 25. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 349).
- An EPTAS for Minimizing the Total Weighted Completion Time of Jobs with Release Dates on Uniformly Related Machines, Epstein, L. & Levin, A., 20 Aug 2025, 50th International Symposium on Mathematical Foundations of Computer Science, MFCS 2025. Gawrychowski, P., Mazowiecki, F. & Skrzypczak, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 44. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 345).
- Semi-online scheduling with non-increasing job sizes and a buffer, Epstein, L. & Zebedat-Haider, H., May 2025, In: Journal of Combinatorial Optimization. 49, 4, 59.
- Efficient Approximation Schemes for Scheduling on a Stochastic Number of Machines, Epstein, L. & Levin, A., 24 Feb 2025, 42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025. Beyersdorff, O., Pilipczuk, M., Pimentel, E. & Thang, N. K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 31. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 327).
- Truly asymptotic lower bounds for online vector bin packing, Balogh, J., Cohen, I. R., Epstein, L. & Levin, A., 2025, (Accepted/In press) In: Mathematical Programming.
- Tighter bounds for the harmonic bin packing algorithm, Epstein, L., 1 Jul 2024, In: European Journal of Operational Research. 316, 1, p. 72-84 13 p.
- More on online weighted edge coloring, Epstein, L., Nov 2023, In: Discrete Optimization. 50, 100803.
- Online cardinality constrained scheduling, Epstein, L., Lassota, A., Levin, A., Maack, M. & Rohwedder, L., Sep 2023, In: Operations Research Letters. 51, 5, p. 533-539 7 p.
- Bin stretching with migration on two hierarchical machines, Akaria, I. & Epstein, L., Aug 2023, In: Mathematical Methods of Operations Research. 98, 1, p. 111-153 43 p.
- Parallel solutions for ordinal scheduling with a small number of machines, Epstein, L., Aug 2023, In: Journal of Combinatorial Optimization. 46, 1, 3.
- Online bin covering with limited migration, Berndt, S., Epstein, L., Jansen, K., Levin, A., Maack, M. & Rohwedder, L., Jun 2023, In: Journal of Computer and System Sciences. 134, p. 42-72 31 p.
- Online Bin Packing of Squares and Cubes, Epstein, L. & Mualem, L., May 2023, In: Algorithmica. 85, 5, p. 1415-1458 44 p.
- Parallel solutions for preemptive makespan scheduling on two identical machines, Epstein, L., Feb 2023, In: Journal of Scheduling. 26, 1, p. 61-76 16 p.
- Several methods of analysis for cardinality constrained bin packing, Epstein, L., 9 Jan 2023, In: Theoretical Computer Science. 942, p. 213-229 17 p.
- Online scheduling with migration on two hierarchical machines, Akaria, I. & Epstein, L., Dec 2022, In: Journal of Combinatorial Optimization. 44, 5, p. 3535-3548 14 p.
- Open-end bin packing: New and old analysis approaches, Epstein, L., 15 Nov 2022, In: Discrete Applied Mathematics. 321, p. 220-239 20 p.
- Cardinality Constrained Scheduling in Online Models, Epstein, L., Lassota, A., Levin, A., Maack, M. & Rohwedder, L., 1 Mar 2022, 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022. Berenbrink, P. & Monmege, B. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 28. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 219).
- Starting time minimization for the maximum job variant, Epstein, L. & Levin, A., 30 Jan 2022, In: Discrete Applied Mathematics. 307, p. 79-87 9 p.
- Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems, Balogh, J., Dósa, G., Epstein, L. & Jeż, Ł., 2022, Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Proceedings. Bazgan, C. & Fernau, H. (eds.). Springer Science and Business Media Deutschland GmbH, p. 101-113 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13270 LNCS).
- More on ordered open end bin packing, Balogh, J., Epstein, L. & Levin, A., Dec 2021, In: Journal of Scheduling. 24, 6, p. 589-614 26 p.
- Selfish Vector Packing, Epstein, L. & Kleiman, E., Sep 2021, In: Algorithmica. 83, 9, p. 2952-2988 37 p.
- Truly asymptotic lower bounds for online vector bin packing, Balogh, J., Cohen, I. R., Epstein, L. & Levin, A., 1 Sep 2021, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021. Wootters, M. & Sanita, L. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 8. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 207).
- On bin packing with clustering and bin packing with delays, Epstein, L., Aug 2021, In: Discrete Optimization. 41, 100647.
- Several Methods of Analysis for Cardinality Constrained Bin Packing, Epstein, L., 2021, Approximation and Online Algorithms - 19th International Workshop, WAOA 2021, Revised Selected Papers. Koenemann, J. & Peis, B. (eds.). Springer Science and Business Media Deutschland GmbH, p. 117-129 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12982 LNCS).
- Lower bounds for batched bin packing, Balogh, J., Békési, J., Dósa, G., Epstein, L. & Levin, A., 2021, In: Journal of Combinatorial Optimization. 43, 3, p. 613-629 17 p.
- Online Bin Packing of Squares and Cubes, Epstein, L. & Mualem, L., 2021, Algorithms and Data Structures - 17th International Symposium, WADS 2021, Proceedings. Lubiw, A. & Salavatipour, M. (eds.). Springer Science and Business Media Deutschland GmbH, p. 357-370 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12808 LNCS).
- Online Load Balancing of Temporary Tasks, Epstein, L., 1 Jan 2016, Encyclopedia of Algorithms, Second Edition. Springer New York, p. 1452-1455 4 p.
- Selfish Bin Packing Problems, Epstein, L., 1 Jan 2016, Encyclopedia of Algorithms, Second Edition. Springer New York, p. 1927-1930 4 p.
- Harmonic Algorithm for Online Bin Packing, Epstein, L., 1 Jan 2016, Encyclopedia of Algorithms, Second Edition. Springer New York, p. 900-902 3 p.
- Bin Packing, Variants, Epstein, L., 1 Jan 2016, Encyclopedia of Algorithms, Second Edition. Springer New York, p. 214-216 3 p.
- List Scheduling, Epstein, L., 1 Jan 2016, Encyclopedia of Algorithms, Second Edition. Springer New York, p. 1121-1124 4 p.
- Online Interval Coloring, Epstein, L., 1 Jan 2016, Encyclopedia of Algorithms, Second Edition. Springer New York, p. 1439-1443 5 p.
- Scheduling with processing set restrictions: PTAS results for several variants, Epstein, L. & Levin, A., 10 Oct 2011, In: International Journal of Production Economics. 133, 2, p. 586-595 10 p.
- Paging with Request Sets, Epstein, L., Van Stee, R. & Tamir, T., 3 Jul 2009, In: Theory of Computing Systems. 44, 1, p. 67-81 15 p.
- Load Balancing, Epstein, L., 2008, Encyclopedia of Algorithms. Kao, M.-Y. (ed.). Boston, MA: Springer US, p. 457-459 3 p.
- Maximizing the Minimum Load for Selfish Agents, Epstein, L. & van Stee, R., 2007, In: Dagstuhl Seminar Proceedings. 7261
- Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy, Epstein, L., 2007, In: Dagstuhl Seminar Proceedings. 7261
- Optimal non-preemptive semi-online scheduling on two related machines, Epstein, L. & Favrholdt, L. M., Sep 2005, In: Journal of Algorithms. 57, 1, p. 49-73 25 p.
- Online Scheduling of Splittable Tasks, Epstein, L. & van Stee, R., 2005, In: Dagstuhl Seminar Proceedings. 5031
- Tracking Mobile Users, Epstein, L. & Levin, A., 2005, In: Dagstuhl Seminar Proceedings. 5031
- Vector assignment problems: A general framework, Epstei, L. & Tassa, T., Sep 2003, In: Journal of Algorithms. 48, 2, p. 360-384 25 p.
- Tight bounds for bandwidth allocation on two links, Epstein, L., 2002, Proceedings of the 3rd Workshop on Approximation and Randomization Algorithms in Communication NEtworks (ARACNE’02). p. 39-50 12 p.