D-Index & Metrics Best Publications

D-Index & Metrics 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.

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
Mathematics D-index 32 Citations 4,590 250 World Ranking 2402 National Ranking 1019
Computer Science D-index 32 Citations 4,645 246 World Ranking 9290 National Ranking 4235

Research.com Recognitions

Awards & Achievements

1995 - Fellow of Alfred P. Sloan Foundation

Overview

What is he best known for?

The fields of study he is best known for:

  • Geometry
  • Combinatorics
  • Algebra

His primary scientific interests are in Combinatorics, Discrete mathematics, Randomized algorithm, Regular polygon and Space. His Combinatorics research includes elements of Convex polytope and Polygon. His research integrates issues of Hyperplane and Approximation algorithm in his study of Discrete mathematics.

His Randomized algorithm study incorporates themes from Plane and Computational geometry. He has researched Regular polygon in several fields, including Algebraic geometry, Partition and Conjecture. His work deals with themes such as Motion, Line, Intersection and Plane, which intersect with Space.

His most cited work include:

  • Minkowski-Type Theorems and Least-Squares Clustering (155 citations)
  • Quasi-planar graphs have a linear number of edges (126 citations)
  • Small-Size $ps$-Nets for Axis-Parallel Rectangles and Boxes (108 citations)

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

Boris Aronov mostly deals with Combinatorics, Discrete mathematics, Regular polygon, Plane and Space. He combines subjects such as Point, Voronoi diagram and Upper and lower bounds with his study of Combinatorics. His Point study combines topics from a wide range of disciplines, such as Algorithm and Polygon.

His Discrete mathematics research integrates issues from Computational geometry, Hyperplane, Combinatorial complexity and Boundary. The various areas that Boris Aronov examines in his Regular polygon study include Polyhedron, Discrete geometry, Polytope and Constant. His research integrates issues of Time complexity and Randomized algorithm in his study of Plane.

He most often published in these fields:

  • Combinatorics (78.06%)
  • Discrete mathematics (35.02%)
  • Regular polygon (16.03%)

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

  • Combinatorics (78.06%)
  • Polynomial (7.17%)
  • Algebraic number (6.75%)

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

Boris Aronov spends much of his time researching Combinatorics, Polynomial, Algebraic number, Discrete mathematics and Plane. His Combinatorics research includes themes of Point, Computational geometry and Regular polygon. His study in Regular polygon is interdisciplinary in nature, drawing from both Type and Conjecture.

His research on Polynomial also deals with topics like

  • Complex plane, Cartesian product and Sign most often made with reference to Algebraic curve,
  • Integer that intertwine with fields like Quantifier elimination, Fraction, Randomized algorithm and Bounded function. His Plane research is multidisciplinary, incorporating perspectives in Upper and lower bounds, Time complexity, Measure, Dominating set and Cardinality. Space and Polygon covering is closely connected to Simple polygon in his research, which is encompassed under the umbrella topic of Binary logarithm.

Between 2013 and 2021, his most popular works were:

  • Convex equipartitions: the spicy chicken theorem (40 citations)
  • Triangles in Space or Building (and Analyzing) Castles in the Air (26 citations)
  • Improved Bounds for the Union of Locally Fat Objects in the Plane (25 citations)

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

  • Geometry
  • Combinatorics
  • Algebra

Boris Aronov mainly investigates Combinatorics, Polynomial, Algebraic number, Discrete mathematics and Disjoint sets. His Combinatorics research incorporates elements of Algebraic geometry, Plane and Regular polygon. Boris Aronov interconnects Degree, Computational geometry and Integer in the investigation of issues within Polynomial.

His studies deal with areas such as Voronoi diagram, Point, Point location and Open problem as well as Computational geometry. His Discrete mathematics study incorporates themes from Function, Segmentation, Dynamic programming and Monotone polygon. He combines subjects such as Diagram, Order and Trajectory with his study of Disjoint sets.

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

Minkowski-Type Theorems and Least-Squares Clustering

Franz Aurenhammer;F. Hoffmann;Boris Aronov.
Algorithmica (1998)

231 Citations

Minkowski-Type Theorems and Least-Squares Clustering

Franz Aurenhammer;F. Hoffmann;Boris Aronov.
Algorithmica (1998)

231 Citations

On Approximating the Depth and Related Problems

Boris Aronov;Sariel Har-Peled.
SIAM Journal on Computing (2008)

176 Citations

On Approximating the Depth and Related Problems

Boris Aronov;Sariel Har-Peled.
SIAM Journal on Computing (2008)

176 Citations

Small-Size $ps$-Nets for Axis-Parallel Rectangles and Boxes

Boris Aronov;Esther Ezra;Micha Sharir.
SIAM Journal on Computing (2010)

170 Citations

Small-Size $ps$-Nets for Axis-Parallel Rectangles and Boxes

Boris Aronov;Esther Ezra;Micha Sharir.
SIAM Journal on Computing (2010)

170 Citations

Quasi-planar graphs have a linear number of edges

Pankaj K. Agarwal;Boris Aronov;János Pach;János Pach;János Pach;Richard Pollack.
Combinatorica (1997)

153 Citations

Quasi-planar graphs have a linear number of edges

Pankaj K. Agarwal;Boris Aronov;János Pach;János Pach;János Pach;Richard Pollack.
Combinatorica (1997)

153 Citations

Fréchet distance for curves, revisited

Boris Aronov;Sariel Har-Peled;Christian Knauer;Yusu Wang.
european symposium on algorithms (2006)

147 Citations

Fréchet distance for curves, revisited

Boris Aronov;Sariel Har-Peled;Christian Knauer;Yusu Wang.
european symposium on algorithms (2006)

147 Citations

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

Contact us

Best Scientists Citing Boris Aronov

Micha Sharir

Micha Sharir

Tel Aviv University

Publications: 171

Pankaj K. Agarwal

Pankaj K. Agarwal

Duke University

Publications: 81

Sariel Har-Peled

Sariel Har-Peled

University of Illinois at Urbana-Champaign

Publications: 74

János Pach

János Pach

Alfréd Rényi Institute of Mathematics

Publications: 65

Timothy M. Chan

Timothy M. Chan

University of Illinois at Urbana-Champaign

Publications: 35

Dan Halperin

Dan Halperin

Tel Aviv University

Publications: 35

Michiel Smid

Michiel Smid

Carleton University

Publications: 30

Mark de Berg

Mark de Berg

Eindhoven University of Technology

Publications: 27

Leonidas J. Guibas

Leonidas J. Guibas

Stanford University

Publications: 25

Herbert Edelsbrunner

Herbert Edelsbrunner

Institute of Science and Technology Austria

Publications: 23

Joseph S. B. Mitchell

Joseph S. B. Mitchell

Stony Brook University

Publications: 22

Joachim Gudmundsson

Joachim Gudmundsson

University of Sydney

Publications: 22

Emo Welzl

Emo Welzl

ETH Zurich

Publications: 21

Prosenjit Bose

Prosenjit Bose

Carleton University

Publications: 21

Bernard Chazelle

Bernard Chazelle

Princeton University

Publications: 21

Gábor Tardos

Gábor Tardos

Alfréd Rényi Institute of Mathematics

Publications: 21

Trending Scientists

Monson H. Hayes

Monson H. Hayes

George Mason University

Andrew Schmitz

Andrew Schmitz

University of Florida

Philippe Souplet

Philippe Souplet

Paris 13 University

Siyuan Yu

Siyuan Yu

Sun Yat-sen University

Mustafizur Rahman

Mustafizur Rahman

Memorial University of Newfoundland

Yucheng Dong

Yucheng Dong

Sichuan University

Jin-Yeon Kim

Jin-Yeon Kim

Georgia Institute of Technology

Anne B. McCoy

Anne B. McCoy

University of Washington

Byoung Koun Min

Byoung Koun Min

Korea Institute of Science and Technology

Sjoerd Hoogland

Sjoerd Hoogland

University of Toronto

G. C. Waghorn

G. C. Waghorn

AgResearch

Seppo Meri

Seppo Meri

University of Helsinki

Daniel Frank Mcginnis

Daniel Frank Mcginnis

University of Geneva

Johannes van der Plicht

Johannes van der Plicht

University of Groningen

Eberhard Ritz

Eberhard Ritz

Heidelberg University

Matthias Ruth

Matthias Ruth

Northeastern University

Something went wrong. Please try again later.