D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 37 Citations 6,038 127 World Ranking 5277 National Ranking 97

Overview

What is he best known for?

The fields of study he is best known for:

  • Combinatorics
  • Algorithm
  • Artificial intelligence

His scientific interests lie mostly in Combinatorics, Discrete mathematics, Approximation algorithm, Binary logarithm and Upper and lower bounds. His study in Combinatorics is interdisciplinary in nature, drawing from both Embedding, Edit distance and Metric space. The Metric space study combines topics in areas such as Bounded function and Metric.

The study of Discrete mathematics is intertwined with the study of Graph theory in a number of ways. His Approximation algorithm study incorporates themes from Linear programming, Linear programming relaxation and Graph. His work carried out in the field of Binary logarithm brings together such families of science as Linear function, Streaming algorithm and Multivariate random variable.

His most cited work include:

  • Bounded geometries, fractals, and low-distortion embeddings (410 citations)
  • Navigating nets: simple algorithms for proximity search (324 citations)
  • Polylogarithmic inapproximability (206 citations)

What are the main themes of his work throughout his whole career to date?

His primary areas of investigation include Combinatorics, Discrete mathematics, Metric space, Upper and lower bounds and Approximation algorithm. His Combinatorics research is multidisciplinary, incorporating elements of Embedding and Bounded function. His studies deal with areas such as Graph theory and Edit distance as well as Discrete mathematics.

His Metric space research is multidisciplinary, relying on both Metric, Cluster analysis, Steiner point, Algorithm and Lipschitz continuity. In his research on the topic of Upper and lower bounds, Maximum flow problem is strongly related with Directed graph. His Approximation algorithm research incorporates themes from Linear programming, Optimization problem and Dynamic programming.

He most often published in these fields:

  • Combinatorics (69.30%)
  • Discrete mathematics (38.14%)
  • Metric space (20.93%)

What were the highlights of his more recent work (between 2018-2021)?

  • Combinatorics (69.30%)
  • Upper and lower bounds (18.60%)
  • Algorithm (14.42%)

In recent papers he was focusing on the following fields of study:

Robert Krauthgamer mainly investigates Combinatorics, Upper and lower bounds, Algorithm, Discrete mathematics and Cluster analysis. Robert Krauthgamer studies Combinatorics, focusing on Approximation algorithm in particular. His biological study spans a wide range of topics, including Undirected graph, Maximum flow problem, Directed graph, Current and Matrix multiplication.

His research integrates issues of Range and Sparse vector in his study of Algorithm. His Discrete mathematics research is multidisciplinary, incorporating perspectives in Graph theory, Topology and Minimax. The concepts of his Cluster analysis study are interwoven with issues in Binary logarithm, Data point and Multi-objective optimization.

Between 2018 and 2021, his most popular works were:

  • Faster Algorithms for All-Pairs Bounded Min-Cuts (9 citations)
  • On Solving Linear Systems in Sublinear Time. (9 citations)
  • New algorithms and lower bounds for all-pairs max-flow in undirected graphs (8 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Combinatorics
  • Artificial intelligence

Robert Krauthgamer mainly investigates Combinatorics, Upper and lower bounds, Coreset, Cluster analysis and Bounded function. His studies in Combinatorics integrate themes in fields like Condition number, Positive-definite matrix and Diagonally dominant matrix. The study incorporates disciplines such as Tree and Algorithm, Randomized algorithm in addition to Upper and lower bounds.

His work on Minimum cut as part of general Algorithm study is frequently connected to Omega, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them. In his work, Topological graph theory, Centroid, Metric space and Communication complexity is strongly intertwined with Binary logarithm, which is a subfield of Coreset. Within one scientific family, Robert Krauthgamer focuses on topics pertaining to Embedding under Bounded function, and may sometimes address concerns connected to Flow, Planar graph, Function and Distortion.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Bounded geometries, fractals, and low-distortion embeddings

A. Gupta;R. Krauthgamer;J.R. Lee.
foundations of computer science (2003)

439 Citations

Navigating nets: simple algorithms for proximity search

Robert Krauthgamer;James R. Lee.
symposium on discrete algorithms (2004)

381 Citations

Polylogarithmic inapproximability

Eran Halperin;Robert Krauthgamer.
symposium on the theory of computing (2003)

238 Citations

ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT

Shuchi Chawla;Robert Krauthgamer;Ravi Kumar;Yuval Rabani.
Computational Complexity (2006)

238 Citations

Finding and certifying a large hidden clique in a semirandom graph

Uriel Feige;Robert Krauthgamer.
Random Structures and Algorithms (2000)

208 Citations

A Polylogarithmic Approximation of the Minimum Bisection

Uriel Feige;Robert Krauthgamer.
SIAM Journal on Computing (2002)

197 Citations

Approximating edit distance efficiently

Z. Bar-Yossef;T.S. Jayram;R. Krauthgamer;R. Kumar.
foundations of computer science (2004)

150 Citations

How Hard Is It to Approximate the Best Nash Equilibrium

Elad Hazan;Robert Krauthgamer.
SIAM Journal on Computing (2011)

139 Citations

Partitioning graphs into balanced components

Robert Krauthgamer;Joseph (Seffi) Naor;Roy Schwartz.
symposium on discrete algorithms (2009)

122 Citations

Hardness of Approximation for Vertex-Connectivity Network Design Problems

Guy Kortsarz;Robert Krauthgamer;James R. Lee.
SIAM Journal on Computing (2004)

115 Citations

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

Contact us

Best Scientists Citing Robert Krauthgamer

David P. Woodruff

David P. Woodruff

Carnegie Mellon University

Publications: 72

James R. Lee

James R. Lee

University of Washington

Publications: 46

Anupam Gupta

Anupam Gupta

Carnegie Mellon University

Publications: 45

Guy Kortsarz

Guy Kortsarz

Rutgers, The State University of New Jersey

Publications: 43

Assaf Naor

Assaf Naor

Princeton University

Publications: 43

MohammadTaghi Hajiaghayi

MohammadTaghi Hajiaghayi

University of Maryland, College Park

Publications: 41

Yair Bartal

Yair Bartal

Hebrew University of Jerusalem

Publications: 32

Ittai Abraham

Ittai Abraham

VMware

Publications: 30

Chandra Chekuri

Chandra Chekuri

University of Illinois at Urbana-Champaign

Publications: 27

Piotr Indyk

Piotr Indyk

MIT

Publications: 25

Subhash Khot

Subhash Khot

New York University

Publications: 25

Uriel Feige

Uriel Feige

Weizmann Institute of Science

Publications: 24

Sanjeev Arora

Sanjeev Arora

Princeton University

Publications: 24

Kunal Talwar

Kunal Talwar

Apple (United States)

Publications: 23

Luca Trevisan

Luca Trevisan

Bocconi University

Publications: 23

Moses Charikar

Moses Charikar

Stanford University

Publications: 23

Trending Scientists

Luc Martens

Luc Martens

Ghent University

Zhifei Zhang

Zhifei Zhang

Peking University

Xinyuan Wu

Xinyuan Wu

Nanjing University

Ali Ghrayeb

Ali Ghrayeb

Texas A&M University at Qatar

Yan Huang

Yan Huang

University of North Texas

Aiqin Wang

Aiqin Wang

Dalian Institute of Chemical Physics

Guanghua Li

Guanghua Li

Jilin University

Deborah Krakow

Deborah Krakow

University of California, Los Angeles

John Davison

John Davison

University of Tartu

David Hoisington

David Hoisington

International Maize and Wheat Improvement Center

Maki Kondo

Maki Kondo

National Institute for Basic Biology

Denis Gospodarowicz

Denis Gospodarowicz

University of California, San Francisco

R. Russell M. Paterson

R. Russell M. Paterson

University of Minho

Delores J. Knipp

Delores J. Knipp

University of Colorado Boulder

Lorelei A. Mucci

Lorelei A. Mucci

Harvard University

Mary Kalantzis

Mary Kalantzis

University of Illinois at Urbana-Champaign

Something went wrong. Please try again later.