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 31 Citations 4,734 95 World Ranking 7686 National Ranking 3605
Mathematics D-index 35 Citations 5,259 106 World Ranking 1458 National Ranking 637

Overview

What is he best known for?

The fields of study he is best known for:

  • Combinatorics
  • Geometry
  • Algorithm

Jeff Erickson mainly investigates Combinatorics, Discrete mathematics, Point, Homotopy and Upper and lower bounds. His work deals with themes such as Boundary, Convex hull and Greedy algorithm, which intersect with Combinatorics. His research integrates issues of Rectangle, Cover, Computational topology and Search engine indexing in his study of Discrete mathematics.

His Point study integrates concerns from other disciplines, such as Voronoi diagram, Line, Domain and Algorithm. His Homotopy research is multidisciplinary, relying on both Image, Simplicial complex, Type, Finite set and Euclidean geometry. His studies deal with areas such as Binary logarithm, Medial axis, Dimension and Binary number as well as Upper and lower bounds.

His most cited work include:

  • Indexing moving points (229 citations)
  • Greedy optimal homotopy and homology generators (196 citations)
  • Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions (151 citations)

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

His main research concerns Combinatorics, Discrete mathematics, Time complexity, Upper and lower bounds and Planar graph. The concepts of his Combinatorics study are interwoven with issues in Homotopy, Surface and Computational topology. He has included themes like Point, Plane and Hyperplane in his Discrete mathematics study.

His Point research incorporates themes from Algorithm, Delaunay triangulation, Type, Finite set and Line. His study on Time complexity also encompasses disciplines like

  • Directed graph together with Homology,
  • Minimum cut which connect with Greedy algorithm. He has researched Upper and lower bounds in several fields, including Model of computation, Computational geometry, Medial axis and Dimension.

He most often published in these fields:

  • Combinatorics (68.75%)
  • Discrete mathematics (37.50%)
  • Time complexity (17.05%)

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

  • Combinatorics (68.75%)
  • Planar graph (13.64%)
  • Homotopy (11.93%)

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

Jeff Erickson spends much of his time researching Combinatorics, Planar graph, Homotopy, Discrete mathematics and Upper and lower bounds. His Combinatorics research focuses on Torus and how it relates to Geodesic. His research on Planar graph also deals with topics like

  • Treewidth which is related to area like Jordan curve theorem, Chordal graph, Tree-depth, Indifference graph and 1-planar graph,
  • Embedding that intertwine with fields like Matrix multiplication and Euclidean geometry.

His research in Homotopy tackles topics such as Contractible space which are related to areas like Boundary. His study explores the link between Discrete mathematics and topics such as Simple polygon that cross with problems in Open problem, Bounded function and Point. He interconnects Medial graph and Surface in the investigation of issues within Upper and lower bounds.

Between 2014 and 2021, his most popular works were:

  • Detecting weakly simple polygons (25 citations)
  • Recognizing Weakly Simple Polygons (15 citations)
  • Untangling Planar Curves (11 citations)

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

  • Geometry
  • Combinatorics
  • Algorithm

His primary areas of investigation include Combinatorics, Planar graph, Discrete mathematics, Homotopy and Upper and lower bounds. The various areas that he examines in his Combinatorics study include Simple, Geodesic and Convex hull. His Planar graph study combines topics from a wide range of disciplines, such as Time complexity, Algorithm, Optimization problem and Flow network.

His work carried out in the field of Discrete mathematics brings together such families of science as Model of computation, Real RAM and Art gallery problem. His biological study spans a wide range of topics, including Matching, Jordan curve theorem, Contractible space and Treewidth. The Upper and lower bounds study combines topics in areas such as Boundary, Surface, Euler characteristic and Exponential function.

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

Indexing moving points

Pankaj K. Agarwal;Lars Arge;Jeff Erickson.
Journal of Computer and System Sciences (2003)

458 Citations

Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions

David Eppstein;Jeff Erickson.
Discrete and Computational Geometry (1999)

267 Citations

Greedy optimal homotopy and homology generators

Jeff Erickson;Kim Whittlesey.
symposium on discrete algorithms (2005)

254 Citations

Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries

David Bremner;Erik Demaine;Jeff Erickson;John Iacono.
Discrete and Computational Geometry (2005)

233 Citations

Optimally Cutting a Surface into a Disk

Jeff Erickson;Sariel Har-Peled.
Discrete and Computational Geometry (2004)

232 Citations

Indexing moving points (extended abstract)

Pankaj K. Agarwal;Lars Arge;Jeff Erickson.
symposium on principles of database systems (2000)

185 Citations

Iterated nearest neighbors and finding minimal polytopes

David Eppstein;Jeff Erickson.
Discrete and Computational Geometry (1994)

158 Citations

Efficient searching with linear constraints

Pankaj K. Agarwal;Lars Arge;Jeff Erickson;Paolo G. Franciosa.
symposium on principles of database systems (1998)

122 Citations

Minimum-cost coverage of point sets by disks

Helmut Alt;Esther M. Arkin;Hervé Brönnimann;Jeff Erickson.
symposium on computational geometry (2006)

116 Citations

Kinetic binary space partitions for intersecting segments and disjoint triangles

Pankaj K. Agarwal;Jeff Erickson;Leonidas J. Guibas.
symposium on discrete algorithms (1998)

96 Citations

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

Contact us

Best Scientists Citing Jeff Erickson

David Eppstein

David Eppstein

University of California, Irvine

Publications: 41

Pankaj K. Agarwal

Pankaj K. Agarwal

Duke University

Publications: 37

Sariel Har-Peled

Sariel Har-Peled

University of Illinois at Urbana-Champaign

Publications: 34

Micha Sharir

Micha Sharir

Tel Aviv University

Publications: 31

Erik D. Demaine

Erik D. Demaine

MIT

Publications: 31

Leonidas J. Guibas

Leonidas J. Guibas

Stanford University

Publications: 26

Mark de Berg

Mark de Berg

Eindhoven University of Technology

Publications: 24

Yufei Tao

Yufei Tao

Chinese University of Hong Kong

Publications: 23

Tamal K. Dey

Tamal K. Dey

Purdue University West Lafayette

Publications: 22

Michael T. Goodrich

Michael T. Goodrich

University of California, Irvine

Publications: 21

Timothy M. Chan

Timothy M. Chan

University of Illinois at Urbana-Champaign

Publications: 20

Xianfeng Gu

Xianfeng Gu

Stony Brook University

Publications: 18

David M. Mount

David M. Mount

University of Maryland, College Park

Publications: 17

George Kollios

George Kollios

Boston University

Publications: 16

Marc van Kreveld

Marc van Kreveld

Utrecht University

Publications: 16

Haim Kaplan

Haim Kaplan

Tel Aviv University

Publications: 16

Something went wrong. Please try again later.