| 2026 | ICALP | Charting the Landscape of Diameter Computation on Geometric Intersection Graphs in the Plane. | Timothy M. Chan, Hsien-Chih Chang, Jie Gao, Sndor Kisfaludi-Bak, Hung Le, Da Wei Zheng |
| 2026 | SODA | Derandomizing Pseudopolynomial Algorithms for Subset Sum. | Timothy M. Chan |
| 2025 | FOCS | Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension. | Timothy M. Chan, Hsien-Chih Chang, Jie Gao, Sndor Kisfaludi-Bak, Hung Le, Da Wei Zheng |
| 2025 | SODA | Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching. | Sujoy Bhore, Timothy M. Chan |
| 2025 | WADS | Dynamic Streaming Algorithms for Geometric Independent Set. | Timothy M. Chan, Yuancheng Yu |
| 2024 | SODA | An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of Nondeterminism. | Timothy M. Chan, Pingan Cheng, Da Wei Zheng |
| 2023 | FOCS | Faster Algorithms for Text-to-Pattern Hamming Distances. | Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu |
| 2023 | ICALP | 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 |
| 2023 | SODA | Finding Triangles and Other Small Subgraphs in Geometric Intersection Graphs. | Timothy M. Chan |
| 2023 | SODA | On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings. | Timothy M. Chan, Sariel Har-Peled |
| 2023 | SODA | Simplex Range Searching Revisited: How to Shave Logs in Multi-Level Data Structures. | Timothy M. Chan, Da Wei Zheng |
| 2023 | STOC | Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More. | Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu |
| 2022 | SODA | Dynamic Geometric Set Cover, Revisited. | Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue |
| 2022 | SODA | Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees. | Timothy M. Chan, Da Wei Zheng |
| 2022 | STOC | 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 |
| 2021 | ESA | All-Pairs Shortest Paths for Real-Weighted Undirected Graphs with Small Additive Error. | Timothy M. Chan |
| 2021 | ESA | Dynamic Colored Orthogonal Range Searching. | Timothy M. Chan, Zhengcheng Huang |
| 2021 | ICALP | Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths. | Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu |
| 2021 | SODA | (Near-)Linear-Time Randomized Algorithms for Row Minima in Monge Partial Matrices and Related Problems. | Timothy M. Chan |
| 2021 | SODA | Near-Optimal Randomized Algorithms for Selection in Totally Monotone Matrices. | Timothy M. Chan |
| 2021 | STACS | Simple Multi-Pass Streaming Algorithms for Skyline Points and Extreme Points. | Timothy M. Chan, Saladi Rahul |
| 2020 | ESA | More on Change-Making and Related Problems. | Timothy M. Chan, Qizheng He |
| 2020 | GD | Improved Upper and Lower Bounds for LR Drawings of Binary Trees. | Timothy M. Chan, Zhengcheng Huang |
| 2020 | SODA | Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions. | Josh Alman, Timothy M. Chan, R. Ryan Williams |
| 2020 | SODA | Dynamic Generalized Closest Pair: Revisiting Eppstein's Technique. | Timothy M. Chan |
| 2020 | SODA | Reducing 3SUM to Convolution-3SUM. | Timothy M. Chan, Qizheng He |
| 2020 | SODA | On the Change-Making Problem. | Timothy M. Chan, Qizheng He |
| 2020 | SODA | Better Data Structures for Colored Orthogonal Range Reporting. | Timothy M. Chan, Yakov Nekrich |
| 2020 | STOC | Approximating text-to-pattern Hamming distances. | Timothy M. Chan, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat |
| 2019 | WADS | Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. | Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid |
| 2019 | WADS | Range Closest-Pair Search in Higher Dimensions. | Timothy M. Chan, Saladi Rahul, Jie Xue |
| 2018 | ICALP | Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. | Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis |
| 2018 | ISAAC | Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. | Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff |
| 2018 | SODA | More Logarithmic-Factor Speedups for 3SUM, (median, +)-Convolution, and Some Geometric 3SUM-Hard Problems. | Timothy M. Chan |
| 2018 | SODA | Approximation Schemes for 0-1 Knapsack. | Timothy M. Chan |
| 2017 | ESA | Faster Approximate Diameter and Distance Oracles in Planar Graphs. | Timothy M. Chan, Dimitrios Skrepetos |
| 2017 | GD | Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges. | Therese Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw |
| 2017 | WADS | All-Pairs Shortest Paths in Geometric Intersection Graphs. | Timothy M. Chan, Dimitrios Skrepetos |
| 2017 | WALCOM | On Guarding Orthogonal Polygons with Sliding Cameras. | Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour |
| 2016 | FOCS | Polynomial Representations of Threshold Functions and Algorithmic Applications. | Josh Alman, Timothy M. Chan, R. Ryan Williams |
| 2016 | ISAAC | All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time. | Timothy M. Chan, Dimitrios Skrepetos |
| 2016 | SODA | Improved Deterministic Algorithms for Linear Programming in Low Dimensions. | Timothy M. Chan |
| 2016 | SODA | Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky. | Timothy M. Chan, Ryan Williams |
| 2015 | CPM | Fast String Dictionary Lookup with One Error. | Timothy M. Chan, Moshe Lewenstein |
| 2015 | FOCS | Towards an Optimal Method for Dynamic Planar Point Location. | Timothy M. Chan, Yakov Nekrich |
| 2015 | ISAAC | Multidimensional Range Selection. | Timothy M. Chan, Gelin Zhou |
| 2015 | SODA | Speeding up the Four Russians Algorithm by About One More Logarithmic Factor. | Timothy M. Chan |
| 2015 | STOC | Clustered Integer 3SUM via Additive Combinatorics. | Timothy M. Chan, Moshe Lewenstein |
| 2014 | ESA | Succinct Indices for Path Minimum, with Applications to Path Reporting. | Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou |
| 2014 | GD | Drawing Partially Embedded and Simultaneously Planar Graphs. | Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer |
| 2014 | ICALP | Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM. | Peyman Afshani, Timothy M. Chan, Konstantinos Tsakalidis |
| 2014 | ICALP | On Hardness of Jumbled Indexing. | Amihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein |
| 2014 | SODA | Selection and Sorting in the "Restore" Model. | Timothy M. Chan, J. Ian Munro, Venkatesh Raman |
| 2013 | FOCS | Klee's Measure Problem Made Easy. | Timothy M. Chan |
| 2013 | GD | Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations. | Timothy M. Chan, Hella-Franziska Hoffmann, Stephen Kiazyk, Anna Lubiw |
| 2013 | ISAAC | Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers. | Timothy M. Chan, J. Ian Munro, Venkatesh Raman |
| 2013 | SODA | 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, Bryan T. Wilkinson |
| 2013 | SODA | Adaptive and Approximate Orthogonal Range Counting. | Timothy M. Chan, Bryan T. Wilkinson |
| 2013 | WADS | 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 |
| 2013 | WADS | The Art of Shaving Logs. | Timothy M. Chan |
| 2012 | GD | Self-approaching Graphs. | Soroush Alamdari, Timothy M. Chan, Elyot Grant, Anna Lubiw, Vinayak Pathak |
| 2012 | ISAAC | Combinatorial Geometry and Approximation Algorithms. | Timothy M. Chan |
| 2012 | SODA | Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. | Timothy M. Chan, Elyot Grant, Jochen Knemann, Malcolm Sharpe |
| 2012 | STACS | Linear-Space Data Structures for Range Mode Query in Arrays. | Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson |
| 2011 | SODA | Persistent Predecessor Search and Orthogonal point Location on the Word RAM. | Timothy M. Chan |
| 2011 | SODA | Computational Geometry for Non-Geometers: Recent Developments on Some Classical Problems. | Timothy M. Chan |
| 2011 | WADS | Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions. | Timothy M. Chan, Vinayak Pathak |
| 2011 | WADS | Closest Pair and the Post Office Problem for Stochastic Points. | Pegah Kamousi, Timothy M. Chan, Subhash Suri |
| 2010 | SODA | Counting Inversions, Offline Orthogonal Range Counting, and Related Problems. | Timothy M. Chan, Mihai Patrascu |
| 2009 | FOCS | Instance-Optimal Geometric Algorithms. | Peyman Afshani, Jrmy Barbay, Timothy M. Chan |
| 2009 | SODA | Optimal halfspace range reporting in three dimensions. | Peyman Afshani, Timothy M. Chan |
| 2009 | SODA | Comparison-based time-space lower bounds for selection. | Timothy M. Chan |
| 2008 | FOCS | Dynamic Connectivity: Connecting to Networks and Geometry. | Timothy M. Chan, Mihai Patrascu, Liam Roditty |
| 2008 | SODA | On the bichromatic | Timothy M. Chan |
| 2008 | SODA | In-place 2-d nearest neighbor search. | Timothy M. Chan, Eric Y. Chen |
| 2007 | COCOON | An Improved Algorithm for Online Unit Clustering. | Hamid Zarrabi-Zadeh, Timothy M. Chan |
| 2007 | STOC | More algorithms for all-pairs shortest paths in weighted graphs. | Timothy M. Chan |
| 2007 | STOC | Voronoi diagrams in n·2 | Timothy M. Chan, Mihai Patrascu |
| 2006 | ESA | Dynamic Connectivity for Axis-Parallel Rectangles. | Peyman Afshani, Timothy M. Chan |
| 2006 | ESA | Necklaces, Convolutions, and | David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian |
| 2006 | FOCS | 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 |
| 2006 | SODA | All-pairs shortest paths for unweighted undirected graphs in | Timothy M. Chan |
| 2006 | SODA | A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries. | Timothy M. Chan |
| 2006 | WAOA | A Randomized Algorithm for Online Unit Clustering. | Timothy M. Chan, Hamid Zarrabi-Zadeh |
| 2005 | SODA | On levels in arrangements of surfaces in three dimensions. | Timothy M. Chan |
| 2005 | SODA | Finding the shortest bottleneck edge in a parametric minimum spanning tree. | Timothy M. Chan |
| 2005 | WADS | All-Pairs Shortest Paths with Real Weights in | Timothy M. Chan |
| 2004 | ISAAC | Geometric Optimization Problems Over Sliding Windows. | Timothy M. Chan, Bashir S. Sadjad |
| 2004 | LATIN | Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time. | Herv Brnnimann, Timothy M. Chan |
| 2004 | SODA | An optimal randomized algorithm for maximum Tukey depth. | Timothy M. Chan |
| 2003 | FOCS | On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences. | Timothy M. Chan |
| 2002 | FOCS | Low-Dimensional Linear Programming with Violations. | Timothy M. Chan |
| 2002 | SODA | Closest-point problems simplified on the RAM. | Timothy M. Chan |
| 2002 | SODA | Semi-online maintenance of geometric optima and measures. | Timothy M. Chan |
| 2002 | STOC | Dynamic subgraph connectivity with geometric applications. | Timothy M. Chan |
| 2000 | FOCS | On Levels in Arrangements of Curves. | Timothy M. Chan |
| 2000 | MFCS | Balanced | Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang |
| 1999 | FOCS | Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time. | Timothy M. Chan |
| 1999 | SODA | A Near-Linear Area Bound for Drawing Binary Trees. | Timothy M. Chan |
| 1998 | FOCS | Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three Dimensions. | Timothy M. Chan |
| 1997 | SODA | Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming. | Timothy M. Chan |
| 1996 | GD | Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. | Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia |
| 1995 | SODA | Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. | Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap |