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 52 Citations 7,864 171 World Ranking 2593 National Ranking 1382
Mathematics D-index 49 Citations 7,159 173 World Ranking 594 National Ranking 303

Overview

What is he best known for?

The fields of study he is best known for:

  • Combinatorics
  • Algorithm
  • Geometry

Timothy M. Chan mostly deals with Combinatorics, Discrete mathematics, Time complexity, Computational geometry and Algorithm. His Combinatorics research is multidisciplinary, incorporating elements of Extreme point and Convex hull. His Discrete mathematics study incorporates themes from Matching and Logarithm.

His work deals with themes such as Range and Range searching, which intersect with Time complexity. His Computational geometry research focuses on Linear space and how it relates to Packing problems, Disjoint sets and Set packing. The various areas that Timothy M. Chan examines in his Algorithm study include Dimension, Euclidean space, Matrix multiplication, Function and Closest point.

His most cited work include:

  • Optimal output-sensitive convex hull algorithms in two and three dimensions (284 citations)
  • Characterization of HPV and host genome interactions in primary head and neck cancers. (200 citations)
  • Orthogonal range searching on the RAM, revisited (172 citations)

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

The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Computational geometry, Binary logarithm and Algorithm. Timothy M. Chan has researched Combinatorics in several fields, including Upper and lower bounds, Convex hull and Constant. His Discrete mathematics course of study focuses on Matrix multiplication and Intersection graph and Sublinear function.

His work on Range searching as part of general Computational geometry study is frequently linked to Running time, bridging the gap between disciplines. He has included themes like Simple and Plane in his Binary logarithm study. His Algorithm research incorporates themes from Streaming algorithm and Euclidean space.

He most often published in these fields:

  • Combinatorics (81.48%)
  • Discrete mathematics (32.32%)
  • Computational geometry (21.55%)

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

  • Combinatorics (81.48%)
  • Binary logarithm (20.54%)
  • Closest pair of points problem (7.74%)

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

Timothy M. Chan mainly investigates Combinatorics, Binary logarithm, Closest pair of points problem, Upper and lower bounds and Approximation algorithm. The Combinatorics study combines topics in areas such as Range, Rectangle and Constant. His Constant research incorporates elements of Unit cube and Computational geometry.

His Binary logarithm study combines topics in areas such as Range searching, Simple, Set cover problem and Unit. His Upper and lower bounds research includes themes of Path and Binary tree. His research investigates the connection with Approximation algorithm and areas like Fast Fourier transform which intersect with concerns in Property testing.

Between 2018 and 2021, his most popular works were:

  • Clonal Decomposition and DNA Replication States Defined by Scaled Single-Cell Genome Sequencing (45 citations)
  • Clonal Decomposition and DNA Replication States Defined by Scaled Single-Cell Genome Sequencing (45 citations)
  • Probabilistic cell type assignment of single-cell transcriptomic data reveals spatiotemporal microenvironment dynamics in human cancers (9 citations)

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

  • Combinatorics
  • Algorithm
  • Geometry

Timothy M. Chan focuses on Combinatorics, Binary logarithm, Approximation algorithm, Closest pair of points problem and Matrix multiplication. His work carried out in the field of Combinatorics brings together such families of science as Constant and Maxima and minima. His studies in Binary logarithm integrate themes in fields like Tree, Degree, Line, Orientation and Binary tree.

As a member of one scientific family, he mostly works in the field of Approximation algorithm, focusing on Hamming distance and, on occasion, Property testing. Timothy M. Chan combines subjects such as Sublinear function, Convex hull, Extreme point, Point and Hausdorff distance with his study of Closest pair of points problem. His Matrix multiplication research is multidisciplinary, incorporating perspectives in Dimension, Algorithm and Algebraic number.

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

Optimal output-sensitive convex hull algorithms in two and three dimensions

T. M. Chan.
Discrete and Computational Geometry (1996)

432 Citations

More Algorithms for All-Pairs Shortest Paths in Weighted Graphs

Timothy M. Chan.
SIAM Journal on Computing (2010)

285 Citations

Characterization of HPV and host genome interactions in primary head and neck cancers.

Michael Parfenov;Chandra Sekhar Pedamallu;Nils Gehlenborg;Nils Gehlenborg;Samuel S. Freeman.
Proceedings of the National Academy of Sciences of the United States of America (2014)

275 Citations

Orthogonal range searching on the RAM, revisited

Timothy M. Chan;Kasper Green Larsen;Mihai Pătraşcu.
symposium on computational geometry (2011)

207 Citations

Polynomial-time approximation schemes for packing and piercing fat objects

Timothy M. Chan.
Journal of Algorithms (2003)

177 Citations

Faster core-set constructions and data-stream algorithms in fixed dimensions

Timothy M. Chan.
Computational Geometry: Theory and Applications (2006)

169 Citations

Output-sensitive results on convex hulls, extreme points, and related problems

T. M. Chan.
Discrete and Computational Geometry (1996)

167 Citations

Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus

Timothy Moon-Yew Chan.
symposium on computational geometry (2000)

160 Citations

Approximate nearest neighbor queries revisited

Timothy M. Chan.
Discrete and Computational Geometry (1998)

143 Citations

An optimal randomized algorithm for maximum Tukey depth

Timothy M. Chan.
symposium on discrete algorithms (2004)

136 Citations

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

Contact us

Best Scientists Citing Timothy M. Chan

Micha Sharir

Micha Sharir

Tel Aviv University

Publications: 89

Pankaj K. Agarwal

Pankaj K. Agarwal

Duke University

Publications: 77

Sariel Har-Peled

Sariel Har-Peled

University of Illinois at Urbana-Champaign

Publications: 68

gonzalo navarro

gonzalo navarro

University of Chile

Publications: 53

Haim Kaplan

Haim Kaplan

Tel Aviv University

Publications: 33

David M. Mount

David M. Mount

University of Maryland, College Park

Publications: 32

David Eppstein

David Eppstein

University of California, Irvine

Publications: 31

Prosenjit Bose

Prosenjit Bose

Carleton University

Publications: 31

Michael T. Goodrich

Michael T. Goodrich

University of California, Irvine

Publications: 31

Ryan Williams

Ryan Williams

MIT

Publications: 29

Boris Aronov

Boris Aronov

New York University

Publications: 27

J. Ian Munro

J. Ian Munro

University of Waterloo

Publications: 24

Kasturi Varadarajan

Kasturi Varadarajan

University of Iowa

Publications: 22

Joseph S. B. Mitchell

Joseph S. B. Mitchell

Stony Brook University

Publications: 22

Mark de Berg

Mark de Berg

Eindhoven University of Technology

Publications: 19

Jeff Erickson

Jeff Erickson

University of Illinois at Urbana-Champaign

Publications: 19

Something went wrong. Please try again later.