World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
37
Citations
5039
World Ranking
10872
National Ranking
176

Mathematics

D-Index
36
Citations
4696
World Ranking
2668
National Ranking
47

Overview

Leah Epstein is affiliated with the University of Haifa in Israel and has an extensive publication record primarily in the fields of Engineering and Computer Science. Their research contributions span various specialized subfields including Industrial and Manufacturing Engineering, Computer Networks and Communications, Electrical and Electronic Engineering, Computational Theory and Mathematics, and Management Science and Operations Research.

Their key research topics focus on several areas related to optimization and scheduling, including:

  • Optimization and Search Problems
  • Optimization and Packing Problems
  • Advanced Manufacturing and Logistics Optimization
  • Scheduling and Optimization Algorithms
  • Graph theory and CDMA systems
  • Computational Geometry and Mesh Generation
  • Advanced Graph Theory Research

Leah Epstein has authored multiple papers in reputable scientific journals. Selected recent publications include:

  • "A New Lower Bound for Classic Online Bin Packing," 2021, Algorithmica
  • "Online bin packing with cardinality constraints resolved," 2020, SZTE Publicatio Repozitórium (University of Szeged)
  • "A note on a variant of the online open end bin packing problem," 2020, Operations Research Letters
  • "Open-end bin packing: New and old analysis approaches," 2022, Discrete Applied Mathematics
  • "Parallel solutions for preemptive makespan scheduling on two identical machines," 2022, Journal of Scheduling

The frequent venues where they publish include:

  • arXiv (Cornell University)
  • Journal of Combinatorial Optimization
  • Algorithmica
  • Journal of Scheduling
  • Discrete Applied Mathematics

Leah Epstein collaborates often with a number of researchers. Their frequent co-authors include:

  • Asaf Levin
  • János Balogh
  • György Dósa
  • József Békési
  • Loay Mualem

Their publication record indicates a strong emphasis on optimization methodologies, scheduling algorithms, and bin packing problems, contributing to both theoretical advances and practical approaches within industrial engineering and computational theory.

Best Publications

  • Virtual Network Embedding with Opportunistic Resource Sharing

    Sheng Zhang;Zhuzhong Qian;Jie Wu;Sanglu Lu

  • Load Balancing

    Unknown

  • On Bin Packing with Conflicts

    Leah Epstein;Asaf Levin

  • Randomized on-line scheduling on two uniform machines

    Leah Epstein;John Noga;Steve S. Seiden;Jirí Sgall

  • Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model

    Leah Epstein;Asaf Levin;Julián Mestre;Danny Segev

  • On-line scheduling of unit time jobs with rejection: minimizing the total completion time

    Leah Epstein;John Noga;Gerhard J. Woeginger

  • Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

    Leah Epstein;Jiri Sgall

  • Transactional Contention Management as a Non-Clairvoyant Scheduling Problem

    Hagit Attiya;Leah Epstein;Hadas Shachnai;Tami Tamir

  • The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases

    Leah Epstein;Asaf Levin;Gerhard J. Woeginger

  • All-norm approximation algorithms

    Yossi Azar;Leah Epstein;Yossi Richter;Gerhard J. Woeginger

  • New Bounds for Variable-Sized Online Bin Packing

    Steven S. Seiden;Rob van Stee;Leah Epstein

  • Selfish Bin Packing

    Leah Epstein;Elena Kleiman

  • Proceedings of the - 20th Annual European Symposium on Algorithms -- ESA 2012

    Leah Epstein;Paolo Ferragina

  • Bin stretching revisited

    Leah Epstein

  • Optimal Online Algorithms for Multidimensional Packing Problems

    Leah Epstein;Rob van Stee

  • Online Bin Packing with Cardinality Constraints

    Leah Epstein

  • Transactional contention management as a non-clairvoyant scheduling problem

    Hagit Attiya;Leah Epstein;Hadas Shachnai;Tami Tamir

  • Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

    Leah Epstein;Jiri Sgall

  • A lower bound for on-line scheduling on uniformly related machines

    Leah Epstein;Jiřı Sgall

  • On‐line machine covering

    Yossi Azar;Leah Epstein

  • A new and improved algorithm for online bin packing

    János Balogh;József Békési;György Dósa;Leah Epstein

  • Randomized online scheduling on two uniform machines

    Leah Epstein;John Noga;Steve Seiden;Jiří Sgall

  • Improved approximation guarantees for weighted matching in the semi-streaming model

    Leah Epstein;Asaf Levin;Julian Mestre;Danny Segev

  • Multidimensional Packing Problems

    Leah Epstein;Rob van Stee

Frequent Co-Authors

Yossi Azar
Yossi Azar Tel Aviv University
Gerhard J. Woeginger
Gerhard J. Woeginger RWTH Aachen University
Thomas Erlebach
Thomas Erlebach Durham University
Paolo Ferragina
Paolo Ferragina University of Pisa
Jiří Sgall
Jiří Sgall Charles University
János Csirik
János Csirik University of Szeged
Klaus Jansen
Klaus Jansen Kiel University
Hagit Attiya
Hagit Attiya Technion – Israel Institute of Technology
Marek Chrobak
Marek Chrobak University of California, Riverside
Martin Skutella
Martin Skutella Technical University of Berlin

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Mathematics in the USA offers a solid foundation for various career paths, especially in the data-driven world. Many graduates enhance their expertise by pursuing a masters data analytics degree, which equips them with advanced skills to handle big data and drive decision-making processes in industries like finance, healthcare, and technology.

For those interested in blending business acumen with their quantitative skills, pursuing an MBA is a popular choice. Exploring the easiest mba specialization can make this transition smoother, helping candidates secure a degree without excessive hurdles.

For working professionals, flexibility is crucial. The easiest online mba options offer the chance to advance education while maintaining job commitments. These programs often emphasize practical knowledge aligned with current business trends.

At the highest academic level, pursuing a doctoral program in business administration could be the next step. Finding the cheapest online dba ensures this advanced education is accessible without overwhelming financial burden, opening doors to leadership and research roles.

Best Scientists Citing Leah Epstein

Trending Scientists

Recently Published Articles