A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections. - Timothy M. Chan (CCCG, 1994)

The complexity of a single face of a minkowski sum. - Sariel Har-Peled; Timothy M. Chan; Boris Aronov; Dan Halperin; Jack Snoeyink (CCCG, 1995)

Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. - Timothy M. Chan; Jack Snoeyink; Chee-Keng Yap (SODA, 1995)

Fixed-Dimensional Linear Programming Queries Made Easy. - Timothy M. Chan (SCG, 1996)

Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. - Timothy M. Chan; Michael T. Goodrich; S. Rao Kosaraju; Roberto Tamassia (GD, 1996)

Optimal Output-Sensitive Convex Hull Algorithms in Two and Three Dimensions. - Timothy M. Chan (Discret. Comput. Geom., 1996)

Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems. - Timothy M. Chan (Discret. Comput. Geom., 1996)

Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams. - Timothy M. Chan; Jack Snoeyink; Chee-Keng Yap (Discret. Comput. Geom., 1997)

Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three Dimensions. - Timothy M. Chan (FOCS, 1998)

On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. - Pankaj K. Agarwal; Boris Aronov; Timothy M. Chan; Micha Sharir (Discret. Comput. Geom., 1998)

Approximate Nearest Neighbor Queries Revisited. - Timothy M. Chan (Discret. Comput. Geom., 1998)

Backwards Analysis of the Karger-Klein-Tarjan Algorithm for Minimum Spanning Trees. - Timothy M. Chan (Inf. Process. Lett., 1998)

Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming. - Timothy M. Chan (J. Algorithms, 1998)

Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time. - Timothy M. Chan (FOCS, 1999)

More planar two-center algorithms. - Timothy M. Chan (Comput. Geom., 1999)

Geometric Applications of a Randomized Optimization Technique. - Timothy M. Chan (Discret. Comput. Geom., 1999)

Reporting curve segment intersections using restricted predicates. - Timothy M. Chan (Comput. Geom., 2000)

Random Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three Dimensions. - Timothy M. Chan (SIAM J. Comput., 2000)

A fully dynamic algorithm for planar. - Timothy M. Chan (SCG, 2001)

On Enumerating and Selecting Distances. - Timothy M. Chan (Int. J. Comput. Geom. Appl., 2001)

Dynamic planar convex hull operations in near-logarithmaic amortized time. - Timothy M. Chan (J. ACM, 2001)

Fly Cheaply: On the Minimum Fuel Consumption Problem. - Timothy M. Chan; Alon Efrat (J. Algorithms, 2001)

Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. - Therese Biedl; Timothy M. Chan; Erik D. Demaine; Martin L. Demaine; Paul Nijjar; Ryuhei Uehara; Ming-wei Wang (CCCG, 2002)

Drawing k2, n: A lower bound. - Therese Biedl; Timothy M. Chan; Alejandro López-Ortiz (CCCG, 2002)

Closest-point problems simplified on the RAM. - Timothy M. Chan (SODA, 2002)

A Near-Linear Area Bound for Drawing Binary Trees. - Timothy M. Chan (Algorithmica, 2002)

Optimizing area and aspect ration in straight-line orthogonal tree drawings. - Timothy M. Chan; Michael T. Goodrich; S. Rao Kosaraju; Roberto Tamassia (Comput. Geom., 2002)

Balanced k-colorings. - Therese C. Biedl; Eowyn Cenek; Timothy M. Chan; Erik D. Demaine; Martin L. Demaine; Rudolf Fleischer; Ming-wei Wang (Discret. Math., 2002)

Approximating the Diameter, Width, Smallest Enclosing Cylinder, and Minimum-Width Annulus. - Timothy M. Chan (Int. J. Comput. Geom. Appl., 2002)

Curves of width one and the river shore problem. - Timothy M. Chan; Alexander Golynski; Alejandro López-Ortiz; Claude-Guy Quimper (CCCG, 2003)

A Space-Efficient Algorithm for Segment Intersection. - Eric Y. Chen; Timothy M. Chan (CCCG, 2003)

the asteroid surveying problem and other puzzles. - Timothy M. Chan; Alexander Golynski; Alejandro López-Ortiz; Claude-Guy Quimper (SCG, 2003)

On Levels in Arrangements of Curves. - Timothy M. Chan (Discret. Comput. Geom., 2003)

A Fully Dynamic Algorithm for Planar Width. - Timothy M. Chan (Discret. Comput. Geom., 2003)

Drawing K2, n: A lower bound. - Therese Biedl; Timothy M. Chan; Alejandro López-Ortiz (Inf. Process. Lett., 2003)

Polynomial-time approximation schemes for packing and piercing fat objects. - Timothy M. Chan (J. Algorithms, 2003)

Semi-Online Maintenance of Geometric Optima and Measures. - Timothy M. Chan (SIAM J. Comput., 2003)

Towards in-place geometric algorithms and data structures. - Hervé Brönnimann; Timothy M. Chan; Eric Y. Chen (SCG, 2004)

Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time. - Hervé Brönnimann; Timothy M. Chan (LATIN, 2004)

An optimal randomized algorithm for maximum Tukey depth. - Timothy M. Chan (SODA, 2004)

Fun-Sort–or the chaos of unordered binary search. - Therese Biedl; Timothy M. Chan; Erik D. Demaine; Rudolf Fleischer; Mordecai J. Golin; James A. King; J. Ian Munro (Discret. Appl. Math., 2004)

Euclidean Bounded-Degree Spanning Tree Ratios. - Timothy M. Chan (Discret. Comput. Geom., 2004)

A note on maximum independent sets in rectangle intersection graphs. - Timothy M. Chan (Inf. Process. Lett., 2004)

Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs. - Peyman Afshani; Timothy M. Chan (CCCG, 2005)

Approximating the piercing number for unit-height rectangles. - Timothy M. Chan; Abdullah-Al Mahmood (CCCG, 2005)

Space-Efficient Algorithms for Klee's Measure Problem. - Eric Y. Chen; Timothy M. Chan (CCCG, 2005)

Finding the shortest bottleneck edge in a parametric minimum spanning tree. - Timothy M. Chan (SODA, 2005)

A note on 3D orthogonal graph drawing. - Therese Biedl; Timothy M. Chan (Discret. Appl. Math., 2005)

Balanced vertex-orderings of graphs. - Therese Biedl; Timothy M. Chan; Yashar Ganjali; Mohammad Taghi Hajiaghayi; David R. Wood (Discret. Appl. Math., 2005)

On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences. - Timothy M. Chan (Discret. Comput. Geom., 2005)

Low-Dimensional Linear Programming with Violations. - Timothy M. Chan (SIAM J. Comput., 2005)

A Simple Streaming Algorithm for Minimum Enclosing Balls. - Hamid Zarrabi-Zadeh; Timothy M. Chan (CCCG, 2006)

Necklaces, Convolutions, and X + Y. - David Bremner; Timothy M. Chan; Erik D. Demaine; Jeff Erickson 001; Ferran Hurtado; John Iacono; Stefan Langerman; Perouz Taslakian (ESA, 2006)

Point Location in o(log n) Time, Voronoi Diagrams in o(n log n) Time, and Other Transdichotomous Results in Computational Geometry. - Timothy M. Chan (FOCS, 2006)

All-pairs shortest paths for unweighted undirected graphs in o(mn) time. - Timothy M. Chan (SODA, 2006)

Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time. - Hervé Brönnimann; Timothy M. Chan (Comput. Geom., 2006)

Faster core-set constructions and data-stream algorithms in fixed dimensions. - Timothy M. Chan (Comput. Geom., 2006)

Three problems about simple polygons. - Timothy M. Chan (Comput. Geom., 2006)

Geometric Optimization Problems over Sliding Windows. - Timothy M. Chan; Bashir S. Sadjad (Int. J. Comput. Geom. Appl., 2006)

Dynamic Subgraph Connectivity with Geometric Applications. - Timothy M. Chan (SIAM J. Comput., 2006)

Voronoi diagrams in n·2osqrt(lg lg n) time. - Timothy M. Chan; Mihai Patrascu (STOC, 2007)

Multi-Pass Geometric Algorithms. - Timothy M. Chan; Eric Y. Chen (Discret. Comput. Geom., 2007)

On levels in arrangements of curves, iii: further improvements. - Timothy M. Chan (SCG, 2008)

In-place 2-d nearest neighbor search. - Timothy M. Chan; Eric Y. Chen (SODA, 2008)

All-Pairs Shortest Paths with Real Weights in O ( n 3/log n ) Time. - Timothy M. Chan (Algorithmica, 2008)

Well-separated pair decomposition in linear time? - Timothy M. Chan (Inf. Process. Lett., 2008)

Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection. - Timothy M. Chan; Eric Y. Chen (SCG, 2009)

Optimal halfspace range reporting in three dimensions. - Peyman Afshani; Timothy M. Chan (SODA, 2009)

Dynamic Connectivity for Axis-Parallel Rectangles. - Peyman Afshani; Timothy M. Chan (Algorithmica, 2009)

An Improved Algorithm for Online Unit Clustering. - Hamid Zarrabi-Zadeh; Timothy M. Chan (Algorithmica, 2009)

Dynamic ham-sandwich cuts in the plane. - Timothy G. Abbott; Michael A. Burr; Timothy M. Chan; Erik D. Demaine; Martin L. Demaine; John Hugg; Daniel Kane 001; Stefan Langerman; Jelani Nelson; Eynat Rafalin; Kathryn Seyboth; Vincent Yeung (Comput. Geom., 2009)

On Approximate Range Counting and Depth. - Peyman Afshani; Timothy M. Chan (Discret. Comput. Geom., 2009)

Dynamic Coresets. - Timothy M. Chan (Discret. Comput. Geom., 2009)

A Randomized Algorithm for Online Unit Clustering. - Timothy M. Chan; Hamid Zarrabi-Zadeh (Theory Comput. Syst., 2009)

Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time. - Timothy M. Chan; Mihai Patrascu (SIAM J. Comput., 2009)

Counting Inversions, Offline Orthogonal Range Counting, and Related Problems. - Timothy M. Chan; Mihai Patrascu (SODA, 2010)

A (slightly) faster algorithm for Klee's measure problem. - Timothy M. Chan (Comput. Geom., 2010)

Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection. - Timothy M. Chan; Eric Y. Chen (Comput. Geom., 2010)

Transdichotomous Results in Computational Geometry, II: Offline Search - Timothy M. Chan; Mihai Patrascu (CoRR, 2010)

A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries. - Timothy M. Chan (J. ACM, 2010)

More Algorithms for All-Pairs Shortest Paths in Weighted Graphs. - Timothy M. Chan (SIAM J. Comput., 2010)

Comparison-based time-space lower bounds for selection. - Timothy M. Chan (ACM Trans. Algorithms, 2010)

On the bichromatic k-set problem. - Timothy M. Chan (ACM Trans. Algorithms, 2010)

Bichromatic Line Segment Intersection Counting in O(n sqrt(log n)) Time. - Timothy M. Chan; Bryan T. Wilkinson (CCCG, 2011)

Exact Algorithms and APX-Hardness Results for Geometric Set Cover. - Elyot Grant; Timothy M. Chan (CCCG, 2011)

Orthogonal range searching on the RAM, revisited. - Timothy M. Chan; Kasper Green Larsen; Mihai Patrascu (SCG, 2011)

Stochastic minimum spanning trees in euclidean spaces. - Pegah Kamousi; Timothy M. Chan; Subhash Suri (SCG, 2011)

Computational Geometry for Non-Geometers: Recent Developments on Some Classical Problems. - Timothy M. Chan (SODA, 2011)

Dynamic Connectivity: Connecting to Networks and Geometry. - Timothy M. Chan; Mihai Patrascu; Liam Roditty (SIAM J. Comput., 2011)

Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set. - Timothy M. Chan (SCG, 2012)

Self-approaching Graphs. - Soroush Alamdari; Timothy M. Chan; Elyot Grant; Anna Lubiw; Vinayak Pathak (GD, 2012)

Combinatorial Geometry and Approximation Algorithms. - Timothy M. Chan (ISAAC, 2012)

Computing the Nearest Neighbor Transform Exactly with Only Double Precision. - David L. Millman; Steven Love; Timothy M. Chan; Jack Snoeyink (ISVD, 2012)

Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. - Timothy M. Chan; Elyot Grant; Jochen Könemann; Malcolm Sharpe (SODA, 2012)

Optimal Partition Trees. - Timothy M. Chan (Discret. Comput. Geom., 2012)

On Levels in Arrangements of Surfaces in Three Dimensions. - Timothy M. Chan (Discret. Comput. Geom., 2012)

Approximation Algorithms for Maximum Independent Set of Pseudo-Disks. - Timothy M. Chan; Sariel Har-Peled (Discret. Comput. Geom., 2012)

Three Problems about Dynamic Convex Hulls. - Timothy M. Chan (Int. J. Comput. Geom. Appl., 2012)

All-pairs shortest paths for unweighted undirected graphs in o(mn) time. - Timothy M. Chan (ACM Trans. Algorithms, 2012)

Quake Heaps: A Simple Alternative to Fibonacci Heaps. - Timothy M. Chan (Space-Efficient Data Structures, Streams, and Algorithms, 2013)

Klee's Measure Problem Made Easy. - Timothy M. Chan (FOCS, 2013)

Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations. - Timothy M. Chan; Hella-Franziska Hoffmann; Stephen Kiazyk; Anna Lubiw (GD, 2013)

Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers. - Timothy M. Chan; J. Ian Munro; Venkatesh Raman 001 (ISAAC, 2013)

Morphing Planar Graph Drawings with a Polynomial Number of Steps. - Soroush Alamdari; Patrizio Angelini; Timothy M. Chan; Giuseppe Di Battista; Fabrizio Frati; Anna Lubiw; Maurizio Patrignani; Vincenzo Roselli; Sahil Singla 001; Bryan T. Wilkinson (SODA, 2013)

Smart-Grid Electricity Allocation via Strip Packing with Slicing. - Soroush Alamdari; Therese Biedl; Timothy M. Chan; Elyot Grant; Krishnam Raju Jampani; Srinivasan Keshav; Anna Lubiw; Vinayak Pathak (WADS, 2013)

The Art of Shaving Logs. - Timothy M. Chan (WADS, 2013)

Persistent Predecessor Search and Orthogonal Point Location on the Word RAM. - Timothy M. Chan (ACM Trans. Algorithms, 2013)

Cuttings in 2D Revisited. - Timothy M. Chan (CCCG, 2014)

Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels. - Sunil Arya; Timothy M. Chan (SoCG, 2014)

Succinct Indices for Path Minimum, with Applications to Path Reporting. - Timothy M. Chan; Meng He 001; J. Ian Munro; Gelin Zhou (ESA, 2014)

Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM. - Peyman Afshani; Timothy M. Chan; Konstantinos Tsakalidis (ICALP (1), 2014)

On Hardness of Jumbled Indexing. - Amihood Amir; Timothy M. Chan; Moshe Lewenstein; Noa Lewenstein (ICALP (1), 2014)

Necklaces, Convolutions, and X+Y. - David Bremner; Timothy M. Chan; Erik D. Demaine; Jeff Erickson 001; Ferran Hurtado; John Iacono; Stefan Langerman; Mihai Patrascu; Perouz Taslakian (Algorithmica, 2014)

Exact algorithms and APX-hardness results for geometric packing and covering problems. - Timothy M. Chan; Elyot Grant (Comput. Geom., 2014)

Streaming and dynamic algorithms for minimum enclosing balls in high dimensions. - Timothy M. Chan; Vinayak Pathak (Comput. Geom., 2014)

Closest pair and the post office problem for stochastic points. - Pegah Kamousi; Timothy M. Chan; Subhash Suri (Comput. Geom., 2014)

Guest Editors' Foreword. - Timothy M. Chan; Rolf Klein (Discret. Comput. Geom., 2014)

Maximum-weight planar boxes in O(n2) time (and better). - Jérémy Barbay; Timothy M. Chan; Gonzalo Navarro 001; Pablo Pérez-Lantero (Inf. Process. Lett., 2014)

Linear-Space Data Structures for Range Mode Query in Arrays. - Timothy M. Chan; Stephane Durocher; Kasper Green Larsen; Jason Morrison; Bryan T. Wilkinson (Theory Comput. Syst., 2014)

Time-Windowed Closest Pair. - Timothy M. Chan; Simon Pratt (CCCG, 2015)

Fast String Dictionary Lookup with One Error. - Timothy M. Chan; Moshe Lewenstein (CPM, 2015)

Multidimensional Range Selection. - Timothy M. Chan; Gelin Zhou (ISAAC, 2015)

Speeding up the Four Russians Algorithm by About One More Logarithmic Factor. - Timothy M. Chan (SODA, 2015)

Clustered Integer 3SUM via Additive Combinatorics. - Timothy M. Chan; Moshe Lewenstein (STOC, 2015)

Linear-Space Data Structures for Range Minority Query in Arrays. - Timothy M. Chan; Stephane Durocher; Matthew Skala; Bryan T. Wilkinson (Algorithmica, 2015)

Geometric red-blue set cover for unit squares and related problems. - Timothy M. Chan; Nan Hu (Comput. Geom., 2015)

Guest Editor's foreword. - Timothy M. Chan; Rolf Klein (Comput. Geom., 2015)

On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures. - Timothy M. Chan; Patrick Lee (Discret. Comput. Geom., 2015)

Drawing Partially Embedded and Simultaneously Planar Graphs. - Timothy M. Chan; Fabrizio Frati; Carsten Gutwenger; Anna Lubiw; Petra Mutzel; Marcus Schaefer 001 (J. Graph Algorithms Appl., 2015)

Finding median in read-only memory on integer input. - Timothy M. Chan; J. Ian Munro; Venkatesh Raman 001 (Theor. Comput. Sci., 2015)

Dynamic Streaming Algorithms for Epsilon-Kernels. - Timothy M. Chan (SoCG, 2016)

Two Approaches to Building Time-Windowed Geometric Data Structures. - Timothy M. Chan; Simon Pratt (SoCG, 2016)

Polynomial Representations of Threshold Functions and Algorithmic Applications. - Josh Alman; Timothy M. Chan; R. Ryan Williams (FOCS, 2016)

All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time. - Timothy M. Chan; Dimitrios Skrepetos (ISAAC, 2016)

A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions. - Timothy M. Chan (Discret. Comput. Geom., 2016)

Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings. - Timothy M. Chan; Konstantinos Tsakalidis (Discret. Comput. Geom., 2016)

Adaptive and Approximate Orthogonal Range Counting. - Timothy M. Chan; Bryan T. Wilkinson (ACM Trans. Algorithms, 2016)

Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges. - Therese Biedl; Timothy M. Chan; Martin Derka; Kshitij Jain 001; Anna Lubiw (GD, 2017)

On Guarding Orthogonal Polygons with Sliding Cameras. - Therese Biedl; Timothy M. Chan; Stephanie Lee; Saeed Mehrabi 001; Fabrizio Montecchiani; Hamideh Vosoughpour (WALCOM, 2017)

Succinct Indices for Path Minimum, with Applications. - Timothy M. Chan; Meng He 001; J. Ian Munro; Gelin Zhou (Algorithmica, 2017)

On the Succinct Representation of Equivalence Classes. - Hicham El-Zein; Moshe Lewenstein; J. Ian Munro; Venkatesh Raman 001; Timothy M. Chan (Algorithmica, 2017)

Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points. - Timothy M. Chan; Zahed Rahmati (Comput. Geom., 2017)

Dynamic data structures for approximate Hausdorff distance in the word RAM. - Timothy M. Chan; Dimitrios Skrepetos (Comput. Geom., 2017)

Instance-Optimal Geometric Algorithms. - Peyman Afshani; Jérémy Barbay; Timothy M. Chan (J. ACM, 2017)

How to Morph Planar Graph Drawings. - Soroush Alamdari; Patrizio Angelini; Fidel Barrera-Cruz; Timothy M. Chan; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Penny Haxell; Anna Lubiw; Maurizio Patrignani; Vincenzo Roselli; Sahil Singla 001; et al. (SIAM J. Comput., 2017)

Dynamic Planar Orthogonal Point Location in Sublogarithmic Time. - Timothy M. Chan; Konstantinos Tsakalidis (SoCG, 2018)

Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. - Timothy M. Chan; Thomas C. van Dijk; Krzysztof Fleszar 001; Joachim Spoerhase; Alexander Wolff 001 (ISAAC, 2018)

Approximation Schemes for 0-1 Knapsack. - Timothy M. Chan (SOSA, 2018)

A Clustering-Based Approach to Kinetic Closest Pair. - Zahed Rahmati; Timothy M. Chan (Algorithmica, 2018)

An improved approximation algorithm for the discrete Fréchet distance. - Timothy M. Chan; Zahed Rahmati (Inf. Process. Lett., 2018)

Applications of Chebyshev polynomials to low-dimensional computational geometry. - Timothy M. Chan (J. Comput. Geom., 2018)

Dynamic Orthogonal Range Searching on the RAM, Revisited. - Timothy M. Chan; Konstantinos Tsakalidis (J. Comput. Geom., 2018)

Towards an Optimal Method for Dynamic Planar Point Location. - Timothy M. Chan; Yakov Nekrich (SIAM J. Comput., 2018)

Improved Deterministic Algorithms for Linear Programming in Low Dimensions. - Timothy M. Chan (ACM Trans. Algorithms, 2018)

Selection and Sorting in the "Restore" Model. - Timothy M. Chan; J. Ian Munro; Venkatesh Raman 001 (ACM Trans. Algorithms, 2018)

Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. - Timothy M. Chan; Yakov Nekrich; Michiel H. M. Smid (WADS, 2019)

Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation. - Therese Biedl; Timothy M. Chan; Stephanie Lee; Saeed Mehrabi 001; Fabrizio Montecchiani; Hamideh Vosoughpour; Ziting Yu (Algorithmica, 2019)

Two Approaches to Building Time-Windowed Geometric Data Structures. - Timothy M. Chan; John Hershberger 001; Simon Pratt (Algorithmica, 2019)

Faster Approximate Diameter and Distance Oracles in Planar Graphs. - Timothy M. Chan; Dimitrios Skrepetos (Algorithmica, 2019)

Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back. - Timothy M. Chan (Discret. Comput. Geom., 2019)

Subquadratic encodings for point configurations. - Jean Cardinal; Timothy M. Chan; John Iacono; Stefan Langerman; Aurélien Ooms (J. Comput. Geom., 2019)

All-Pairs Shortest Paths in Geometric Intersection Graphs. - Timothy M. Chan; Dimitrios Skrepetos (J. Comput. Geom., 2019)

Approximate shortest paths and distance oracles in weighted unit-disk graphs. - Timothy M. Chan; Dimitrios Skrepetos (J. Comput. Geom., 2019)

Faster Approximation Algorithms for Geometric Set Cover. - Timothy M. Chan; Qizheng He (SoCG, 2020)

Further Results on Colored Range Searching. - Timothy M. Chan; Qizheng He; Yakov Nekrich (SoCG, 2020)

Improved Upper and Lower Bounds for LR Drawings of Binary Trees. - Timothy M. Chan; Zhengcheng Huang (GD, 2020)

Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions. - Josh Alman; Timothy M. Chan; R. Ryan Williams (SODA, 2020)

Dynamic Generalized Closest Pair: Revisiting Eppstein's Technique. - Timothy M. Chan (SOSA, 2020)

Reducing 3SUM to Convolution-3SUM. - Timothy M. Chan; Qizheng He (SOSA, 2020)

On the Change-Making Problem. - Timothy M. Chan; Qizheng He (SOSA, 2020)

Better Data Structures for Colored Orthogonal Range Reporting. - Timothy M. Chan; Yakov Nekrich (SODA, 2020)

Approximating text-to-pattern Hamming distances. - Timothy M. Chan; Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat (STOC, 2020)

Range closest-pair search in higher dimensions. - Timothy M. Chan; Saladi Rahul; Jie Xue 003 (Comput. Geom., 2020)

Tree Drawings Revisited. - Timothy M. Chan (Discret. Comput. Geom., 2020)

Dynamic Geometric Data Structures via Shallow Cuttings. - Timothy M. Chan (Discret. Comput. Geom., 2020)

On Locality-Sensitive Orderings and Their Applications. - Timothy M. Chan; Sariel Har-Peled; Mitchell Jones (SIAM J. Comput., 2020)

More Logarithmic-factor Speedups for 3SUM, (median, +)-convolution, and Some Geometric 3SUM-hard Problems. - Timothy M. Chan (ACM Trans. Algorithms, 2020)

All-Pairs Shortest Paths for Real-Weighted Undirected Graphs with Small Additive Error. - Timothy M. Chan (ESA, 2021)

Dynamic Colored Orthogonal Range Searching. - Timothy M. Chan; Zhengcheng Huang (ESA, 2021)

Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths. - Timothy M. Chan; Virginia Vassilevska Williams; Yinzhan Xu (ICALP, 2021)

(Near-)Linear-Time Randomized Algorithms for Row Minima in Monge Partial Matrices and Related Problems. - Timothy M. Chan (SODA, 2021)

Near-Optimal Randomized Algorithms for Selection in Totally Monotone Matrices. - Timothy M. Chan (SODA, 2021)

Simple Multi-Pass Streaming Algorithms for Skyline Points and Extreme Points. - Timothy M. Chan; Saladi Rahul (STACS, 2021)

Smallest k-Enclosing Rectangle Revisited. - Timothy M. Chan; Sariel Har-Peled (Discret. Comput. Geom., 2021)

More dynamic data structures for geometric set cover with sublinear update time. - Timothy M. Chan; Qizheng He (J. Comput. Geom., 2021)

Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky. - Timothy M. Chan; R. Ryan Williams (ACM Trans. Algorithms, 2021)

Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees. - Timothy M. Chan; Da Wei Zheng (SODA, 2022)

Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OV. - Timothy M. Chan; Virginia Vassilevska Williams; Yinzhan Xu (STOC, 2022)

Corrigendum to "Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points" [Comput. Geom. 60 (2017) 2-7]. - Timothy M. Chan; Zahed Rahmati (Comput. Geom., 2022)

Computing Shapley Values in the Plane. - Sergio Cabello; Timothy M. Chan (Discret. Comput. Geom., 2022)

More on change-making and related problems. - Timothy M. Chan; Qizheng He (J. Comput. Syst. Sci., 2022)

Orthogonal point location and rectangle stabbing queries in 3-d. - Timothy M. Chan; Yakov Nekrich; Saladi Rahul; Konstantinos Tsakalidis (J. Comput. Geom., 2022)

Optimal Algorithms for Geometric Centers and Depth. - Timothy M. Chan; Sariel Har-Peled; Mitchell Jones (SIAM J. Comput., 2022)

Minimum L_∞ Hausdorff Distance of Point Sets Under Translation: Generalizing Klee's Measure Problem. - Timothy M. Chan (SoCG, 2023)

Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller Size. - Timothy M. Chan; Zhengcheng Huang (SoCG, 2023)

Faster Algorithms for Text-to-Pattern Hamming Distances. - Timothy M. Chan; Ce Jin 001; Virginia Vassilevska Williams; Yinzhan Xu (FOCS, 2023)

On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete k-Center for Small k. - Timothy M. Chan; Qizheng He; Yuancheng Yu (ICALP, 2023)

Finding Triangles and Other Small Subgraphs in Geometric Intersection Graphs. - Timothy M. Chan (SODA, 2023)

Simplex Range Searching Revisited: How to Shave Logs in Multi-Level Data Structures. - Timothy M. Chan; Da Wei Zheng (SODA, 2023)

Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More. - Timothy M. Chan; Virginia Vassilevska Williams; Yinzhan Xu (STOC, 2023)

Minimum L∞ Hausdorff Distance of Point Sets Under Translation: Generalizing Klee's Measure Problem. - Timothy M. Chan (CoRR, 2023)

Faster Algorithms for Largest Empty Rectangles and Boxes. - Timothy M. Chan (Discret. Comput. Geom., 2023)

Semialgebraic Range Stabbing, Ray Shooting, and Intersection Counting in the Plane. - Timothy M. Chan; Pingan Cheng; Da Wei Zheng (SoCG, 2024)

Enclosing Points with Geometric Objects. - Timothy M. Chan; Qizheng He; Jie Xue 003 (SoCG, 2024)

Convex Polygon Containment: Improving Quadratic to Near Linear Time. - Timothy M. Chan; Isaac M. Hair (SoCG, 2024)

Dynamic Geometric Connectivity in the Plane with Constant Query Time. - Timothy M. Chan; Zhengcheng Huang (SoCG, 2024)

An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of Nondeterminism. - Timothy M. Chan; Pingan Cheng; Da Wei Zheng (SODA, 2024)

Simpler Reductions from Exact Triangle. - Timothy M. Chan; Yinzhan Xu (SOSA, 2024)

Fully Dynamic Geometric Vertex Cover and Matching. - Sujoy Bhore; Timothy M. Chan (CoRR, 2024)

Hopcroft's Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees. - Timothy M. Chan; Da Wei Zheng (ACM Trans. Algorithms, 2024)

Sparse Bounded Hop-Spanners for Geometric Intersection Graphs. - Sujoy Bhore; Timothy M. Chan; Zhengcheng Huang; Shakhar Smorodinsky; Csaba D. Tóth (SoCG, 2025)

A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation. - Timothy M. Chan; Isaac M. Hair (SoCG, 2025)

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-And-Bifurcate Technique. - Timothy M. Chan; Zhengcheng Huang (SoCG, 2025)

On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects. - Timothy M. Chan; Chaya Keller; Shakhar Smorodinsky (SoCG, 2025)

Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching. - Sujoy Bhore; Timothy M. Chan (SODA, 2025)

Dynamic Independent Set of Disks (and Hypercubes) Made Easier. - Sujoy Bhore; Timothy M. Chan (SOSA, 2025)

Dynamic Streaming Algorithms for Geometric Independent Set. - Timothy M. Chan; Yuancheng Yu (WADS, 2025)

Dynamic Geometric Set Cover, Revisited. - Timothy M. Chan; Qizheng He; Subhash Suri; Jie Xue 003 (SIAM J. Comput., 2025)

On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings. - Timothy M. Chan; Sariel Har-Peled (Discret. Comput. Geom., 2025)