default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimothy M. Chan
Person information
- affiliation: University of Illinois, Urbana, IL, USA
- affiliation (former): University of Waterloo, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j110]Timothy M. Chan, Sariel Har-Peled
:
On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings. Discret. Comput. Geom. 73(2): 466-489 (2025)- [c173]Sujoy Bhore, Timothy M. Chan:
Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching. SODA 2025: 2357-2386 - [c172]Sujoy Bhore, Timothy M. Chan:
Dynamic Independent Set of Disks (and Hypercubes) Made Easier. SOSA 2025: 485-495 - 2024
- [j109]Timothy M. Chan, Da Wei Zheng:
Hopcroft's Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees. ACM Trans. Algorithms 20(3): 24 (2024) - [c171]Timothy M. Chan, Pingan Cheng, Da Wei Zheng:
Semialgebraic Range Stabbing, Ray Shooting, and Intersection Counting in the Plane. SoCG 2024: 33:1-33:15 - [c170]Timothy M. Chan, Isaac M. Hair:
Convex Polygon Containment: Improving Quadratic to Near Linear Time. SoCG 2024: 34:1-34:15 - [c169]Timothy M. Chan, Qizheng He, Jie Xue:
Enclosing Points with Geometric Objects. SoCG 2024: 35:1-35:15 - [c168]Timothy M. Chan, Zhengcheng Huang:
Dynamic Geometric Connectivity in the Plane with Constant Query Time. SoCG 2024: 36:1-36:13 - [c167]Timothy M. Chan, Pingan Cheng, Da Wei Zheng:
An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of Nondeterminism. SODA 2024: 4451-4463 - [c166]Timothy M. Chan, Yinzhan Xu:
Simpler Reductions from Exact Triangle. SOSA 2024: 28-38 - [e4]Timothy M. Chan, Johannes Fischer, John Iacono, Grzegorz Herman:
32nd Annual European Symposium on Algorithms, ESA 2024, September 2-4, 2024, Royal Holloway, London, United Kingdom. LIPIcs 308, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-338-6 [contents] - [i50]Timothy M. Chan, Zhengcheng Huang:
Dynamic Geometric Connectivity in the Plane with Constant Query Time. CoRR abs/2402.05357 (2024) - [i49]Sujoy Bhore, Timothy M. Chan:
Fully Dynamic Geometric Vertex Cover and Matching. CoRR abs/2402.07441 (2024) - [i48]Timothy M. Chan, Qizheng He, Jie Xue:
Enclosing Points with Geometric Objects. CoRR abs/2402.17322 (2024) - [i47]Timothy M. Chan, Pingan Cheng, Da Wei Zheng:
Semialgebraic Range Stabbing, Ray Shooting, and Intersection Counting in the Plane. CoRR abs/2403.12303 (2024) - [i46]Timothy M. Chan, Isaac M. Hair:
Convex Polygon Containment: Improving Quadratic to Near Linear Time. CoRR abs/2403.13292 (2024) - [i45]Sujoy Bhore, Timothy M. Chan:
Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching. CoRR abs/2407.20659 (2024) - [i44]Timothy M. Chan, Chaya Keller, Shakhar Smorodinsky:
On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects. CoRR abs/2412.06490 (2024) - 2023
- [j108]Timothy M. Chan:
Faster Algorithms for Largest Empty Rectangles and Boxes. Discret. Comput. Geom. 70(2): 355-375 (2023) - [c165]Timothy M. Chan, Zhengcheng Huang:
Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller Size. SoCG 2023: 23:1-23:16 - [c164]Timothy M. Chan:
Minimum L_∞ Hausdorff Distance of Point Sets Under Translation: Generalizing Klee's Measure Problem. SoCG 2023: 24:1-24:13 - [c163]Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu:
Faster Algorithms for Text-to-Pattern Hamming Distances. FOCS 2023: 2188-2203 - [c162]Timothy M. Chan, Qizheng He, Yuancheng Yu:
On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete k-Center for Small k. ICALP 2023: 34:1-34:19 - [c161]Timothy M. Chan, Sariel Har-Peled:
On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings. SODA 2023: 1398-1413 - [c160]Timothy M. Chan, Da Wei Zheng:
Simplex Range Searching Revisited: How to Shave Logs in Multi-Level Data Structures. SODA 2023: 1493-1511 - [c159]Timothy M. Chan:
Finding Triangles and Other Small Subgraphs in Geometric Intersection Graphs. SODA 2023: 1777-1805 - [c158]Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu:
Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More. STOC 2023: 419-432 - [i43]Timothy M. Chan:
Minimum L∞ Hausdorff Distance of Point Sets Under Translation: Generalizing Klee's Measure Problem. CoRR abs/2303.09122 (2023) - [i42]Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu:
Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More. CoRR abs/2303.14572 (2023) - [i41]Timothy M. Chan, Zhengcheng Huang:
Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller Size. CoRR abs/2303.16303 (2023) - [i40]Timothy M. Chan, Qizheng He, Yuancheng Yu:
On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete k-Center for Small k. CoRR abs/2305.01892 (2023) - [i39]Timothy M. Chan, Yinzhan Xu:
Simpler Reductions from Exact Triangle. CoRR abs/2310.11575 (2023) - [i38]Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu:
Faster Algorithms for Text-to-Pattern Hamming Distances. CoRR abs/2310.13174 (2023) - [i37]Timothy M. Chan, Pingan Cheng, Da Wei Zheng:
An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of Nondeterminism. CoRR abs/2310.15363 (2023) - 2022
- [j107]Timothy M. Chan, Zahed Rahmati:
Corrigendum to "Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points" [Comput. Geom. 60 (2017) 2-7]. Comput. Geom. 101: 101831 (2022) - [j106]Sergio Cabello, Timothy M. Chan:
Computing Shapley Values in the Plane. Discret. Comput. Geom. 67(3): 843-881 (2022) - [j105]Timothy M. Chan, Qizheng He:
More on change-making and related problems. J. Comput. Syst. Sci. 124: 159-169 (2022) - [j104]Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis:
Orthogonal point location and rectangle stabbing queries in 3-d. J. Comput. Geom. 13(1): 399-428 (2022) - [j103]Timothy M. Chan, Sariel Har-Peled, Mitchell Jones:
Optimal Algorithms for Geometric Centers and Depth. SIAM J. Comput. 51(3): 627-663 (2022) - [c157]Timothy M. Chan, Da Wei Zheng:
Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees. SODA 2022: 190-210 - [c156]Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue:
Dynamic Geometric Set Cover, Revisited. SODA 2022: 3496-3528 - [c155]Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu:
Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OV. STOC 2022: 1501-1514 - [e3]Karl Bringmann, Timothy M. Chan:
5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual Conference, January 10-11, 2022. SIAM 2022, ISBN 978-1-61197-706-6 [contents] - [i36]Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu:
Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV. CoRR abs/2203.08356 (2022) - [i35]Timothy M. Chan, Da Wei Zheng:
Simplex Range Searching Revisited: How to Shave Logs in Multi-Level Data Structures. CoRR abs/2210.10172 (2022) - [i34]Timothy M. Chan:
Finding Triangles and Other Small Subgraphs in Geometric Intersection Graphs. CoRR abs/2211.05345 (2022) - 2021
- [j102]Timothy M. Chan, Sariel Har-Peled:
Smallest k-Enclosing Rectangle Revisited. Discret. Comput. Geom. 66(2): 769-791 (2021) - [j101]Timothy M. Chan, Qizheng He:
More dynamic data structures for geometric set cover with sublinear update time. J. Comput. Geom. 13(2): 90-114 (2021) - [j100]Timothy M. Chan, R. Ryan Williams:
Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky. ACM Trans. Algorithms 17(1): 2:1-2:14 (2021) - [c154]Timothy M. Chan:
Faster Algorithms for Largest Empty Rectangles and Boxes. SoCG 2021: 24:1-24:15 - [c153]Timothy M. Chan, Qizheng He:
More Dynamic Data Structures for Geometric Set Cover with Sublinear Update Time. SoCG 2021: 25:1-25:14 - [c152]Timothy M. Chan:
All-Pairs Shortest Paths for Real-Weighted Undirected Graphs with Small Additive Error. ESA 2021: 27:1-27:9 - [c151]Timothy M. Chan, Zhengcheng Huang:
Dynamic Colored Orthogonal Range Searching. ESA 2021: 28:1-28:13 - [c150]Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu:
Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths. ICALP 2021: 47:1-47:21 - [c149]Timothy M. Chan:
(Near-)Linear-Time Randomized Algorithms for Row Minima in Monge Partial Matrices and Related Problems. SODA 2021: 1465-1482 - [c148]Timothy M. Chan:
Near-Optimal Randomized Algorithms for Selection in Totally Monotone Matrices. SODA 2021: 1483-1495 - [c147]Timothy M. Chan, Saladi Rahul:
Simple Multi-Pass Streaming Algorithms for Skyline Points and Extreme Points. STACS 2021: 22:1-22:14 - [i33]Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu:
Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths. CoRR abs/2102.06181 (2021) - [i32]Timothy M. Chan, Qizheng He:
More Dynamic Data Structures for Geometric Set Cover with Sublinear Update Time. CoRR abs/2103.07857 (2021) - [i31]Timothy M. Chan:
Faster Algorithms for Largest Empty Rectangles and Boxes. CoRR abs/2103.08043 (2021) - [i30]Timothy M. Chan, Qizheng He:
More on Change-Making and Related Problems. CoRR abs/2110.02503 (2021) - [i29]Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue:
Dynamic Geometric Set Cover, Revisited. CoRR abs/2111.01196 (2021) - [i28]Timothy M. Chan, Da Wei Zheng:
Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees. CoRR abs/2111.03744 (2021) - 2020
- [j99]Timothy M. Chan, Saladi Rahul, Jie Xue:
Range closest-pair search in higher dimensions. Comput. Geom. 91: 101669 (2020) - [j98]Timothy M. Chan:
Tree Drawings Revisited. Discret. Comput. Geom. 63(4): 799-820 (2020) - [j97]Timothy M. Chan:
Dynamic Geometric Data Structures via Shallow Cuttings. Discret. Comput. Geom. 64(4): 1235-1252 (2020) - [j96]Timothy M. Chan, Sariel Har-Peled, Mitchell Jones:
On Locality-Sensitive Orderings and Their Applications. SIAM J. Comput. 49(3): 583-600 (2020) - [j95]Timothy M. Chan:
More Logarithmic-factor Speedups for 3SUM, (median, +)-convolution, and Some Geometric 3SUM-hard Problems. ACM Trans. Algorithms 16(1): 7:1-7:23 (2020) - [c146]Timothy M. Chan, Qizheng He:
Faster Approximation Algorithms for Geometric Set Cover. SoCG 2020: 27:1-27:14 - [c145]Timothy M. Chan, Qizheng He, Yakov Nekrich:
Further Results on Colored Range Searching. SoCG 2020: 28:1-28:15 - [c144]Timothy M. Chan, Qizheng He:
More on Change-Making and Related Problems. ESA 2020: 29:1-29:14 - [c143]Timothy M. Chan, Zhengcheng Huang:
Improved Upper and Lower Bounds for LR Drawings of Binary Trees. GD 2020: 71-84 - [c142]Timothy M. Chan, Qizheng He:
Reducing 3SUM to Convolution-3SUM. SOSA 2020: 1-7 - [c141]Timothy M. Chan:
Dynamic Generalized Closest Pair: Revisiting Eppstein's Technique. SOSA 2020: 33-37 - [c140]Timothy M. Chan, Qizheng He:
On the Change-Making Problem. SOSA 2020: 38-42 - [c139]Timothy M. Chan, Yakov Nekrich:
Better Data Structures for Colored Orthogonal Range Reporting. SODA 2020: 627-636 - [c138]Josh Alman, Timothy M. Chan, R. Ryan Williams:
Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions. SODA 2020: 637-649 - [c137]Timothy M. Chan, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat:
Approximating text-to-pattern Hamming distances. STOC 2020: 643-656 - [i27]Timothy M. Chan, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat:
Approximating Text-to-Pattern Hamming Distances. CoRR abs/2001.00211 (2020) - [i26]Timothy M. Chan, Qizheng He, Yakov Nekrich:
Further Results on Colored Range Searching. CoRR abs/2003.11604 (2020) - [i25]Timothy M. Chan, Qizheng He:
Faster Approximation Algorithms for Geometric Set Cover. CoRR abs/2003.13420 (2020)
2010 – 2019
- 2019
- [j94]Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour, Ziting Yu:
Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation. Algorithmica 81(1): 69-97 (2019) - [j93]Timothy M. Chan, Dimitrios Skrepetos:
Faster Approximate Diameter and Distance Oracles in Planar Graphs. Algorithmica 81(8): 3075-3098 (2019) - [j92]Timothy M. Chan, John Hershberger, Simon Pratt:
Two Approaches to Building Time-Windowed Geometric Data Structures. Algorithmica 81(9): 3519-3533 (2019) - [j91]Timothy M. Chan:
Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back. Discret. Comput. Geom. 61(4): 899-922 (2019) - [j90]Timothy M. Chan, Dimitrios Skrepetos:
All-Pairs Shortest Paths in Geometric Intersection Graphs. J. Comput. Geom. 10(1): 27-41 (2019) - [j89]Timothy M. Chan, Dimitrios Skrepetos:
Approximate shortest paths and distance oracles in weighted unit-disk graphs. J. Comput. Geom. 10(2): 3-20 (2019) - [j88]Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms:
Subquadratic encodings for point configurations. J. Comput. Geom. 10(2): 99-126 (2019) - [c136]Sergio Cabello, Timothy M. Chan:
Computing Shapley Values in the Plane. SoCG 2019: 20:1-20:19 - [c135]Timothy M. Chan, Sariel Har-Peled:
Smallest k-Enclosing Rectangle Revisited. SoCG 2019: 23:1-23:15 - [c134]Timothy M. Chan:
Dynamic Geometric Data Structures via Shallow Cuttings. SoCG 2019: 24:1-24:13 - [c133]Timothy M. Chan, Sariel Har-Peled, Mitchell Jones:
On Locality-Sensitive Orderings and Their Applications. ITCS 2019: 21:1-21:17 - [c132]Timothy M. Chan, Saladi Rahul, Jie Xue:
Range Closest-Pair Search in Higher Dimensions. WADS 2019: 269-282 - [c131]Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid:
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. WADS 2019: 283-295 - [e2]Timothy M. Chan:
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019. SIAM 2019, ISBN 978-1-61197-548-2 [contents] - [i24]Timothy M. Chan, Sariel Har-Peled:
Smallest k-Enclosing Rectangle Revisited. CoRR abs/1903.06785 (2019) - [i23]Timothy M. Chan:
Dynamic Geometric Data Structures via Shallow Cuttings. CoRR abs/1903.08387 (2019) - [i22]Timothy M. Chan, Saladi Rahul, Jie Xue:
Range closest-pair search in higher dimensions. CoRR abs/1905.01029 (2019) - [i21]Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid:
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. CoRR abs/1905.02322 (2019) - [i20]Timothy M. Chan, Zhengcheng Huang:
Improved Upper and Lower Bounds for LR Drawings of Binary Trees. CoRR abs/1912.10148 (2019) - 2018
- [j87]Zahed Rahmati, Timothy M. Chan:
A Clustering-Based Approach to Kinetic Closest Pair. Algorithmica 80(10): 2742-2756 (2018) - [j86]Timothy M. Chan, Zahed Rahmati:
An improved approximation algorithm for the discrete Fréchet distance. Inf. Process. Lett. 138: 72-74 (2018) - [j85]Timothy M. Chan:
Applications of Chebyshev polynomials to low-dimensional computational geometry. J. Comput. Geom. 9(2): 3-20 (2018) - [j84]Timothy M. Chan, Konstantinos Tsakalidis:
Dynamic Orthogonal Range Searching on the RAM, Revisited. J. Comput. Geom. 9(2): 45-66 (2018) - [j83]Timothy M. Chan, Yakov Nekrich:
Towards an Optimal Method for Dynamic Planar Point Location. SIAM J. Comput. 47(6): 2337-2361 (2018) - [j82]Timothy M. Chan, J. Ian Munro, Venkatesh Raman:
Selection and Sorting in the "Restore" Model. ACM Trans. Algorithms 14(2): 11:1-11:18 (2018) - [j81]Timothy M. Chan:
Improved Deterministic Algorithms for Linear Programming in Low Dimensions. ACM Trans. Algorithms 14(3): 30:1-30:10 (2018) - [c130]Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms:
Subquadratic Encodings for Point Configurations. SoCG 2018: 20:1-20:14 - [c129]Timothy M. Chan:
Tree Drawings Revisited. SoCG 2018: 23:1-23:15 - [c128]Timothy M. Chan, Dimitrios Skrepetos:
Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk Graphs. SoCG 2018: 24:1-24:13 - [c127]Timothy M. Chan, Konstantinos Tsakalidis:
Dynamic Planar Orthogonal Point Location in Sublogarithmic Time. SoCG 2018: 25:1-25:15 - [c126]Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis:
Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. ICALP 2018: 31:1-31:14 - [c125]Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff:
Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. ISAAC 2018: 61:1-61:13 - [c124]Timothy M. Chan:
Approximation Schemes for 0-1 Knapsack. SOSA 2018: 5:1-5:12 - [c123]Timothy M. Chan:
More Logarithmic-Factor Speedups for 3SUM, (median, +)-Convolution, and Some Geometric 3SUM-Hard Problems. SODA 2018: 881-897 - [i19]Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms:
Subquadratic Encodings for Point Configurations. CoRR abs/1801.01767 (2018) - [i18]Timothy M. Chan:
Tree Drawings Revisited. CoRR abs/1803.07185 (2018) - [i17]Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis:
Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. CoRR abs/1805.08602 (2018) - [i16]Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff:
Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. CoRR abs/1806.02851 (2018) - [i15]Timothy M. Chan, Sariel Har-Peled, Mitchell Jones:
On Locality-Sensitive Orderings and their Applications. CoRR abs/1809.11147 (2018) - 2017
- [j80]Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou:
Succinct Indices for Path Minimum, with Applications. Algorithmica 78(2): 453-491 (2017) - [j79]Hicham El-Zein, Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Timothy M. Chan:
On the Succinct Representation of Equivalence Classes. Algorithmica 78(3): 1020-1040 (2017) - [j78]Timothy M. Chan, Zahed Rahmati:
Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points. Comput. Geom. 60: 2-7 (2017) - [j77]Timothy M. Chan, Dimitrios Skrepetos:
Dynamic data structures for approximate Hausdorff distance in the word RAM. Comput. Geom. 60: 37-44 (2017) - [j76]Peyman Afshani, Jérémy Barbay, Timothy M. Chan:
Instance-Optimal Geometric Algorithms. J. ACM 64(1): 3:1-3:38 (2017) - [j75]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:
How to Morph Planar Graph Drawings. SIAM J. Comput. 46(2): 824-852 (2017) - [c122]Timothy M. Chan:
Applications of Chebyshev Polynomials to Low-Dimensional Computational Geometry. SoCG 2017: 26:1-26:15 - [c121]Timothy M. Chan:
Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back. SoCG 2017: 27:1-27:15 - [c120]Timothy M. Chan, Konstantinos Tsakalidis:
Dynamic Orthogonal Range Searching on the RAM, Revisited. SoCG 2017: 28:1-28:13 - [c119]Timothy M. Chan, Dimitrios Skrepetos:
Faster Approximate Diameter and Distance Oracles in Planar Graphs. ESA 2017: 25:1-25:13 - [c118]Therese Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw:
Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges. GD 2017: 305-317 - [c117]Timothy M. Chan, Dimitrios Skrepetos:
All-Pairs Shortest Paths in Geometric Intersection Graphs. WADS 2017: 253-264 - [c116]Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour:
On Guarding Orthogonal Polygons with Sliding Cameras. WALCOM 2017: 54-65 - [i14]Therese Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw:
Improved Bounds for Drawing Trees on Fixed Points with L-shaped Edges. CoRR abs/1709.01456 (2017) - 2016
- [j74]Timothy M. Chan:
A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions. Discret. Comput. Geom. 56(4): 860-865 (2016) - [j73]Timothy M. Chan, Konstantinos Tsakalidis:
Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings. Discret. Comput. Geom. 56(4): 866-881 (2016) - [j72]Timothy M. Chan, Bryan T. Wilkinson:
Adaptive and Approximate Orthogonal Range Counting. ACM Trans. Algorithms 12(4): 45:1-45:15 (2016) - [c115]Timothy M. Chan:
Dynamic Streaming Algorithms for Epsilon-Kernels. SoCG 2016: 27:1-27:11 - [c114]Timothy M. Chan, Simon Pratt:
Two Approaches to Building Time-Windowed Geometric Data Structures. SoCG 2016: 28:1-28:15 - [c113]Josh Alman, Timothy M. Chan, R. Ryan Williams:
Polynomial Representations of Threshold Functions and Algorithmic Applications. FOCS 2016: 467-476 - [c112]Timothy M. Chan, Dimitrios Skrepetos:
All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time. ISAAC 2016: 24:1-24:13 - [c111]Timothy M. Chan:
Improved Deterministic Algorithms for Linear Programming in Low Dimensions. SODA 2016: 1213-1219 - [c110]Timothy M. Chan, Ryan Williams:
Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky. SODA 2016: 1246-1255 - [c109]Timothy M. Chan, Zahed Rahmati:
A Clustering-Based Approach to Kinetic Closest Pair. SWAT 2016: 28:1-28:13 - [i13]Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour:
On Guarding Orthogonal Polygons with Sliding Cameras. CoRR abs/1604.07099 (2016) - [i12]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:
How to morph planar graph drawings. CoRR abs/1606.00425 (2016) - [i11]Josh Alman, Timothy M. Chan, Ryan Williams:
Polynomial Representations of Threshold Functions and Algorithmic Applications. CoRR abs/1608.04355 (2016) - 2015
- [j71]Timothy M. Chan, Stephane Durocher, Matthew Skala, Bryan T. Wilkinson:
Linear-Space Data Structures for Range Minority Query in Arrays. Algorithmica 72(4): 901-913 (2015) - [j70]Timothy M. Chan, Nan Hu:
Geometric red-blue set cover for unit squares and related problems. Comput. Geom. 48(5): 380-385 (2015) - [j69]Timothy M. Chan, Rolf Klein:
Guest Editor's foreword. Comput. Geom. 48(8): 552-553 (2015) - [j68]Timothy M. Chan, Patrick Lee:
On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures. Discret. Comput. Geom. 53(3): 489-513 (2015) - [j67]Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer:
Drawing Partially Embedded and Simultaneously Planar Graphs. J. Graph Algorithms Appl. 19(2): 681-706 (2015) - [j66]Timothy M. Chan, J. Ian Munro, Venkatesh Raman:
Finding median in read-only memory on integer input. Theor. Comput. Sci. 583: 51-56 (2015) - [c108]Timothy M. Chan, Simon Pratt:
Time-Windowed Closest Pair. CCCG 2015 - [c107]Timothy M. Chan, Zahed Rahmati:
Approximating the Minimum Closest Pair Distance and Nearest Neighbor Distances of Linearly Moving Points. CCCG 2015 - [c106]Timothy M. Chan, Dimitrios Skrepetos:
Dynamic data structures for approximate Hausdorff distance in the word RAM. CCCG 2015 - [c105]Timothy M. Chan, Konstantinos Tsakalidis:
Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings. SoCG 2015: 719-732 - [c104]Timothy M. Chan:
A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions. SoCG 2015: 733-738 - [c103]Timothy M. Chan, Moshe Lewenstein:
Fast String Dictionary Lookup with One Error. CPM 2015: 114-123 - [c102]Timothy M. Chan, Yakov Nekrich:
Towards an Optimal Method for Dynamic Planar Point Location. FOCS 2015: 390-409 - [c101]Timothy M. Chan, Gelin Zhou:
Multidimensional Range Selection. ISAAC 2015: 83-92 - [c100]Timothy M. Chan:
Speeding up the Four Russians Algorithm by About One More Logarithmic Factor. SODA 2015: 212-217 - [c99]Timothy M. Chan, Moshe Lewenstein:
Clustered Integer 3SUM via Additive Combinatorics. STOC 2015: 31-40 - [i10]Timothy M. Chan, Moshe Lewenstein:
Clustered Integer 3SUM via Additive Combinatorics. CoRR abs/1502.05204 (2015) - [i9]Peyman Afshani, Jérémy Barbay, Timothy M. Chan:
Instance Optimal Geometric Algorithms. CoRR abs/1505.00184 (2015) - 2014
- [j65]David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian:
Necklaces, Convolutions, and X+Y. Algorithmica 69(2): 294-314 (2014) - [j64]Timothy M. Chan, Elyot Grant:
Exact algorithms and APX-hardness results for geometric packing and covering problems. Comput. Geom. 47(2): 112-124 (2014) - [j63]Pegah Kamousi, Timothy M. Chan, Subhash Suri:
Closest pair and the post office problem for stochastic points. Comput. Geom. 47(2): 214-223 (2014) - [j62]Timothy M. Chan, Vinayak Pathak:
Streaming and dynamic algorithms for minimum enclosing balls in high dimensions. Comput. Geom. 47(2): 240-247 (2014) - [j61]Timothy M. Chan, Rolf Klein:
Guest Editors' Foreword. Discret. Comput. Geom. 52(3): 425-426 (2014) - [j60]Jérémy Barbay, Timothy M. Chan, Gonzalo Navarro, Pablo Pérez-Lantero:
Maximum-weight planar boxes in O(n2) time (and better). Inf. Process. Lett. 114(8): 437-445 (2014) - [j59]Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson:
Linear-Space Data Structures for Range Mode Query in Arrays. Theory Comput. Syst. 55(4): 719-741 (2014) - [c98]Timothy M. Chan:
Cuttings in 2D Revisited. CCCG 2014 - [c97]Timothy M. Chan, Patrick Lee:
On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures. SoCG 2014: 40 - [c96]Sunil Arya, Timothy M. Chan:
Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels. SoCG 2014: 416 - [c95]Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou:
Succinct Indices for Path Minimum, with Applications to Path Reporting. ESA 2014: 247-259 - [c94]Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer:
Drawing Partially Embedded and Simultaneously Planar Graphs. GD 2014: 25-39 - [c93]Peyman Afshani, Timothy M. Chan, Konstantinos Tsakalidis:
Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM. ICALP (1) 2014: 77-88 - [c92]Amihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein:
On Hardness of Jumbled Indexing. ICALP (1) 2014: 114-125 - [c91]Timothy M. Chan, J. Ian Munro, Venkatesh Raman:
Selection and Sorting in the "Restore" Model. SODA 2014: 995-1004 - [i8]Amihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein:
On Hardness of Jumbled Indexing. CoRR abs/1405.0189 (2014) - [i7]Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer:
Drawing Partially Embedded and Simultaneously Planar Graphs. CoRR abs/1410.8205 (2014) - 2013
- [j58]Timothy M. Chan:
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM. ACM Trans. Algorithms 9(3): 22:1-22:22 (2013) - [c90]Timothy M. Chan:
Quake Heaps: A Simple Alternative to Fibonacci Heaps. Space-Efficient Data Structures, Streams, and Algorithms 2013: 27-32 - [c89]Jérémy Barbay, Timothy M. Chan, Gonzalo Navarro, Pablo Pérez-Lantero:
Maximum-Weight Planar Boxes in O(n2) Time (and Better). CCCG 2013 - [c88]Timothy M. Chan, Nan Hu:
Geometric Red-Blue Set Cover for Unit Squares and Related Problems. CCCG 2013 - [c87]Timothy M. Chan:
Klee's Measure Problem Made Easy. FOCS 2013: 410-419 - [c86]Timothy M. Chan, Hella-Franziska Hoffmann, Stephen Kiazyk, Anna Lubiw:
Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations. GD 2013: 376-387 - [c85]Timothy M. Chan, J. Ian Munro, Venkatesh Raman:
Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers. ISAAC 2013: 405-412 - [c84]Timothy M. Chan, Bryan T. Wilkinson:
Adaptive and Approximate Orthogonal Range Counting. SODA 2013: 241-251 - [c83]Soroush Alamdari, Patrizio Angelini, Timothy M. Chan, Giuseppe Di Battista, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
Morphing Planar Graph Drawings with a Polynomial Number of Steps. SODA 2013: 1656-1667 - [c82]Soroush Alamdari, Therese Biedl, Timothy M. Chan, Elyot Grant, Krishnam Raju Jampani, Srinivasan Keshav, Anna Lubiw, Vinayak Pathak:
Smart-Grid Electricity Allocation via Strip Packing with Slicing. WADS 2013: 25-36 - [c81]Timothy M. Chan:
The Art of Shaving Logs. WADS 2013: 231 - [e1]Guilherme Dias da Fonseca, Thomas Lewiner, Luis Mariano Peñaranda, Timothy M. Chan, Rolf Klein:
Symposium on Computational Geometry 2013, SoCG '13, Rio de Janeiro, Brazil, June 17-20, 2013. ACM 2013, ISBN 978-1-4503-2031-3 [contents] - [i6]Soroush Alamdari, Timothy M. Chan, Elyot Grant, Anna Lubiw, Vinayak Pathak:
Self-Approaching Graphs. CoRR abs/1306.5460 (2013) - 2012
- [j57]Timothy M. Chan:
Optimal Partition Trees. Discret. Comput. Geom. 47(4): 661-690 (2012) - [j56]Timothy M. Chan:
On Levels in Arrangements of Surfaces in Three Dimensions. Discret. Comput. Geom. 48(1): 1-18 (2012) - [j55]Timothy M. Chan, Sariel Har-Peled:
Approximation Algorithms for Maximum Independent Set of Pseudo-Disks. Discret. Comput. Geom. 48(2): 373-392 (2012) - [j54]Timothy M. Chan:
Three Problems about Dynamic Convex Hulls. Int. J. Comput. Geom. Appl. 22(4): 341-364 (2012) - [j53]Timothy M. Chan:
All-pairs shortest paths for unweighted undirected graphs in o(mn) time. ACM Trans. Algorithms 8(4): 34:1-34:17 (2012) - [c80]Timothy M. Chan:
Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set. SCG 2012: 293-302 - [c79]Soroush Alamdari, Timothy M. Chan, Elyot Grant, Anna Lubiw, Vinayak Pathak:
Self-approaching Graphs. GD 2012: 260-271 - [c78]Timothy M. Chan:
Combinatorial Geometry and Approximation Algorithms. ISAAC 2012: 2 - [c77]David L. Millman, Steven Love, Timothy M. Chan, Jack Snoeyink:
Computing the Nearest Neighbor Transform Exactly with Only Double Precision. ISVD 2012: 66-74 - [c76]Timothy M. Chan, Elyot Grant, Jochen Könemann, Malcolm Sharpe:
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. SODA 2012: 1576-1585 - [c75]Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson:
Linear-Space Data Structures for Range Mode Query in Arrays. STACS 2012: 290-301 - [c74]Timothy M. Chan, Stephane Durocher, Matthew Skala, Bryan T. Wilkinson:
Linear-Space Data Structures for Range Minority Query in Arrays. SWAT 2012: 295-306 - [i5]David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian:
Necklaces, Convolutions, and X+Y. CoRR abs/1212.4771 (2012) - 2011
- [j52]Timothy M. Chan, Mihai Patrascu, Liam Roditty:
Dynamic Connectivity: Connecting to Networks and Geometry. SIAM J. Comput. 40(2): 333-349 (2011) - [c73]Timothy M. Chan, Bryan T. Wilkinson:
Bichromatic Line Segment Intersection Counting in O(n sqrt(log n)) Time. CCCG 2011 - [c72]Elyot Grant, Timothy M. Chan:
Exact Algorithms and APX-Hardness Results for Geometric Set Cover. CCCG 2011 - [c71]Timothy M. Chan, Kasper Green Larsen, Mihai Patrascu:
Orthogonal range searching on the RAM, revisited. SCG 2011: 1-10 - [c70]Timothy M. Chan:
Three problems about dynamic convex hulls. SCG 2011: 27-36 - [c69]Pegah Kamousi, Timothy M. Chan, Subhash Suri:
Stochastic minimum spanning trees in euclidean spaces. SCG 2011: 65-74 - [c68]Timothy M. Chan:
Persistent Predecessor Search and Orthogonal point Location on the Word RAM. SODA 2011: 1131-1145 - [c67]Timothy M. Chan:
Computational Geometry for Non-Geometers: Recent Developments on Some Classical Problems. SODA 2011: 1437 - [c66]Timothy M. Chan, Vinayak Pathak:
Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions. WADS 2011: 195-206 - [c65]Pegah Kamousi, Timothy M. Chan, Subhash Suri:
Closest Pair and the Post Office Problem for Stochastic Points. WADS 2011: 548-559 - [i4]Timothy M. Chan, Sariel Har-Peled:
Approximation Algorithms for Maximum Independent Set of Pseudo-Disks. CoRR abs/1103.1431 (2011) - [i3]Timothy M. Chan, Kasper Green Larsen, Mihai Patrascu:
Orthogonal Range Searching on the RAM, Revisited. CoRR abs/1103.5510 (2011) - 2010
- [j51]Timothy M. Chan:
A (slightly) faster algorithm for Klee's measure problem. Comput. Geom. 43(3): 243-250 (2010) - [j50]Timothy M. Chan, Eric Y. Chen:
Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection. Comput. Geom. 43(8): 636-646 (2010) - [j49]Timothy M. Chan:
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries. J. ACM 57(3): 16:1-16:15 (2010) - [j48]Timothy M. Chan:
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs. SIAM J. Comput. 39(5): 2075-2089 (2010) - [j47]Timothy M. Chan:
Comparison-based time-space lower bounds for selection. ACM Trans. Algorithms 6(2): 26:1-26:16 (2010) - [j46]Timothy M. Chan:
On the bichromatic k-set problem. ACM Trans. Algorithms 6(4): 62:1-62:20 (2010) - [c64]Timothy M. Chan:
Optimal partition trees. SCG 2010: 1-10 - [c63]Timothy M. Chan, Mihai Patrascu:
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems. SODA 2010: 161-173 - [i2]Timothy M. Chan, Mihai Patrascu:
Transdichotomous Results in Computational Geometry, II: Offline Search. CoRR abs/1010.1948 (2010)
2000 – 2009
- 2009
- [j45]Peyman Afshani, Timothy M. Chan:
Dynamic Connectivity for Axis-Parallel Rectangles. Algorithmica 53(4): 474-487 (2009) - [j44]Hamid Zarrabi-Zadeh, Timothy M. Chan:
An Improved Algorithm for Online Unit Clustering. Algorithmica 54(4): 490-500 (2009) - [j43]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:
Dynamic ham-sandwich cuts in the plane. Comput. Geom. 42(5): 419-428 (2009) - [j42]Peyman Afshani, Timothy M. Chan:
On Approximate Range Counting and Depth. Discret. Comput. Geom. 42(1): 3-21 (2009) - [j41]Timothy M. Chan:
Dynamic Coresets. Discret. Comput. Geom. 42(3): 469-488 (2009) - [j40]Timothy M. Chan, Hamid Zarrabi-Zadeh:
A Randomized Algorithm for Online Unit Clustering. Theory Comput. Syst. 45(3): 486-496 (2009) - [j39]Timothy M. Chan, Mihai Patrascu:
Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time. SIAM J. Comput. 39(2): 703-729 (2009) - [c62]Timothy M. Chan, Eric Y. Chen:
Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection. SCG 2009: 80-87 - [c61]Timothy M. Chan, Sariel Har-Peled:
Approximation algorithms for maximum independent set of pseudo-disks. SCG 2009: 333-340 - [c60]Peyman Afshani, Jérémy Barbay, Timothy M. Chan:
Instance-Optimal Geometric Algorithms. FOCS 2009: 129-138 - [c59]Timothy M. Chan:
Comparison-based time-space lower bounds for selection. SODA 2009: 140-149 - [c58]Peyman Afshani, Timothy M. Chan:
Optimal halfspace range reporting in three dimensions. SODA 2009: 180-186 - 2008
- [j38]Timothy M. Chan:
All-Pairs Shortest Paths with Real Weights in O ( n 3/log n ) Time. Algorithmica 50(2): 236-243 (2008) - [j37]Timothy M. Chan:
Well-separated pair decomposition in linear time? Inf. Process. Lett. 107(5): 138-141 (2008) - [c57]Timothy M. Chan:
Dynamic coresets. SCG 2008: 1-9 - [c56]Timothy M. Chan:
On levels in arrangements of curves, iii: further improvements. SCG 2008: 85-93 - [c55]Timothy M. Chan:
A (slightly) faster algorithm for klee's measure problem. SCG 2008: 94-100 - [c54]Timothy M. Chan, Mihai Patrascu, Liam Roditty:
Dynamic Connectivity: Connecting to Networks and Geometry. FOCS 2008: 95-104 - [c53]Timothy M. Chan:
On the bichromatic k-set problem. SODA 2008: 561-570 - [c52]Timothy M. Chan, Eric Y. Chen:
In-place 2-d nearest neighbor search. SODA 2008: 904-911 - [i1]Timothy M. Chan, Mihai Patrascu, Liam Roditty:
Dynamic Connectivity: Connecting to Networks and Geometry. CoRR abs/0808.1128 (2008) - 2007
- [j36]Timothy M. Chan, Eric Y. Chen:
Multi-Pass Geometric Algorithms. Discret. Comput. Geom. 37(1): 79-102 (2007) - [c51]Hamid Zarrabi-Zadeh, Timothy M. Chan:
An Improved Algorithm for Online Unit Clustering. COCOON 2007: 383-393 - [c50]Peyman Afshani, Timothy M. Chan:
On approximate range counting and depth. SCG 2007: 337-343 - [c49]Timothy M. Chan, Mihai Patrascu:
Voronoi diagrams in n·2osqrt(lg lg n) time. STOC 2007: 31-39 - [c48]Timothy M. Chan:
More algorithms for all-pairs shortest paths in weighted graphs. STOC 2007: 590-598 - 2006
- [j35]Hervé Brönnimann, Timothy M. Chan:
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time. Comput. Geom. 34(2): 75-82 (2006) - [j34]Timothy M. Chan:
Faster core-set constructions and data-stream algorithms in fixed dimensions. Comput. Geom. 35(1-2): 20-35 (2006) - [j33]Timothy M. Chan:
Three problems about simple polygons. Comput. Geom. 35(3): 209-217 (2006) - [j32]Timothy M. Chan, Bashir S. Sadjad:
Geometric Optimization Problems over Sliding Windows. Int. J. Comput. Geom. Appl. 16(2-3): 145-158 (2006) - [j31]Timothy M. Chan:
Dynamic Subgraph Connectivity with Geometric Applications. SIAM J. Comput. 36(3): 681-694 (2006) - [c47]Hamid Zarrabi-Zadeh, Timothy M. Chan:
A Simple Streaming Algorithm for Minimum Enclosing Balls. CCCG 2006 - [c46]Peyman Afshani, Timothy M. Chan:
Dynamic Connectivity for Axis-Parallel Rectangles. ESA 2006: 16-27 - [c45]David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian:
Necklaces, Convolutions, and X + Y. ESA 2006: 160-171 - [c44]Timothy M. Chan:
Point Location in o(log n) Time, Voronoi Diagrams in o(n log n) Time, and Other Transdichotomous Results in Computational Geometry. FOCS 2006: 333-344 - [c43]Timothy M. Chan:
All-pairs shortest paths for unweighted undirected graphs in o(mn) time. SODA 2006: 514-523 - [c42]Timothy M. Chan:
A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries. SODA 2006: 1196-1202 - [c41]Timothy M. Chan, Hamid Zarrabi-Zadeh:
A Randomized Algorithm for Online Unit Clustering. WAOA 2006: 121-131 - 2005
- [j30]Therese Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood:
Balanced vertex-orderings of graphs. Discret. Appl. Math. 148(1): 27-48 (2005) - [j29]Therese Biedl, Timothy M. Chan:
A note on 3D orthogonal graph drawing. Discret. Appl. Math. 148(2): 189-193 (2005) - [j28]Timothy M. Chan:
On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences. Discret. Comput. Geom. 34(1): 11-24 (2005) - [j27]Timothy M. Chan:
Low-Dimensional Linear Programming with Violations. SIAM J. Comput. 34(4): 879-893 (2005) - [c40]Timothy M. Chan, Abdullah-Al Mahmood:
Approximating the piercing number for unit-height rectangles. CCCG 2005: 15-18 - [c39]Peyman Afshani, Timothy M. Chan:
Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs. CCCG 2005: 19-22 - [c38]Eric Y. Chen, Timothy M. Chan:
Space-Efficient Algorithms for Klee's Measure Problem. CCCG 2005: 27-30 - [c37]Timothy M. Chan, Eric Y. Chen:
Multi-pass geometric algorithms. SCG 2005: 180-189 - [c36]Timothy M. Chan:
On levels in arrangements of surfaces in three dimensions. SODA 2005: 232-240 - [c35]Timothy M. Chan:
Finding the shortest bottleneck edge in a parametric minimum spanning tree. SODA 2005: 917-918 - [c34]Timothy M. Chan:
All-Pairs Shortest Paths with Real Weights in O(n3/log n) Time. WADS 2005: 318-324 - 2004
- [j26]Therese Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro:
Fun-Sort--or the chaos of unordered binary search. Discret. Appl. Math. 144(3): 231-236 (2004) - [j25]Timothy M. Chan:
Euclidean Bounded-Degree Spanning Tree Ratios. Discret. Comput. Geom. 32(2): 177-194 (2004) - [j24]Timothy M. Chan:
A note on maximum independent sets in rectangle intersection graphs. Inf. Process. Lett. 89(1): 19-23 (2004) - [c33]Timothy M. Chan:
Faster core-set constructions and data stream algorithms in fixed dimensions. SCG 2004: 152-159 - [c32]Hervé Brönnimann, Timothy M. Chan, Eric Y. Chen:
Towards in-place geometric algorithms and data structures. SCG 2004: 239-246 - [c31]Timothy M. Chan, Bashir S. Sadjad:
Geometric Optimization Problems Over Sliding Windows. ISAAC 2004: 246-258 - [c30]Hervé Brönnimann, Timothy M. Chan:
Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time. LATIN 2004: 162-171 - [c29]Timothy M. Chan:
An optimal randomized algorithm for maximum Tukey depth. SODA 2004: 430-436 - 2003
- [j23]Timothy M. Chan:
On Levels in Arrangements of Curves. Discret. Comput. Geom. 29(3): 375-393 (2003) - [j22]Timothy M. Chan:
A Fully Dynamic Algorithm for Planar Width. Discret. Comput. Geom. 30(1): 17-24 (2003) - [j21]Therese Biedl, Timothy M. Chan, Alejandro López-Ortiz:
Drawing K2, n: A lower bound. Inf. Process. Lett. 85(6): 303-305 (2003) - [j20]Timothy M. Chan:
Polynomial-time approximation schemes for packing and piercing fat objects. J. Algorithms 46(2): 178-189 (2003) - [j19]Timothy M. Chan:
Semi-Online Maintenance of Geometric Optima and Measures. SIAM J. Comput. 32(3): 700-716 (2003) - [c28]Eric Y. Chen, Timothy M. Chan:
A Space-Efficient Algorithm for Segment Intersection. CCCG 2003: 68-71 - [c27]Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper:
Curves of width one and the river shore problem. CCCG 2003: 73-75 - [c26]Timothy M. Chan:
Euclidean bounded-degree spanning tree ratios. SCG 2003: 11-19 - [c25]Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper:
the asteroid surveying problem and other puzzles. SCG 2003: 372-373 - [c24]Timothy M. Chan:
On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences. FOCS 2003: 544-550 - 2002
- [j18]Timothy M. Chan:
A Near-Linear Area Bound for Drawing Binary Trees. Algorithmica 34(1): 1-13 (2002) - [j17]Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia:
Optimizing area and aspect ration in straight-line orthogonal tree drawings. Comput. Geom. 23(2): 153-162 (2002) - [j16]Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang:
Balanced k-colorings. Discret. Math. 254(1-3): 19-32 (2002) - [j15]Timothy M. Chan:
Approximating the Diameter, Width, Smallest Enclosing Cylinder, and Minimum-Width Annulus. Int. J. Comput. Geom. Appl. 12(1-2): 67-85 (2002) - [c23]Therese Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang:
Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. CCCG 2002: 105-108 - [c22]Therese Biedl, Timothy M. Chan, Alejandro López-Ortiz:
Drawing k2, n: A lower bound. CCCG 2002: 146-148 - [c21]Timothy M. Chan:
Low-Dimensional Linear Programming with Violations. FOCS 2002: 570- - [c20]Timothy M. Chan:
Closest-point problems simplified on the RAM. SODA 2002: 472-473 - [c19]Timothy M. Chan:
Semi-online maintenance of geometric optima and measures. SODA 2002: 474-483 - [c18]Timothy M. Chan:
Dynamic subgraph connectivity with geometric applications. STOC 2002: 7-13 - 2001
- [j14]Timothy M. Chan:
On Enumerating and Selecting Distances. Int. J. Comput. Geom. Appl. 11(3): 291-304 (2001) - [j13]Timothy M. Chan:
Dynamic planar convex hull operations in near-logarithmaic amortized time. J. ACM 48(1): 1-12 (2001) - [j12]Timothy M. Chan, Alon Efrat:
Fly Cheaply: On the Minimum Fuel Consumption Problem. J. Algorithms 41(2): 330-337 (2001) - [c17]Timothy M. Chan:
A fully dynamic algorithm for planar. SCG 2001: 172-176 - 2000
- [j11]Timothy M. Chan:
Reporting curve segment intersections using restricted predicates. Comput. Geom. 16(4): 245-256 (2000) - [j10]Timothy M. Chan:
Random Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three Dimensions. SIAM J. Comput. 30(2): 561-575 (2000) - [c16]Timothy M. Chan:
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus. SCG 2000: 300-309 - [c15]Timothy M. Chan:
On Levels in Arrangements of Curves. FOCS 2000: 219-227 - [c14]Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang:
Balanced k-Colorings. MFCS 2000: 202-211
1990 – 1999
- 1999
- [j9]Timothy M. Chan:
More planar two-center algorithms. Comput. Geom. 13(3): 189-198 (1999) - [j8]Timothy M. Chan:
Geometric Applications of a Randomized Optimization Technique. Discret. Comput. Geom. 22(4): 547-567 (1999) - [c13]Timothy M. Chan:
Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time. FOCS 1999: 92-99 - [c12]Timothy M. Chan:
A Near-Linear Area Bound for Drawing Binary Trees. SODA 1999: 161-168 - 1998
- [j7]Pankaj K. Agarwal, Boris Aronov, Timothy M. Chan, Micha Sharir:
On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. Discret. Comput. Geom. 19(3): 315-331 (1998) - [j6]Timothy M. Chan:
Approximate Nearest Neighbor Queries Revisited. Discret. Comput. Geom. 20(3): 359-373 (1998) - [j5]Timothy M. Chan:
Backwards Analysis of the Karger-Klein-Tarjan Algorithm for Minimum Spanning Trees. Inf. Process. Lett. 67(6): 303-304 (1998) - [j4]Timothy M. Chan:
Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming. J. Algorithms 27(1): 147-166 (1998) - [c11]Timothy M. Chan:
Geometric Applications of a Randomized Optimization Technique. SCG 1998: 269-278 - [c10]Timothy M. Chan:
On Enumerating and Selecting Distances. SCG 1998: 279-286 - [c9]Timothy M. Chan:
Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three Dimensions. FOCS 1998: 586-595 - 1997
- [j3]Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap:
Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams. Discret. Comput. Geom. 18(4): 433-454 (1997) - [c8]Timothy M. Chan:
Approximate Nearest Neighbor Queries Revisited. SCG 1997: 352-358 - [c7]Timothy M. Chan:
Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming. SODA 1997: 464-472 - 1996
- [j2]Timothy M. Chan:
Optimal Output-Sensitive Convex Hull Algorithms in Two and Three Dimensions. Discret. Comput. Geom. 16(4): 361-368 (1996) - [j1]Timothy M. Chan:
Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems. Discret. Comput. Geom. 16(4): 369-387 (1996) - [c6]Timothy M. Chan:
Fixed-Dimensional Linear Programming Queries Made Easy. SCG 1996: 284-290 - [c5]Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia:
Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. GD 1996: 63-75 - 1995
- [c4]Sariel Har-Peled, Timothy M. Chan, Boris Aronov, Dan Halperin, Jack Snoeyink:
The complexity of a single face of a minkowski sum. CCCG 1995: 91-96 - [c3]Timothy M. Chan:
Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems. SCG 1995: 10-19 - [c2]Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap:
Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. SODA 1995: 282-291 - 1994
- [c1]Timothy M. Chan:
A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections. CCCG 1994: 263-268
Coauthor Index
Therese Biedl
aka: Therese C. Biedl
aka: Therese C. Biedl
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-11 20:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
