Leah Epstein

4.7k total citations
188 papers, 2.2k citations indexed

About

Leah Epstein is a scholar working on Computer Networks and Communications, Industrial and Manufacturing Engineering and Computational Theory and Mathematics. According to data from OpenAlex, Leah Epstein has authored 188 papers receiving a total of 2.2k indexed citations (citations by other indexed papers that have themselves been cited), including 146 papers in Computer Networks and Communications, 135 papers in Industrial and Manufacturing Engineering and 35 papers in Computational Theory and Mathematics. Recurrent topics in Leah Epstein's work include Optimization and Search Problems (144 papers), Optimization and Packing Problems (85 papers) and Scheduling and Optimization Algorithms (79 papers). Leah Epstein is often cited by papers focused on Optimization and Search Problems (144 papers), Optimization and Packing Problems (85 papers) and Scheduling and Optimization Algorithms (79 papers). Leah Epstein collaborates with scholars based in Israel, Hungary and Germany. Leah Epstein's co-authors include Asaf Levin, Rob van Stee, C. R. Sterling, William Checkley, Lilia Cabrera, Gerhard J. Woeginger, György Dósa, Lene M. Favrholdt, Robert H. Gilman and Robert E. Black and has published in prestigious journals such as American Journal of Epidemiology, European Journal of Operational Research and International Journal of Production Economics.

In The Last Decade

Leah Epstein

175 papers receiving 2.1k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Leah Epstein Israel 22 1.3k 1.2k 273 257 227 188 2.2k
Shigeru Fujimura Japan 22 225 0.2× 260 0.2× 52 0.2× 252 1.0× 1 0.0× 157 1.9k
Ritesh Aggarwal India 8 212 0.2× 17 0.0× 69 0.3× 59 0.2× 70 0.3× 14 815
Sigrún Andradóttir United States 24 499 0.4× 368 0.3× 482 1.8× 17 0.1× 103 2.0k
P.A. Humblet United States 31 3.1k 2.5× 52 0.0× 279 1.0× 698 2.7× 1 0.0× 91 5.5k
Edward C. Sewell United States 17 182 0.1× 476 0.4× 140 0.5× 53 0.2× 49 1.2k
Frédéric Meunier France 13 298 0.2× 146 0.1× 150 0.5× 72 0.3× 1 0.0× 61 1.4k
Morton Klein United States 14 100 0.1× 304 0.3× 78 0.3× 35 0.1× 7 0.0× 38 1.0k
Alberto Martelli Italy 18 246 0.2× 50 0.0× 456 1.7× 17 0.1× 1 0.0× 84 1.7k
Anna L. Buczak United States 14 1.9k 1.5× 33 0.0× 63 0.2× 69 0.3× 5 0.0× 42 2.8k
Louis W. Miller United States 13 767 0.6× 1.4k 1.1× 90 0.3× 23 0.1× 38 2.3k

Countries citing papers authored by Leah Epstein

Since Specialization
Citations

This map shows the geographic impact of Leah Epstein's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Leah Epstein with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Leah Epstein more than expected).

Fields of papers citing papers by Leah Epstein

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Leah Epstein. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Leah Epstein. The network helps show where Leah Epstein may publish in the future.

Co-authorship network of co-authors of Leah Epstein

This figure shows the co-authorship network connecting the top 25 collaborators of Leah Epstein. A scholar is included among the top collaborators of Leah Epstein based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Leah Epstein. Leah Epstein is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Epstein, Leah & Asaf Levin. (2025). Semi-online models for cardinality constrained bin packing. Journal of Scheduling. 29(1). 51–66.
2.
Epstein, Leah, et al.. (2023). Online cardinality constrained scheduling. Operations Research Letters. 51(5). 533–539. 2 indexed citations
3.
Epstein, Leah & Asaf Levin. (2021). Starting time minimization for the maximum job variant. Discrete Applied Mathematics. 307. 79–87. 1 indexed citations
4.
Balogh, János, et al.. (2021). Truly Asymptotic Lower Bounds for Online Vector Bin Packing. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 18.
5.
Balogh, János, József Békési, György Dósa, Leah Epstein, & Asaf Levin. (2020). Online bin packing with cardinality constraints resolved. SZTE Publicatio Repozitórium (University of Szeged). 7 indexed citations
6.
Balogh, János, József Békési, György Dósa, Leah Epstein, & Asaf Levin. (2019). Lower Bounds for Several Online Variants of Bin Packing. SZTE Publicatio Repozitórium (University of Szeged). 6 indexed citations
7.
Balogh, János, József Békési, György Dósa, Leah Epstein, & Asaf Levin. (2018). A New and Improved Algorithm for Online Bin Packing. SZTE Publicatio Repozitórium (University of Szeged). 15 indexed citations
8.
Balogh, János, József Békési, György Dósa, Leah Epstein, & Asaf Levin. (2017). Online bin packing with cardinality constraints resolved. SZTE Publicatio Repozitórium (University of Szeged). 5 indexed citations
9.
Epstein, Leah, Asaf Levin, & Rob van Stee. (2013). A unified approach to truthful scheduling on related machines. arXiv (Cornell University). 1243–1252. 5 indexed citations
10.
Epstein, Leah. (2010). Two-dimensional online bin packing with rotation. Theoretical Computer Science. 411(31-33). 2899–2911. 10 indexed citations
11.
Epstein, Leah & Asaf Levin. (2008). Better bounds for minimizing SONET ADMs. Journal of Computer and System Sciences. 75(2). 122–136. 3 indexed citations
12.
Epstein, Leah & Alex Kesselman. (2006). On the remote server problem or more about TCP acknowledgments. Theoretical Computer Science. 369(1-3). 285–299. 2 indexed citations
13.
Epstein, Leah & Rob van Stee. (2004). Optimal online bounded space multidimensional packing. Symposium on Discrete Algorithms. 214–223. 16 indexed citations
14.
Epstein, Leah, et al.. (2004). Online bin packing with resource augmentation. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–17. 1 indexed citations
15.
Epstein, Leah, et al.. (2004). Bounds for online bounded space hypercube packing. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–17. 1 indexed citations
16.
Epstein, Leah. (2003). On variable sized vector packing. Acta Cybernetica. 16(1). 47–56. 6 indexed citations
17.
Epstein, Leah & Lene M. Favrholdt. (2003). On-line maximizing the number of items packed in variable-sized bins. Acta Cybernetica. 16(1). 57–66. 9 indexed citations
18.
Azar, Yossi, et al.. (2002). Temporary tasks assignment resolved. Symposium on Discrete Algorithms. 116–124. 2 indexed citations
19.
Bach, Eric, Joan Boyar, Leah Epstein, et al.. (2000). Tight bounds on the competitive ratio on accomodating sequences for the seat reservation problem. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–16. 1 indexed citations
20.
Epstein, Leah, et al.. (1999). Randomized online scheduling on two uniform machines. University of Twente Research Information. 317–326. 6 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026