World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
42
Citations
8125
World Ranking
8328
National Ranking
139

Overview

Yair Bartal is affiliated with the Hebrew University of Jerusalem in Israel and has a research profile concentrated in the field of Computer Science, particularly within computational theory and mathematics as well as computer vision and pattern recognition.

The scientist's work spans several subfields, including:

  • Computational Theory and Mathematics
  • Computer Vision and Pattern Recognition
  • Computer Graphics and Computer-Aided Design
  • Computer Networks and Communications
  • Computational Mechanics

Several main topics emerge across their research publications, featuring:

  • Complexity and Algorithms in Graphs
  • Advanced Graph Theory Research
  • Face and Expression Recognition
  • Computational Geometry and Mesh Generation
  • Optimization and Search Problems
  • Medical Image Segmentation Techniques
  • Digital Image Processing Techniques

Their recent papers include:

  • "Covering metric spaces by few trees," 2022, Journal of Computer and System Sciences
  • "Advances in Metric Ramsey Theory and its Applications," 2021, arXiv (Cornell University)
  • "Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical Measures," 2022, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical Measures," 2021, arXiv (Cornell University)
  • "Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds," 2024, arXiv (Cornell University)

Frequent co-authors that have collaborated on multiple publications include:

  • Ora Nova Fandina
  • Kasper Green Larsen
  • Sandip Banerjee
  • Lee-Ad Gottlieb
  • Avi-Hai Hovav

Publication venues where this scientist often contributes are:

  • arXiv (Cornell University)
  • Journal of Computer and System Sciences
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Proceedings of the AAAI Conference on Artificial Intelligence

Best Publications

  • Probabilistic approximation of metric spaces and its algorithmic applications

    Y. Bartal

  • On approximating arbitrary metrices by tree metrics

    Yair Bartal

  • Multiprocessor Scheduling with Rejection

    Yair Bartal;Stefano Leonardi;Alberto Marchetti-Spaccamela;Jirí Sgall

  • On metric Ramsey-type phenomena

    Yair Bartal;Nathan Linial;Manor Mendel;Assaf Naor

  • Firmato: a novel firewall management toolkit

    Y. Bartal;A. Mayer;K. Nissim;A. Wool

  • New algorithms for an ancient scheduling problem

    Yair Bartal;Amos Fiat;Howard Karloff;Rakesh Vohra

  • Competitive algorithms for distributed data management

    Yair Bartal;Amos Fiat;Yuval Rabani

  • Incentive compatible multi unit combinatorial auctions

    Yair Bartal;Rica Gonen;Noam Nisan

  • Competitive distributed file allocation

    Baruch Awerbuch;Yair Bartal;Amos Fiat

  • Firmato: A novel firewall management toolkit

    Yair Bartal;Alain Mayer;Kobbi Nissim;Avishai Wool

  • Competitive non-preemptive call control

    Baruch Awerbuch;Yair Bartal;Amos Fiat;Adi Rosén

  • Distributed Paging for General Networks

    Baruch Awerbuch;Yair Bartal;Amos Fiat

  • The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme

    Yair Bartal;Lee-Ad Gottlieb;Robert Krauthgamer

  • On-line generalized Steiner problem

    Baruch Awerbuch;Yossi Azar;Yair Bartal

  • Global optimization using local information with applications to flow control

    Y. Bartal;J.W. Byers;D. Raz

  • Method and system to manage firewall

    Yair Bartal;Alain Jules Mayer;Avishai Wool;ウール アヴィシャイ

  • Approximating min-sum k-clustering in metric spaces

    Yair Bartal;Moses Charikar;Danny Raz

  • Nearly Tight Low Stretch Spanning Trees

    I. Abraham;Y. Bartal;O. Neiman

  • A polylog(n)-competitive algorithm for metrical task systems

    Yair Bartal;Avrim Blum;Carl Burch;Andrew Tomkins

  • A better lower bound for on-line scheduling

    Yair Bartal;Howard Karloff;Yuval Rabani

Frequent Co-Authors

Stefano Leonardi
Stefano Leonardi Sapienza University of Rome
Amos Fiat
Amos Fiat Tel Aviv University
Baruch Awerbuch
Baruch Awerbuch Johns Hopkins University
Assaf Naor
Assaf Naor Princeton University
Nathan Linial
Nathan Linial Hebrew University of Jerusalem
Avishai Wool
Avishai Wool Tel Aviv University
Marek Chrobak
Marek Chrobak University of California, Riverside
Yossi Azar
Yossi Azar Tel Aviv University
Danny Raz
Danny Raz Technion – Israel Institute of Technology

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

Exploring Computer Science in the USA can open many doors, but there are also a variety of quick degrees online that pay well if you want to enter the tech workforce quickly. These fast-track options can lead to high-earning roles in fields such as web development, cybersecurity, and data analysis.

For those interested in cutting-edge technology, online AI degree programs are rapidly gaining popularity. These programs provide a flexible path to careers in artificial intelligence, machine learning, and automation—sectors with strong job growth.

When considering what to study, it's helpful to review the best degrees based on job outlook and potential salary. Computer Science consistently ranks among the top, but related majors such as data science, information systems, and software engineering are also valuable.

If you're thinking about advancing your education easily, you can look into what's the easiest masters degree to get in technology or related fields. An easier, flexible graduate program can offer promotion opportunities and increase your earning potential while fitting your schedule.

Best Scientists Citing Yair Bartal

Trending Scientists

Recently Published Articles