Timothy M. Chan

356 papers A* 92A 18B 20Misc 1Journal 171Unranked 53

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher. CoRR Timothy M. Chan, Hsien-Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, Da Wei Zheng
2026	J	`jnl`	Computing the Girth of a Segment Intersection Graph. CoRR Timothy M. Chan, Yuancheng Yu
2026	A	`conf`	Delaunay Triangulations with Predictions. ITCS Sergio Cabello, Timothy M. Chan, Panos Giannopoulos
2026	J	`jnl`	Delaunay Triangulations with Predictions. CoRR Sergio Cabello, Timothy M. Chan, Panos Giannopoulos
2026	A*	`conf`	Derandomizing Pseudopolynomial Algorithms for Subset Sum. SODA Timothy M. Chan
2026	J	`jnl`	Derandomizing Pseudopolynomial Algorithms for Subset Sum. CoRR Timothy M. Chan
2026	J	`jnl`	Dynamic and Streaming Algorithms for Union Volume Estimation. CoRR Sujoy Bhore, Karl Bringmann, Timothy M. Chan, Yanheng Wang
2026	J	`jnl`	Triangulating a Polygon with Holes in Optimal (Deterministic) Time. CoRR Timothy M. Chan
2025	A*	`conf`	A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation. SoCG Timothy M. Chan, Isaac M. Hair
2025	J	`jnl`	A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation. CoRR Timothy M. Chan, Isaac M. Hair
2025	J	`jnl`	Dynamic Geometric Set Cover, Revisited. SIAM J. Comput. Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue
2025	—	`conf`	Dynamic Independent Set of Disks (and Hypercubes) Made Easier. SOSA Sujoy Bhore, Timothy M. Chan
2025	B	`conf`	Dynamic Streaming Algorithms for Geometric Independent Set. WADS Timothy M. Chan, Yuancheng Yu
2025	A*	`conf`	Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching. SODA Sujoy Bhore, Timothy M. Chan
2025	A*	`conf`	Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-And-Bifurcate Technique. SoCG Timothy M. Chan, Zhengcheng Huang
2025	J	`jnl`	Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique. CoRR Timothy M. Chan, Zhengcheng Huang
2025	A*	`conf`	On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects. SoCG Timothy M. Chan, Chaya Keller, Shakhar Smorodinsky
2025	J	`jnl`	On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings. Discret. Comput. Geom. Timothy M. Chan, Sariel Har-Peled
2025	A*	`conf`	Sparse Bounded Hop-Spanners for Geometric Intersection Graphs. SoCG Sujoy Bhore, Timothy M. Chan, Zhengcheng Huang, Shakhar Smorodinsky, Csaba D. Tóth
2025	J	`jnl`	Sparse Bounded Hop-Spanners for Geometric Intersection Graphs. CoRR Sujoy Bhore, Timothy M. Chan, Zhengcheng Huang, Shakhar Smorodinsky, Csaba D. Tóth
2025	A*	`conf`	Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension. FOCS Timothy M. Chan, Hsien-Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, Da Wei Zheng
2025	J	`jnl`	Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension. CoRR Timothy M. Chan, Hsien-Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, Da Wei Zheng
2024	A	`ed.`	32nd Annual European Symposium on Algorithms, ESA 2024, Royal Holloway, London, United Kingdom, September 2-4, 2024 ESA Timothy M. Chan, Johannes Fischer, John Iacono, Grzegorz Herman
2024	A*	`conf`	An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of Nondeterminism. SODA Timothy M. Chan, Pingan Cheng, Da Wei Zheng
2024	A*	`conf`	Convex Polygon Containment: Improving Quadratic to Near Linear Time. SoCG Timothy M. Chan, Isaac M. Hair
2024	J	`jnl`	Convex Polygon Containment: Improving Quadratic to Near Linear Time. CoRR Timothy M. Chan, Isaac M. Hair
2024	A*	`conf`	Dynamic Geometric Connectivity in the Plane with Constant Query Time. SoCG Timothy M. Chan, Zhengcheng Huang
2024	J	`jnl`	Dynamic Geometric Connectivity in the Plane with Constant Query Time. CoRR Timothy M. Chan, Zhengcheng Huang
2024	A*	`conf`	Enclosing Points with Geometric Objects. SoCG Timothy M. Chan, Qizheng He, Jie Xue
2024	J	`jnl`	Enclosing Points with Geometric Objects. CoRR Timothy M. Chan, Qizheng He, Jie Xue
2024	J	`jnl`	Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching. CoRR Sujoy Bhore, Timothy M. Chan
2024	J	`jnl`	Fully Dynamic Geometric Vertex Cover and Matching. CoRR Sujoy Bhore, Timothy M. Chan
2024	J	`jnl`	Hopcroft's Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees. ACM Trans. Algorithms Timothy M. Chan, Da Wei Zheng
2024	J	`jnl`	On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects. CoRR Timothy M. Chan, Chaya Keller, Shakhar Smorodinsky
2024	A*	`conf`	Semialgebraic Range Stabbing, Ray Shooting, and Intersection Counting in the Plane. SoCG Timothy M. Chan, Pingan Cheng, Da Wei Zheng
2024	J	`jnl`	Semialgebraic Range Stabbing, Ray Shooting, and Intersection Counting in the Plane. CoRR Timothy M. Chan, Pingan Cheng, Da Wei Zheng
2024	—	`conf`	Simpler Reductions from Exact Triangle. SOSA Timothy M. Chan, Yinzhan Xu
2023	J	`jnl`	An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of Nondeterminism. CoRR Timothy M. Chan, Pingan Cheng, Da Wei Zheng
2023	A*	`conf`	Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller Size. SoCG Timothy M. Chan, Zhengcheng Huang
2023	J	`jnl`	Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller Size. CoRR Timothy M. Chan, Zhengcheng Huang
2023	J	`jnl`	Faster Algorithms for Largest Empty Rectangles and Boxes. Discret. Comput. Geom. Timothy M. Chan
2023	A*	`conf`	Faster Algorithms for Text-to-Pattern Hamming Distances. FOCS Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu
2023	J	`jnl`	Faster Algorithms for Text-to-Pattern Hamming Distances. CoRR Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu
2023	A*	`conf`	Finding Triangles and Other Small Subgraphs in Geometric Intersection Graphs. SODA Timothy M. Chan
2023	A*	`conf`	Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More. STOC Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu
2023	J	`jnl`	Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More. CoRR Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu
2023	J	`jnl`	Minimum L CoRR Timothy M. Chan
2023	A*	`conf`	Minimum L_∞ Hausdorff Distance of Point Sets Under Translation: Generalizing Klee's Measure Problem. SoCG Timothy M. Chan
2023	A*	`conf`	On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete k-Center for Small k. ICALP Timothy M. Chan, Qizheng He, Yuancheng Yu
2023	J	`jnl`	On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete k-Center for Small k. CoRR Timothy M. Chan, Qizheng He, Yuancheng Yu
2023	A*	`conf`	On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings. SODA Timothy M. Chan, Sariel Har-Peled
2023	J	`jnl`	Simpler Reductions from Exact Triangle. CoRR Timothy M. Chan, Yinzhan Xu
2023	A*	`conf`	Simplex Range Searching Revisited: How to Shave Logs in Multi-Level Data Structures. SODA Timothy M. Chan, Da Wei Zheng
2022	—	`ed.`	5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual Conference, January 10-11, 2022 SOSA Karl Bringmann, Timothy M. Chan
2022	J	`jnl`	Computing Shapley Values in the Plane. Discret. Comput. Geom. Sergio Cabello, Timothy M. Chan
2022	J	`jnl`	Corrigendum to "Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points" [Comput. Geom. 60 (2017) 2-7]. Comput. Geom. Timothy M. Chan, Zahed Rahmati
2022	A*	`conf`	Dynamic Geometric Set Cover, Revisited. SODA Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue
2022	J	`jnl`	Finding Triangles and Other Small Subgraphs in Geometric Intersection Graphs. CoRR Timothy M. Chan
2022	J	`jnl`	Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV. CoRR Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu
2022	A*	`conf`	Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OV. STOC Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu
2022	A*	`conf`	Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees. SODA Timothy M. Chan, Da Wei Zheng
2022	J	`jnl`	More on change-making and related problems. J. Comput. Syst. Sci. Timothy M. Chan, Qizheng He
2022	J	`jnl`	Optimal Algorithms for Geometric Centers and Depth. SIAM J. Comput. Timothy M. Chan, Sariel Har-Peled, Mitchell Jones
2022	J	`jnl`	Orthogonal point location and rectangle stabbing queries in 3-d. J. Comput. Geom. Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis
2022	J	`jnl`	Simplex Range Searching Revisited: How to Shave Logs in Multi-Level Data Structures. CoRR Timothy M. Chan, Da Wei Zheng
2021	A*	`conf`	(Near-)Linear-Time Randomized Algorithms for Row Minima in Monge Partial Matrices and Related Problems. SODA Timothy M. Chan
2021	A*	`conf`	Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths. ICALP Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu
2021	J	`jnl`	Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths. CoRR Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu
2021	A	`conf`	All-Pairs Shortest Paths for Real-Weighted Undirected Graphs with Small Additive Error. ESA Timothy M. Chan
2021	J	`jnl`	Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky. ACM Trans. Algorithms Timothy M. Chan, R. Ryan Williams
2021	A	`conf`	Dynamic Colored Orthogonal Range Searching. ESA Timothy M. Chan, Zhengcheng Huang
2021	J	`jnl`	Dynamic Geometric Set Cover, Revisited. CoRR Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue
2021	A*	`conf`	Faster Algorithms for Largest Empty Rectangles and Boxes. SoCG Timothy M. Chan
2021	J	`jnl`	Faster Algorithms for Largest Empty Rectangles and Boxes. CoRR Timothy M. Chan
2021	J	`jnl`	Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees. CoRR Timothy M. Chan, Da Wei Zheng
2021	A*	`conf`	More Dynamic Data Structures for Geometric Set Cover with Sublinear Update Time. SoCG Timothy M. Chan, Qizheng He
2021	J	`jnl`	More Dynamic Data Structures for Geometric Set Cover with Sublinear Update Time. CoRR Timothy M. Chan, Qizheng He
2021	J	`jnl`	More dynamic data structures for geometric set cover with sublinear update time. J. Comput. Geom. Timothy M. Chan, Qizheng He
2021	J	`jnl`	More on Change-Making and Related Problems. CoRR Timothy M. Chan, Qizheng He
2021	A*	`conf`	Near-Optimal Randomized Algorithms for Selection in Totally Monotone Matrices. SODA Timothy M. Chan
2021	A	`conf`	Simple Multi-Pass Streaming Algorithms for Skyline Points and Extreme Points. STACS Timothy M. Chan, Saladi Rahul
2021	J	`jnl`	Smallest k-Enclosing Rectangle Revisited. Discret. Comput. Geom. Timothy M. Chan, Sariel Har-Peled
2020	J	`jnl`	Approximating Text-to-Pattern Hamming Distances. CoRR Timothy M. Chan, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat
2020	A*	`conf`	Approximating text-to-pattern Hamming distances. STOC Timothy M. Chan, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat
2020	A*	`conf`	Better Data Structures for Colored Orthogonal Range Reporting. SODA Timothy M. Chan, Yakov Nekrich
2020	—	`conf`	Dynamic Generalized Closest Pair: Revisiting Eppstein's Technique. SOSA Timothy M. Chan
2020	J	`jnl`	Dynamic Geometric Data Structures via Shallow Cuttings. Discret. Comput. Geom. Timothy M. Chan
2020	A*	`conf`	Faster Approximation Algorithms for Geometric Set Cover. SoCG Timothy M. Chan, Qizheng He
2020	J	`jnl`	Faster Approximation Algorithms for Geometric Set Cover. CoRR Timothy M. Chan, Qizheng He
2020	A*	`conf`	Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions. SODA Josh Alman, Timothy M. Chan, R. Ryan Williams
2020	A*	`conf`	Further Results on Colored Range Searching. SoCG Timothy M. Chan, Qizheng He, Yakov Nekrich
2020	J	`jnl`	Further Results on Colored Range Searching. CoRR Timothy M. Chan, Qizheng He, Yakov Nekrich
2020	A	`conf`	Improved Upper and Lower Bounds for LR Drawings of Binary Trees. GD Timothy M. Chan, Zhengcheng Huang
2020	J	`jnl`	More Logarithmic-factor Speedups for 3SUM, (median, +)-convolution, and Some Geometric 3SUM-hard Problems. ACM Trans. Algorithms Timothy M. Chan
2020	A	`conf`	More on Change-Making and Related Problems. ESA Timothy M. Chan, Qizheng He
2020	J	`jnl`	On Locality-Sensitive Orderings and Their Applications. SIAM J. Comput. Timothy M. Chan, Sariel Har-Peled, Mitchell Jones
2020	—	`conf`	On the Change-Making Problem. SOSA Timothy M. Chan, Qizheng He
2020	J	`jnl`	Range closest-pair search in higher dimensions. Comput. Geom. Timothy M. Chan, Saladi Rahul, Jie Xue
2020	—	`conf`	Reducing 3SUM to Convolution-3SUM. SOSA Timothy M. Chan, Qizheng He
2020	J	`jnl`	Tree Drawings Revisited. Discret. Comput. Geom. Timothy M. Chan
2019	J	`jnl`	All-Pairs Shortest Paths in Geometric Intersection Graphs. J. Comput. Geom. Timothy M. Chan, Dimitrios Skrepetos
2019	J	`jnl`	Approximate shortest paths and distance oracles in weighted unit-disk graphs. J. Comput. Geom. Timothy M. Chan, Dimitrios Skrepetos
2019	A*	`conf`	Computing Shapley Values in the Plane. SoCG Sergio Cabello, Timothy M. Chan
2019	A*	`conf`	Dynamic Geometric Data Structures via Shallow Cuttings. SoCG Timothy M. Chan
2019	J	`jnl`	Dynamic Geometric Data Structures via Shallow Cuttings. CoRR Timothy M. Chan
2019	J	`jnl`	Faster Approximate Diameter and Distance Oracles in Planar Graphs. Algorithmica Timothy M. Chan, Dimitrios Skrepetos
2019	J	`jnl`	Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation. Algorithmica Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour, Ziting Yu
2019	J	`jnl`	Improved Upper and Lower Bounds for LR Drawings of Binary Trees. CoRR Timothy M. Chan, Zhengcheng Huang
2019	A	`conf`	On Locality-Sensitive Orderings and Their Applications. ITCS Timothy M. Chan, Sariel Har-Peled, Mitchell Jones
2019	B	`conf`	Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. WADS Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid
2019	J	`jnl`	Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. CoRR Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid
2019	J	`jnl`	Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back. Discret. Comput. Geom. Timothy M. Chan
2019	A*	`ed.`	Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019 SODA Timothy M. Chan
2019	B	`conf`	Range Closest-Pair Search in Higher Dimensions. WADS Timothy M. Chan, Saladi Rahul, Jie Xue
2019	J	`jnl`	Range closest-pair search in higher dimensions. CoRR Timothy M. Chan, Saladi Rahul, Jie Xue
2019	A*	`conf`	Smallest k-Enclosing Rectangle Revisited. SoCG Timothy M. Chan, Sariel Har-Peled
2019	J	`jnl`	Smallest k-Enclosing Rectangle Revisited. CoRR Timothy M. Chan, Sariel Har-Peled
2019	J	`jnl`	Subquadratic encodings for point configurations. J. Comput. Geom. Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms
2019	J	`jnl`	Two Approaches to Building Time-Windowed Geometric Data Structures. Algorithmica Timothy M. Chan, John Hershberger, Simon Pratt
2018	J	`jnl`	A Clustering-Based Approach to Kinetic Closest Pair. Algorithmica Zahed Rahmati, Timothy M. Chan
2018	J	`jnl`	An improved approximation algorithm for the discrete Fréchet distance. Inf. Process. Lett. Timothy M. Chan, Zahed Rahmati
2018	J	`jnl`	Applications of Chebyshev polynomials to low-dimensional computational geometry. J. Comput. Geom. Timothy M. Chan
2018	A*	`conf`	Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk Graphs. SoCG Timothy M. Chan, Dimitrios Skrepetos
2018	—	`conf`	Approximation Schemes for 0-1 Knapsack. SOSA Timothy M. Chan
2018	J	`jnl`	Dynamic Orthogonal Range Searching on the RAM, Revisited. J. Comput. Geom. Timothy M. Chan, Konstantinos Tsakalidis
2018	A*	`conf`	Dynamic Planar Orthogonal Point Location in Sublogarithmic Time. SoCG Timothy M. Chan, Konstantinos Tsakalidis
2018	J	`jnl`	Improved Deterministic Algorithms for Linear Programming in Low Dimensions. ACM Trans. Algorithms Timothy M. Chan
2018	A*	`conf`	More Logarithmic-Factor Speedups for 3SUM, (median, +)-Convolution, and Some Geometric 3SUM-Hard Problems. SODA Timothy M. Chan
2018	J	`jnl`	On Locality-Sensitive Orderings and their Applications. CoRR Timothy M. Chan, Sariel Har-Peled, Mitchell Jones
2018	A*	`conf`	Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. ICALP Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis
2018	J	`jnl`	Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. CoRR Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis
2018	J	`jnl`	Selection and Sorting in the "Restore" Model. ACM Trans. Algorithms Timothy M. Chan, J. Ian Munro, Venkatesh Raman
2018	B	`conf`	Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. ISAAC Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff
2018	J	`jnl`	Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. CoRR Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff
2018	A*	`conf`	Subquadratic Encodings for Point Configurations. SoCG Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms
2018	J	`jnl`	Subquadratic Encodings for Point Configurations. CoRR Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms
2018	J	`jnl`	Towards an Optimal Method for Dynamic Planar Point Location. SIAM J. Comput. Timothy M. Chan, Yakov Nekrich
2018	A*	`conf`	Tree Drawings Revisited. SoCG Timothy M. Chan
2018	J	`jnl`	Tree Drawings Revisited. CoRR Timothy M. Chan
2017	B	`conf`	All-Pairs Shortest Paths in Geometric Intersection Graphs. WADS Timothy M. Chan, Dimitrios Skrepetos
2017	A*	`conf`	Applications of Chebyshev Polynomials to Low-Dimensional Computational Geometry. SoCG Timothy M. Chan
2017	J	`jnl`	Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points. Comput. Geom. Timothy M. Chan, Zahed Rahmati
2017	A*	`conf`	Dynamic Orthogonal Range Searching on the RAM, Revisited. SoCG Timothy M. Chan, Konstantinos Tsakalidis
2017	J	`jnl`	Dynamic data structures for approximate Hausdorff distance in the word RAM. Comput. Geom. Timothy M. Chan, Dimitrios Skrepetos
2017	A	`conf`	Faster Approximate Diameter and Distance Oracles in Planar Graphs. ESA Timothy M. Chan, Dimitrios Skrepetos
2017	J	`jnl`	How to Morph Planar Graph Drawings. SIAM J. Comput. 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, Bryan T. Wilkinson
2017	A	`conf`	Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges. GD Therese Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw
2017	J	`jnl`	Improved Bounds for Drawing Trees on Fixed Points with L-shaped Edges. CoRR Therese Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw
2017	J	`jnl`	Instance-Optimal Geometric Algorithms. J. ACM Peyman Afshani, Jérémy Barbay, Timothy M. Chan
2017	B	`conf`	On Guarding Orthogonal Polygons with Sliding Cameras. WALCOM Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour
2017	J	`jnl`	On the Succinct Representation of Equivalence Classes. Algorithmica Hicham El-Zein, Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Timothy M. Chan
2017	A*	`conf`	Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back. SoCG Timothy M. Chan
2017	J	`jnl`	Succinct Indices for Path Minimum, with Applications. Algorithmica Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou
2016	—	`conf`	A Clustering-Based Approach to Kinetic Closest Pair. SWAT Timothy M. Chan, Zahed Rahmati
2016	J	`jnl`	A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions. Discret. Comput. Geom. Timothy M. Chan
2016	J	`jnl`	Adaptive and Approximate Orthogonal Range Counting. ACM Trans. Algorithms Timothy M. Chan, Bryan T. Wilkinson
2016	B	`conf`	All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time. ISAAC Timothy M. Chan, Dimitrios Skrepetos
2016	A*	`conf`	Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky. SODA Timothy M. Chan, Ryan Williams
2016	A*	`conf`	Dynamic Streaming Algorithms for Epsilon-Kernels. SoCG Timothy M. Chan
2016	J	`jnl`	How to morph planar graph drawings. CoRR 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, Bryan T. Wilkinson
2016	A*	`conf`	Improved Deterministic Algorithms for Linear Programming in Low Dimensions. SODA Timothy M. Chan
2016	J	`jnl`	On Guarding Orthogonal Polygons with Sliding Cameras. CoRR Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour
2016	J	`jnl`	Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings. Discret. Comput. Geom. Timothy M. Chan, Konstantinos Tsakalidis
2016	A*	`conf`	Polynomial Representations of Threshold Functions and Algorithmic Applications. FOCS Josh Alman, Timothy M. Chan, R. Ryan Williams
2016	J	`jnl`	Polynomial Representations of Threshold Functions and Algorithmic Applications. CoRR Josh Alman, Timothy M. Chan, Ryan Williams
2016	A*	`conf`	Two Approaches to Building Time-Windowed Geometric Data Structures. SoCG Timothy M. Chan, Simon Pratt
2015	A*	`conf`	A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions. SoCG Timothy M. Chan
2015	—	`conf`	Approximating the Minimum Closest Pair Distance and Nearest Neighbor Distances of Linearly Moving Points. CCCG Timothy M. Chan, Zahed Rahmati
2015	A*	`conf`	Clustered Integer 3SUM via Additive Combinatorics. STOC Timothy M. Chan, Moshe Lewenstein
2015	J	`jnl`	Clustered Integer 3SUM via Additive Combinatorics. CoRR Timothy M. Chan, Moshe Lewenstein
2015	J	`jnl`	Drawing Partially Embedded and Simultaneously Planar Graphs. J. Graph Algorithms Appl. Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer
2015	—	`conf`	Dynamic data structures for approximate Hausdorff distance in the word RAM. CCCG Timothy M. Chan, Dimitrios Skrepetos
2015	B	`conf`	Fast String Dictionary Lookup with One Error. CPM Timothy M. Chan, Moshe Lewenstein
2015	J	`jnl`	Finding median in read-only memory on integer input. Theor. Comput. Sci. Timothy M. Chan, J. Ian Munro, Venkatesh Raman
2015	J	`jnl`	Geometric red-blue set cover for unit squares and related problems. Comput. Geom. Timothy M. Chan, Nan Hu
2015	J	`jnl`	Guest Editor's foreword. Comput. Geom. Timothy M. Chan, Rolf Klein
2015	J	`jnl`	Instance Optimal Geometric Algorithms. CoRR Peyman Afshani, Jérémy Barbay, Timothy M. Chan
2015	J	`jnl`	Linear-Space Data Structures for Range Minority Query in Arrays. Algorithmica Timothy M. Chan, Stephane Durocher, Matthew Skala, Bryan T. Wilkinson
2015	B	`conf`	Multidimensional Range Selection. ISAAC Timothy M. Chan, Gelin Zhou
2015	J	`jnl`	On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures. Discret. Comput. Geom. Timothy M. Chan, Patrick Lee
2015	A*	`conf`	Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings. SoCG Timothy M. Chan, Konstantinos Tsakalidis
2015	A*	`conf`	Speeding up the Four Russians Algorithm by About One More Logarithmic Factor. SODA Timothy M. Chan
2015	—	`conf`	Time-Windowed Closest Pair. CCCG Timothy M. Chan, Simon Pratt
2015	A*	`conf`	Towards an Optimal Method for Dynamic Planar Point Location. FOCS Timothy M. Chan, Yakov Nekrich
2014	A*	`conf`	Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels. SoCG Sunil Arya, Timothy M. Chan
2014	J	`jnl`	Closest pair and the post office problem for stochastic points. Comput. Geom. Pegah Kamousi, Timothy M. Chan, Subhash Suri
2014	—	`conf`	Cuttings in 2D Revisited. CCCG Timothy M. Chan
2014	—	`conf`	Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM. ICALP (1) Peyman Afshani, Timothy M. Chan, Konstantinos Tsakalidis
2014	A	`conf`	Drawing Partially Embedded and Simultaneously Planar Graphs. GD Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer
2014	J	`jnl`	Drawing Partially Embedded and Simultaneously Planar Graphs. CoRR Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer
2014	J	`jnl`	Exact algorithms and APX-hardness results for geometric packing and covering problems. Comput. Geom. Timothy M. Chan, Elyot Grant
2014	J	`jnl`	Guest Editors' Foreword. Discret. Comput. Geom. Timothy M. Chan, Rolf Klein
2014	J	`jnl`	Linear-Space Data Structures for Range Mode Query in Arrays. Theory Comput. Syst. Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson
2014	J	`jnl`	Maximum-weight planar boxes in O(n Inf. Process. Lett. Jérémy Barbay, Timothy M. Chan, Gonzalo Navarro, Pablo Pérez-Lantero
2014	J	`jnl`	Necklaces, Convolutions, and X+Y. Algorithmica David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian
2014	A*	`conf`	On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures. SoCG Timothy M. Chan, Patrick Lee
2014	—	`conf`	On Hardness of Jumbled Indexing. ICALP (1) Amihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein
2014	J	`jnl`	On Hardness of Jumbled Indexing. CoRR Amihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein
2014	A*	`conf`	Selection and Sorting in the "Restore" Model. SODA Timothy M. Chan, J. Ian Munro, Venkatesh Raman
2014	J	`jnl`	Streaming and dynamic algorithms for minimum enclosing balls in high dimensions. Comput. Geom. Timothy M. Chan, Vinayak Pathak
2014	A	`conf`	Succinct Indices for Path Minimum, with Applications to Path Reporting. ESA Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou
2013	A*	`conf`	Adaptive and Approximate Orthogonal Range Counting. SODA Timothy M. Chan, Bryan T. Wilkinson
2013	B	`conf`	Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers. ISAAC Timothy M. Chan, J. Ian Munro, Venkatesh Raman
2013	—	`conf`	Geometric Red-Blue Set Cover for Unit Squares and Related Problems. CCCG Timothy M. Chan, Nan Hu
2013	A*	`conf`	Klee's Measure Problem Made Easy. FOCS Timothy M. Chan
2013	—	`conf`	Maximum-Weight Planar Boxes in O(n CCCG Jérémy Barbay, Timothy M. Chan, Gonzalo Navarro, Pablo Pérez-Lantero
2013	A	`conf`	Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations. GD Timothy M. Chan, Hella-Franziska Hoffmann, Stephen Kiazyk, Anna Lubiw
2013	A*	`conf`	Morphing Planar Graph Drawings with a Polynomial Number of Steps. SODA Soroush Alamdari, Patrizio Angelini, Timothy M. Chan, Giuseppe Di Battista, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson
2013	J	`jnl`	Persistent Predecessor Search and Orthogonal Point Location on the Word RAM. ACM Trans. Algorithms Timothy M. Chan
2013	—	`conf`	Quake Heaps: A Simple Alternative to Fibonacci Heaps. Space-Efficient Data Structures, Streams, and Algorithms Timothy M. Chan
2013	J	`jnl`	Self-Approaching Graphs. CoRR Soroush Alamdari, Timothy M. Chan, Elyot Grant, Anna Lubiw, Vinayak Pathak
2013	B	`conf`	Smart-Grid Electricity Allocation via Strip Packing with Slicing. WADS Soroush Alamdari, Therese Biedl, Timothy M. Chan, Elyot Grant, Krishnam Raju Jampani, Srinivasan Keshav, Anna Lubiw, Vinayak Pathak
2013	A*	`ed.`	Symposium on Computational Geometry 2013, SoCG '13, Rio de Janeiro, Brazil, June 17-20, 2013 SoCG Guilherme Dias da Fonseca, Thomas Lewiner, Luis Mariano Peñaranda, Timothy M. Chan, Rolf Klein
2013	B	`conf`	The Art of Shaving Logs. WADS Timothy M. Chan
2012	J	`jnl`	All-pairs shortest paths for unweighted undirected graphs in ACM Trans. Algorithms Timothy M. Chan
2012	J	`jnl`	Approximation Algorithms for Maximum Independent Set of Pseudo-Disks. Discret. Comput. Geom. Timothy M. Chan, Sariel Har-Peled
2012	B	`conf`	Combinatorial Geometry and Approximation Algorithms. ISAAC Timothy M. Chan
2012	—	`conf`	Computing the Nearest Neighbor Transform Exactly with Only Double Precision. ISVD David L. Millman, Steven Love, Timothy M. Chan, Jack Snoeyink
2012	—	`conf`	Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set. SCG Timothy M. Chan
2012	—	`conf`	Linear-Space Data Structures for Range Minority Query in Arrays. SWAT Timothy M. Chan, Stephane Durocher, Matthew Skala, Bryan T. Wilkinson
2012	A	`conf`	Linear-Space Data Structures for Range Mode Query in Arrays. STACS Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson
2012	J	`jnl`	Necklaces, Convolutions, and X+Y CoRR David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian
2012	J	`jnl`	On Levels in Arrangements of Surfaces in Three Dimensions. Discret. Comput. Geom. Timothy M. Chan
2012	J	`jnl`	Optimal Partition Trees. Discret. Comput. Geom. Timothy M. Chan
2012	A	`conf`	Self-approaching Graphs. GD Soroush Alamdari, Timothy M. Chan, Elyot Grant, Anna Lubiw, Vinayak Pathak
2012	J	`jnl`	Three Problems about Dynamic Convex Hulls. Int. J. Comput. Geom. Appl. Timothy M. Chan
2012	A*	`conf`	Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. SODA Timothy M. Chan, Elyot Grant, Jochen Könemann, Malcolm Sharpe
2011	J	`jnl`	Approximation Algorithms for Maximum Independent Set of Pseudo-Disks CoRR Timothy M. Chan, Sariel Har-Peled
2011	—	`conf`	Bichromatic Line Segment Intersection Counting in O(n sqrt(log n)) Time. CCCG Timothy M. Chan, Bryan T. Wilkinson
2011	B	`conf`	Closest Pair and the Post Office Problem for Stochastic Points. WADS Pegah Kamousi, Timothy M. Chan, Subhash Suri
2011	A*	`conf`	Computational Geometry for Non-Geometers: Recent Developments on Some Classical Problems. SODA Timothy M. Chan
2011	J	`jnl`	Dynamic Connectivity: Connecting to Networks and Geometry. SIAM J. Comput. Timothy M. Chan, Mihai Patrascu, Liam Roditty
2011	—	`conf`	Exact Algorithms and APX-Hardness Results for Geometric Set Cover. CCCG Elyot Grant, Timothy M. Chan
2011	J	`jnl`	Orthogonal Range Searching on the RAM, Revisited CoRR Timothy M. Chan, Kasper Green Larsen, Mihai Patrascu
2011	—	`conf`	Orthogonal range searching on the RAM, revisited. SCG Timothy M. Chan, Kasper Green Larsen, Mihai Patrascu
2011	A*	`conf`	Persistent Predecessor Search and Orthogonal point Location on the Word RAM. SODA Timothy M. Chan
2011	—	`conf`	Stochastic minimum spanning trees in euclidean spaces. SCG Pegah Kamousi, Timothy M. Chan, Subhash Suri
2011	B	`conf`	Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions. WADS Timothy M. Chan, Vinayak Pathak
2011	—	`conf`	Three problems about dynamic convex hulls. SCG Timothy M. Chan
2010	J	`jnl`	A (slightly) faster algorithm for Klee's measure problem. Comput. Geom. Timothy M. Chan
2010	J	`jnl`	A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries. J. ACM Timothy M. Chan
2010	J	`jnl`	Comparison-based time-space lower bounds for selection. ACM Trans. Algorithms Timothy M. Chan
2010	A*	`conf`	Counting Inversions, Offline Orthogonal Range Counting, and Related Problems. SODA Timothy M. Chan, Mihai Patrascu
2010	J	`jnl`	More Algorithms for All-Pairs Shortest Paths in Weighted Graphs. SIAM J. Comput. Timothy M. Chan
2010	J	`jnl`	On the bichromatic ACM Trans. Algorithms Timothy M. Chan
2010	J	`jnl`	Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection. Comput. Geom. Timothy M. Chan, Eric Y. Chen
2010	—	`conf`	Optimal partition trees. SCG Timothy M. Chan
2010	J	`jnl`	Transdichotomous Results in Computational Geometry, II: Offline Search CoRR Timothy M. Chan, Mihai Patrascu
2009	J	`jnl`	A Randomized Algorithm for Online Unit Clustering. Theory Comput. Syst. Timothy M. Chan, Hamid Zarrabi-Zadeh
2009	J	`jnl`	An Improved Algorithm for Online Unit Clustering. Algorithmica Hamid Zarrabi-Zadeh, Timothy M. Chan
2009	—	`conf`	Approximation algorithms for maximum independent set of pseudo-disks. SCG Timothy M. Chan, Sariel Har-Peled
2009	A*	`conf`	Comparison-based time-space lower bounds for selection. SODA Timothy M. Chan
2009	J	`jnl`	Dynamic Connectivity for Axis-Parallel Rectangles. Algorithmica Peyman Afshani, Timothy M. Chan
2009	J	`jnl`	Dynamic Coresets. Discret. Comput. Geom. Timothy M. Chan
2009	J	`jnl`	Dynamic ham-sandwich cuts in the plane. Comput. Geom. Timothy G. Abbott, Michael A. Burr, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, John Hugg, Daniel Kane, Stefan Langerman, Jelani Nelson, Eynat Rafalin, Kathryn Seyboth, Vincent Yeung
2009	A*	`conf`	Instance-Optimal Geometric Algorithms. FOCS Peyman Afshani, Jérémy Barbay, Timothy M. Chan
2009	J	`jnl`	On Approximate Range Counting and Depth. Discret. Comput. Geom. Peyman Afshani, Timothy M. Chan
2009	A*	`conf`	Optimal halfspace range reporting in three dimensions. SODA Peyman Afshani, Timothy M. Chan
2009	—	`conf`	Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection. SCG Timothy M. Chan, Eric Y. Chen
2009	J	`jnl`	Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time. SIAM J. Comput. Timothy M. Chan, Mihai Patrascu
2008	—	`conf`	A (slightly) faster algorithm for klee's measure problem. SCG Timothy M. Chan
2008	J	`jnl`	All-Pairs Shortest Paths with Real Weights in Algorithmica Timothy M. Chan
2008	J	`jnl`	Dynamic Connectivity: Connecting to Networks and Geometry CoRR Timothy M. Chan, Mihai Patrascu, Liam Roditty
2008	A*	`conf`	Dynamic Connectivity: Connecting to Networks and Geometry. FOCS Timothy M. Chan, Mihai Patrascu, Liam Roditty
2008	—	`conf`	Dynamic coresets. SCG Timothy M. Chan
2008	A*	`conf`	In-place 2-d nearest neighbor search. SODA Timothy M. Chan, Eric Y. Chen
2008	—	`conf`	On levels in arrangements of curves, iii: further improvements. SCG Timothy M. Chan
2008	A*	`conf`	On the bichromatic SODA Timothy M. Chan
2008	J	`jnl`	Well-separated pair decomposition in linear time? Inf. Process. Lett. Timothy M. Chan
2007	Misc	`conf`	An Improved Algorithm for Online Unit Clustering. COCOON Hamid Zarrabi-Zadeh, Timothy M. Chan
2007	A*	`conf`	More algorithms for all-pairs shortest paths in weighted graphs. STOC Timothy M. Chan
2007	J	`jnl`	Multi-Pass Geometric Algorithms. Discret. Comput. Geom. Timothy M. Chan, Eric Y. Chen
2007	—	`conf`	On approximate range counting and depth. SCG Peyman Afshani, Timothy M. Chan
2007	A*	`conf`	Voronoi diagrams in n·2 STOC Timothy M. Chan, Mihai Patrascu
2006	B	`conf`	A Randomized Algorithm for Online Unit Clustering. WAOA Timothy M. Chan, Hamid Zarrabi-Zadeh
2006	—	`conf`	A Simple Streaming Algorithm for Minimum Enclosing Balls. CCCG Hamid Zarrabi-Zadeh, Timothy M. Chan
2006	A*	`conf`	A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries. SODA Timothy M. Chan
2006	A*	`conf`	All-pairs shortest paths for unweighted undirected graphs in SODA Timothy M. Chan
2006	A	`conf`	Dynamic Connectivity for Axis-Parallel Rectangles. ESA Peyman Afshani, Timothy M. Chan
2006	J	`jnl`	Dynamic Subgraph Connectivity with Geometric Applications. SIAM J. Comput. Timothy M. Chan
2006	J	`jnl`	Faster core-set constructions and data-stream algorithms in fixed dimensions. Comput. Geom. Timothy M. Chan
2006	J	`jnl`	Geometric Optimization Problems over Sliding Windows. Int. J. Comput. Geom. Appl. Timothy M. Chan, Bashir S. Sadjad
2006	A	`conf`	Necklaces, Convolutions, and ESA David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian
2006	A*	`conf`	Point Location in o(log n) Time, Voronoi Diagrams in o(n log n) Time, and Other Transdichotomous Results in Computational Geometry. FOCS Timothy M. Chan
2006	J	`jnl`	Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time. Comput. Geom. Hervé Brönnimann, Timothy M. Chan
2006	J	`jnl`	Three problems about simple polygons. Comput. Geom. Timothy M. Chan
2005	J	`jnl`	A note on 3D orthogonal graph drawing. Discret. Appl. Math. Therese Biedl, Timothy M. Chan
2005	B	`conf`	All-Pairs Shortest Paths with Real Weights in WADS Timothy M. Chan
2005	—	`conf`	Approximating the piercing number for unit-height rectangles. CCCG Timothy M. Chan, Abdullah-Al Mahmood
2005	—	`conf`	Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs. CCCG Peyman Afshani, Timothy M. Chan
2005	J	`jnl`	Balanced vertex-orderings of graphs. Discret. Appl. Math. Therese Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood
2005	A*	`conf`	Finding the shortest bottleneck edge in a parametric minimum spanning tree. SODA Timothy M. Chan
2005	J	`jnl`	Low-Dimensional Linear Programming with Violations. SIAM J. Comput. Timothy M. Chan
2005	—	`conf`	Multi-pass geometric algorithms. SCG Timothy M. Chan, Eric Y. Chen
2005	J	`jnl`	On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences. Discret. Comput. Geom. Timothy M. Chan
2005	A*	`conf`	On levels in arrangements of surfaces in three dimensions. SODA Timothy M. Chan
2005	—	`conf`	Space-Efficient Algorithms for Klee's Measure Problem. CCCG Eric Y. Chen, Timothy M. Chan
2004	J	`jnl`	A note on maximum independent sets in rectangle intersection graphs. Inf. Process. Lett. Timothy M. Chan
2004	A*	`conf`	An optimal randomized algorithm for maximum Tukey depth. SODA Timothy M. Chan
2004	J	`jnl`	Euclidean Bounded-Degree Spanning Tree Ratios. Discret. Comput. Geom. Timothy M. Chan
2004	—	`conf`	Faster core-set constructions and data stream algorithms in fixed dimensions. SCG Timothy M. Chan
2004	J	`jnl`	Fun-Sort--or the chaos of unordered binary search. Discret. Appl. Math. Therese Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro
2004	B	`conf`	Geometric Optimization Problems Over Sliding Windows. ISAAC Timothy M. Chan, Bashir S. Sadjad
2004	B	`conf`	Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time. LATIN Hervé Brönnimann, Timothy M. Chan
2004	—	`conf`	Towards in-place geometric algorithms and data structures. SCG Hervé Brönnimann, Timothy M. Chan, Eric Y. Chen
2003	J	`jnl`	A Fully Dynamic Algorithm for Planar Width. Discret. Comput. Geom. Timothy M. Chan
2003	—	`conf`	A Space-Efficient Algorithm for Segment Intersection. CCCG Eric Y. Chen, Timothy M. Chan
2003	—	`conf`	Curves of width one and the river shore problem. CCCG Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper
2003	J	`jnl`	Drawing K Inf. Process. Lett. Therese Biedl, Timothy M. Chan, Alejandro López-Ortiz
2003	—	`conf`	Euclidean bounded-degree spanning tree ratios. SCG Timothy M. Chan
2003	A*	`conf`	On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences. FOCS Timothy M. Chan
2003	J	`jnl`	On Levels in Arrangements of Curves. Discret. Comput. Geom. Timothy M. Chan
2003	J	`jnl`	Polynomial-time approximation schemes for packing and piercing fat objects. J. Algorithms Timothy M. Chan
2003	J	`jnl`	Semi-Online Maintenance of Geometric Optima and Measures. SIAM J. Comput. Timothy M. Chan
2003	—	`conf`	the asteroid surveying problem and other puzzles. SCG Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper
2002	J	`jnl`	A Near-Linear Area Bound for Drawing Binary Trees. Algorithmica Timothy M. Chan
2002	J	`jnl`	Approximating the Diameter, Width, Smallest Enclosing Cylinder, and Minimum-Width Annulus. Int. J. Comput. Geom. Appl. Timothy M. Chan
2002	J	`jnl`	Balanced Discret. Math. Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang
2002	A*	`conf`	Closest-point problems simplified on the RAM. SODA Timothy M. Chan
2002	—	`conf`	Drawing CCCG Therese Biedl, Timothy M. Chan, Alejandro López-Ortiz
2002	A*	`conf`	Dynamic subgraph connectivity with geometric applications. STOC Timothy M. Chan
2002	A*	`conf`	Low-Dimensional Linear Programming with Violations. FOCS Timothy M. Chan
2002	J	`jnl`	Optimizing area and aspect ration in straight-line orthogonal tree drawings. Comput. Geom. Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia
2002	A*	`conf`	Semi-online maintenance of geometric optima and measures. SODA Timothy M. Chan
2002	—	`conf`	Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. CCCG Therese Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang
2001	—	`conf`	A fully dynamic algorithm for planar. SCG Timothy M. Chan
2001	J	`jnl`	Dynamic planar convex hull operations in near-logarithmaic amortized time. J. ACM Timothy M. Chan
2001	J	`jnl`	Fly Cheaply: On the Minimum Fuel Consumption Problem. J. Algorithms Timothy M. Chan, Alon Efrat
2001	J	`jnl`	On Enumerating and Selecting Distances. Int. J. Comput. Geom. Appl. Timothy M. Chan
2000	—	`conf`	Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus. SCG Timothy M. Chan
2000	B	`conf`	Balanced MFCS Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang
2000	A*	`conf`	On Levels in Arrangements of Curves. FOCS Timothy M. Chan
2000	J	`jnl`	Random Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three Dimensions. SIAM J. Comput. Timothy M. Chan
2000	J	`jnl`	Reporting curve segment intersections using restricted predicates. Comput. Geom. Timothy M. Chan
1999	A*	`conf`	A Near-Linear Area Bound for Drawing Binary Trees. SODA Timothy M. Chan
1999	A*	`conf`	Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time. FOCS Timothy M. Chan
1999	J	`jnl`	Geometric Applications of a Randomized Optimization Technique. Discret. Comput. Geom. Timothy M. Chan
1999	J	`jnl`	More planar two-center algorithms. Comput. Geom. Timothy M. Chan
1998	J	`jnl`	Approximate Nearest Neighbor Queries Revisited. Discret. Comput. Geom. Timothy M. Chan
1998	J	`jnl`	Backwards Analysis of the Karger-Klein-Tarjan Algorithm for Minimum Spanning Trees. Inf. Process. Lett. Timothy M. Chan
1998	J	`jnl`	Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming. J. Algorithms Timothy M. Chan
1998	—	`conf`	Geometric Applications of a Randomized Optimization Technique. SCG Timothy M. Chan
1998	—	`conf`	On Enumerating and Selecting Distances. SCG Timothy M. Chan
1998	J	`jnl`	On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. Discret. Comput. Geom. Pankaj K. Agarwal, Boris Aronov, Timothy M. Chan, Micha Sharir
1998	A*	`conf`	Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three Dimensions. FOCS Timothy M. Chan
1997	—	`conf`	Approximate Nearest Neighbor Queries Revisited. SCG Timothy M. Chan
1997	A*	`conf`	Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming. SODA Timothy M. Chan
1997	J	`jnl`	Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams. Discret. Comput. Geom. Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap
1996	—	`conf`	Fixed-Dimensional Linear Programming Queries Made Easy. SCG Timothy M. Chan
1996	J	`jnl`	Optimal Output-Sensitive Convex Hull Algorithms in Two and Three Dimensions. Discret. Comput. Geom. Timothy M. Chan
1996	A	`conf`	Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. GD Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia
1996	J	`jnl`	Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems. Discret. Comput. Geom. Timothy M. Chan
1995	A*	`conf`	Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. SODA Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap
1995	—	`conf`	Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems. SCG Timothy M. Chan
1995	—	`conf`	The complexity of a single face of a minkowski sum. CCCG Sariel Har-Peled, Timothy M. Chan, Boris Aronov, Dan Halperin, Jack Snoeyink
1994	—	`conf`	A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections. CCCG Timothy M. Chan