Timothy M. Chan - Concepedia

Author

Timothy M. Chan

Also Known As

Andrei Constantin, Chan, Timothy, Chan, Timothy Hoo Wai, Chan, Timothy M., Chan, Timothy Moon-Yew, Demaine, Erik D., Jelani Nelson, Journal Of Computational Geometry, T. M. Chan, T.M. Chan

330

Publications

6.2K

Citations

H-Index

114

Concepts

All Affiliations

University of Waterloo University of Miami University of Illinois Urbana-Champaign

About

Timothy M. Chan is an author at University of Waterloo specializing in engineering, combinatorial optimization, and computational geometry.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	39	92	4.3K
2	Education	10	10	496
3	Language Studies	3	3	110
4	Arts	1	1	24
5	Business	1	1	25

Timothy M. Chan

120

Publications

5.2K

Citations

H-Index

Page 1

	Year	Citations
Optimal output-sensitive convex hull algorithms in two and three dimensions Timothy M. Chan Discrete & Computational Geometry Mathematical ProgrammingGeometric ModelingNumerical AnalysisEngineeringGeometric Algorithm	1996	334
Orthogonal range searching on the RAM, revisited Timothy M. Chan, Kasper Green Larsen, Mihai Pǎtraşcu EngineeringComputational ComplexityRange SearchingSecond Data StructureData Structure	2011	195
Polynomial-time approximation schemes for packing and piercing fat objects Timothy M. Chan Journal of Algorithms Mathematical ProgrammingNumerical AnalysisGeometric ModelingEngineeringGeometric Algorithm	2003	180
More algorithms for all-pairs shortest paths in weighted graphs Timothy M. Chan EngineeringAll-pairsshortest PathsNetwork AnalysisEducationComputational Complexity	2007	165
Approximation Algorithms for Maximum Independent Set of Pseudo-Disks Timothy M. Chan, Sariel Har-Peled Discrete & Computational Geometry Mathematical ProgrammingEngineeringGeometric AlgorithmApproximation MethodApproximation Algorithms	2012	129
An optimal randomized algorithm for maximum Tukey depth Timothy M. Chan Symposium on Discrete Algorithms Mathematical ProgrammingEngineeringComputational ComplexityRange SearchingDepth Map	2004	117
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs Timothy M. Chan SIAM Journal on Computing	2010	110
More planar two-center algorithms Timothy M. Chan Computational Geometry	1999	108
Clustered Integer 3SUM via Additive Combinatorics Timothy M. Chan, Moshe Lewenstein Mathematical ProgrammingCluster ComputingClustered Integer 3SumEngineeringCombinatory Analysis	2015	107
Output-sensitive results on convex hulls, extreme points, and related problems Timothy M. Chan Discrete & Computational Geometry Mathematical ProgrammingEngineeringGeometric AlgorithmConvex OptimizationConvex Hull	1996	101

Page 1