2026 Robert Krauthgamer: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	45	7272	7061	118	112	192	7300

Overview

Robert Krauthgamer is affiliated with the Weizmann Institute of Science in Israel. Their research spans several topics within computer science, concentrating primarily on computational theory and mathematics, artificial intelligence, computer networks and communications, computational mechanics, and computer graphics and computer-aided design.

Their main areas of study and research include:

Complexity and Algorithms in Graphs
Advanced Graph Theory Research
Sparse and Compressive Sensing Techniques
Optimization and Search Problems
Algorithms and Data Compression
Stochastic Gradient Optimization Techniques
Computational Geometry and Mesh Generation

Krauthgamer has published extensively in computer science with a total of 105 publications, of which 43 are related to computational theory and mathematics and 32 to artificial intelligence. Publications are frequently found in venues such as:

arXiv (Cornell University)
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
Information and Inference A Journal of the IMA
Algorithmica

Among recent papers authored or co-authored by Krauthgamer are:

"Refined Vertex Sparsifiers of Planar Graphs," 2020, SIAM Journal on Discrete Mathematics
"Almost-Smooth Histograms and Sliding-Window Graph Algorithms," 2022, Algorithmica

Other notable papers from related collaborations include:

"The Power of Uniform Sampling for Coresets," 2022, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
"Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time," 2022, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
"Streaming Facility Location in High Dimension via Geometric Hashing," 2022, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)

Frequent collaborators include Vladimir Braverman, Shaofeng H.-C. Jiang, Shay Sapir, and Amir Abboud, with multiple joint publications reflecting ongoing research partnerships.

Best Publications

Bounded geometries, fractals, and low-distortion embeddings

A. Gupta;R. Krauthgamer;J.R. Lee

497
Citations
Navigating nets: simple algorithms for proximity search

Robert Krauthgamer;James R. Lee

402
Citations
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT

Shuchi Chawla;Robert Krauthgamer;Ravi Kumar;Yuval Rabani

364
Citations
A Polylogarithmic Approximation of the Minimum Bisection

Uriel Feige;Robert Krauthgamer

311
Citations
Polylogarithmic inapproximability

Eran Halperin;Robert Krauthgamer

269
Citations
Finding and certifying a large hidden clique in a semirandom graph

Uriel Feige;Robert Krauthgamer

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

Yair Bartal;Lee-Ad Gottlieb;Robert Krauthgamer

208
Citations
How Hard Is It to Approximate the Best Nash Equilibrium

Elad Hazan;Robert Krauthgamer

169
Citations
Approximating edit distance efficiently

Z. Bar-Yossef;T.S. Jayram;R. Krauthgamer;R. Kumar

168
Citations
Min-Max Graph Partitioning and Small Set Expansion

Nikhil Bansal;Uriel Feige;Robert Krauthgamer;Konstantin Makarychev

143
Citations
Measured descent: a new embedding method for finite metrics

R. Krauthgamer;J. R. Lee;M. Mendel;Assaf Naor

140
Citations
Vertex Sparsifiers: New Results from Old Techniques

Matthias Englert;Anupam Gupta;Robert Krauthgamer;Harald Räcke

136
Citations
Streaming Algorithms via Precision Sampling

Alexandr Andoni;Robert Krauthgamer;Krzysztof Onak

130
Citations
Hardness of Approximation for Vertex-Connectivity Network Design Problems

Guy Kortsarz;Robert Krauthgamer;James R. Lee

130
Citations
Partitioning graphs into balanced components

Robert Krauthgamer;Joseph (Seffi) Naor;Roy Schwartz

129
Citations
Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity

Alexandr Andoni;Robert Krauthgamer;Krzysztof Onak

127
Citations
Algorithms on negatively curved spaces

Robert Krauthgamer;James Lee

124
Citations
Improved lower bounds for embeddings into L1

Robert Krauthgamer;Yuval Rabani

113
Citations
Earth mover distance over high-dimensional spaces

Alexandr Andoni;Piotr Indyk;Robert Krauthgamer

102
Citations
The Probable Value of the Lovász-Schrijver Relaxations for Maximum Independent Set

Uriel Feige;Robert Krauthgamer

102
Citations
Fault-tolerant spanners: better and simpler

Michael Dinitz;Robert Krauthgamer

95
Citations

Frequent Co-Authors

Alexandr Andoni Columbia University

Uriel Feige Weizmann Institute of Science

James R. Lee University of Washington

Guy Kortsarz Rutgers, The State University of New Jersey

Boaz Nadler Weizmann Institute of Science

Ravi Kumar Google (United States)

Eran Halperin University of California, Los Angeles

Yuval Rabani Hebrew University of Jerusalem

Kunal Talwar Apple (United States)

Joseph (Seffi) Naor Technion – Israel Institute of Technology

External Links

Personal website of Robert Krauthgamer Google Scholar page

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

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens doors to various online degree options and career paths. For students eager to accelerate their career, there are quick degrees online that pay well. These programs let you earn credentials faster and usually lead to high-demand tech jobs.

As AI transforms industries, many are pursuing the best online master's in artificial intelligence. This specialization prepares graduates for cutting-edge roles in data science, robotics, and machine learning.

When planning your academic journey, it's helpful to review the best degrees for the future. These fields promise growth and job security, making them wise choices for long-term success in tech and beyond.

For those seeking a more manageable academic path without compromising opportunities, discover what is the easiest masters degree. Balancing study with work or other commitments is more accessible than ever with flexible online options.