← back to search

Timothy M. Chan

University of Illinois Urbana-Champaign · US
🔎 Find collaborators in Computer Graphics and Computer-Aided Design · Computational Theory and Mathematics →
Search 5.9M scientists by topic, h-index, country & funding — free.
Area of research
Computer Graphics and Computer-Aided Design · Computational Theory and Mathematics
Research interest
Research interests include Computational Geometry and Mesh Generation, Complexity and Algorithms in Graphs, Data Management and Algorithms, and Advanced Graph Theory Research.
h-index
44
citations
6,243
works
326
NIH funding
—
primary concept
—
email
✉ Find email ↗

Recent publications

Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees
ACM Transactions on Algorithms 2024cited by 2position: contributordoi
Faster Algorithms for Largest Empty Rectangles and Boxes
Discrete & Computational Geometry 2023cited by 2position: contributordoi
More on change-making and related problems
Journal of Computer and System Sciences 2022cited by 7position: contributordoi
Deterministic APSP, Orthogonal Vectors, and More
ACM Transactions on Algorithms 2020cited by 22position: contributordoi
Deterministic APSP, Orthogonal Vectors, and More
ACM Transactions on Algorithms 2020cited by 21position: firstdoi
Smallest k-Enclosing Rectangle Revisited
Discrete & Computational Geometry 2020cited by 12position: contributordoi
Dynamic Geometric Data Structures via Shallow Cuttings
Discrete & Computational Geometry 2020cited by 7position: contributordoi
More Logarithmic-factor Speedups for 3SUM, (median,+)-convolution, and Some Geometric 3SUM-hard Problems
ACM Transactions on Algorithms 2019cited by 16position: contributordoi
Tree Drawings Revisited
Discrete & Computational Geometry 2019cited by 7position: contributordoi
Faster Approximate Diameter and Distance Oracles in Planar Graphs
Algorithmica 2019cited by 5position: contributordoi
Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back
Discrete & Computational Geometry 2019cited by 4position: contributordoi
Two Approaches to Building Time-Windowed Geometric Data Structures
Algorithmica 2019cited by 2position: contributordoi
Exact algorithms and APX-hardness results for geometric packing and covering problems
Computational Geometry 2012cited by 72position: firstdoi

Grants

No grants ingested yet.

Frequent collaborators

— · 11 papers (2019–2024)Ryan Williams · Palo Alto University1 papers (2020–2020)Da Wei Zheng · University of British Columbia1 papers (2024–2024)Qizheng He · Society for Industrial and Applied Mathematics1 papers (2022–2022)Sariel Har-Peled · University of Illinois System1 papers (2020–2020)Elyot Grant · Massachusetts Institute of Technology1 papers (2012–2012)
Looking for a research collaborator?
Search millions of scientists by field, institution, impact, and funding status — see their work, find their email, and reach out directly.
Find collaborators in Computer Graphics and Computer-Aided Design · Computational Theory and Mathematics →